/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-simple/nested_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 02:55:04,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 02:55:04,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 02:55:04,947 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 02:55:04,947 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 02:55:04,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 02:55:04,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 02:55:04,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 02:55:04,956 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 02:55:04,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 02:55:04,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 02:55:04,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 02:55:04,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 02:55:04,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 02:55:04,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 02:55:04,961 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 02:55:04,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 02:55:04,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 02:55:04,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 02:55:04,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 02:55:04,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 02:55:04,970 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 02:55:04,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 02:55:04,976 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 02:55:04,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 02:55:04,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 02:55:04,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 02:55:04,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 02:55:04,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 02:55:04,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 02:55:04,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 02:55:04,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 02:55:04,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 02:55:04,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 02:55:04,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 02:55:04,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 02:55:04,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 02:55:04,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 02:55:04,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 02:55:04,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 02:55:04,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 02:55:04,990 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 02:55:05,015 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 02:55:05,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 02:55:05,016 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 02:55:05,016 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 02:55:05,016 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 02:55:05,016 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 02:55:05,017 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 02:55:05,017 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 02:55:05,017 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 02:55:05,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 02:55:05,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 02:55:05,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 02:55:05,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 02:55:05,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 02:55:05,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 02:55:05,018 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 02:55:05,018 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 02:55:05,018 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 02:55:05,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 02:55:05,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 02:55:05,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 02:55:05,019 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 02:55:05,019 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 02:55:05,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:55:05,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 02:55:05,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 02:55:05,020 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 02:55:05,020 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 02:55:05,020 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 02:55:05,020 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 02:55:05,020 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 02:55:05,020 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 02:55:05,021 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 02:55:05,021 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 02:55:05,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 02:55:05,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 02:55:05,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 02:55:05,237 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 02:55:05,237 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 02:55:05,238 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_3.c [2022-01-10 02:55:05,300 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad7846c77/cee839c022ee4dfd8164b28f2cb82a5e/FLAGf7965a230 [2022-01-10 02:55:05,667 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 02:55:05,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_3.c [2022-01-10 02:55:05,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad7846c77/cee839c022ee4dfd8164b28f2cb82a5e/FLAGf7965a230 [2022-01-10 02:55:05,686 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad7846c77/cee839c022ee4dfd8164b28f2cb82a5e [2022-01-10 02:55:05,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 02:55:05,690 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 02:55:05,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 02:55:05,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 02:55:05,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 02:55:05,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:55:05" (1/1) ... [2022-01-10 02:55:05,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@603c261e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:55:05, skipping insertion in model container [2022-01-10 02:55:05,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:55:05" (1/1) ... [2022-01-10 02:55:05,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 02:55:05,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 02:55:05,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_3.c[784,797] [2022-01-10 02:55:05,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:55:05,865 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 02:55:05,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_3.c[784,797] [2022-01-10 02:55:05,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:55:05,912 INFO L208 MainTranslator]: Completed translation [2022-01-10 02:55:05,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:55:05 WrapperNode [2022-01-10 02:55:05,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 02:55:05,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 02:55:05,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 02:55:05,914 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 02:55:05,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:55:05" (1/1) ... [2022-01-10 02:55:05,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:55:05" (1/1) ... [2022-01-10 02:55:05,942 INFO L137 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2022-01-10 02:55:05,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 02:55:05,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 02:55:05,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 02:55:05,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 02:55:05,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:55:05" (1/1) ... [2022-01-10 02:55:05,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:55:05" (1/1) ... [2022-01-10 02:55:05,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:55:05" (1/1) ... [2022-01-10 02:55:05,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:55:05" (1/1) ... [2022-01-10 02:55:05,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:55:05" (1/1) ... [2022-01-10 02:55:05,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:55:05" (1/1) ... [2022-01-10 02:55:05,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:55:05" (1/1) ... [2022-01-10 02:55:05,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 02:55:05,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 02:55:05,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 02:55:05,969 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 02:55:05,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:55:05" (1/1) ... [2022-01-10 02:55:05,977 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:55:05,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:55:05,999 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 02:55:06,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 02:55:06,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 02:55:06,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 02:55:06,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 02:55:06,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 02:55:06,070 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 02:55:06,071 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 02:55:06,195 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 02:55:06,198 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 02:55:06,199 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-10 02:55:06,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:55:06 BoogieIcfgContainer [2022-01-10 02:55:06,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 02:55:06,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 02:55:06,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 02:55:06,204 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 02:55:06,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:55:05" (1/3) ... [2022-01-10 02:55:06,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5361044f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:55:06, skipping insertion in model container [2022-01-10 02:55:06,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:55:05" (2/3) ... [2022-01-10 02:55:06,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5361044f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:55:06, skipping insertion in model container [2022-01-10 02:55:06,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:55:06" (3/3) ... [2022-01-10 02:55:06,207 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_3.c [2022-01-10 02:55:06,210 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 02:55:06,211 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 02:55:06,253 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 02:55:06,259 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 02:55:06,259 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 02:55:06,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:06,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-01-10 02:55:06,279 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:55:06,279 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-01-10 02:55:06,280 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:55:06,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:55:06,283 INFO L85 PathProgramCache]: Analyzing trace with hash 28726596, now seen corresponding path program 1 times [2022-01-10 02:55:06,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:55:06,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646930036] [2022-01-10 02:55:06,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:55:06,292 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:55:06,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:55:06,294 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:55:06,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 02:55:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:55:06,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 02:55:06,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:55:06,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:55:06,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:55:06,418 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:55:06,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646930036] [2022-01-10 02:55:06,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646930036] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:55:06,419 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:55:06,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 02:55:06,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116683776] [2022-01-10 02:55:06,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:55:06,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 02:55:06,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:55:06,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 02:55:06,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 02:55:06,447 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:55:06,457 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2022-01-10 02:55:06,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 02:55:06,460 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-01-10 02:55:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:55:06,464 INFO L225 Difference]: With dead ends: 28 [2022-01-10 02:55:06,464 INFO L226 Difference]: Without dead ends: 11 [2022-01-10 02:55:06,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 02:55:06,470 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:55:06,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:55:06,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-01-10 02:55:06,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-01-10 02:55:06,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:06,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2022-01-10 02:55:06,491 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2022-01-10 02:55:06,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:55:06,491 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2022-01-10 02:55:06,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:06,492 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2022-01-10 02:55:06,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-01-10 02:55:06,493 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:55:06,493 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-01-10 02:55:06,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 02:55:06,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:55:06,703 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:55:06,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:55:06,705 INFO L85 PathProgramCache]: Analyzing trace with hash 28697766, now seen corresponding path program 1 times [2022-01-10 02:55:06,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:55:06,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479870439] [2022-01-10 02:55:06,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:55:06,707 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:55:06,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:55:06,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:55:06,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 02:55:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:55:06,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:55:06,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:55:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:55:06,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:55:06,787 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:55:06,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479870439] [2022-01-10 02:55:06,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479870439] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:55:06,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:55:06,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:55:06,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120181818] [2022-01-10 02:55:06,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:55:06,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:55:06,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:55:06,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:55:06,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:55:06,802 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:06,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:55:06,822 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-01-10 02:55:06,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:55:06,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-01-10 02:55:06,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:55:06,823 INFO L225 Difference]: With dead ends: 20 [2022-01-10 02:55:06,823 INFO L226 Difference]: Without dead ends: 17 [2022-01-10 02:55:06,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:55:06,824 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:55:06,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:55:06,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-01-10 02:55:06,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2022-01-10 02:55:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2022-01-10 02:55:06,827 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 5 [2022-01-10 02:55:06,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:55:06,827 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2022-01-10 02:55:06,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2022-01-10 02:55:06,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-10 02:55:06,828 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:55:06,828 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:55:06,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 02:55:07,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:55:07,035 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:55:07,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:55:07,035 INFO L85 PathProgramCache]: Analyzing trace with hash 269702254, now seen corresponding path program 1 times [2022-01-10 02:55:07,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:55:07,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105898522] [2022-01-10 02:55:07,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:55:07,036 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:55:07,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:55:07,037 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:55:07,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 02:55:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:55:07,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:55:07,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:55:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:55:07,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:55:07,095 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:55:07,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105898522] [2022-01-10 02:55:07,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105898522] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:55:07,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:55:07,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:55:07,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95166575] [2022-01-10 02:55:07,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:55:07,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:55:07,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:55:07,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:55:07,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:55:07,097 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:07,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:55:07,110 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-01-10 02:55:07,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:55:07,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-01-10 02:55:07,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:55:07,111 INFO L225 Difference]: With dead ends: 25 [2022-01-10 02:55:07,111 INFO L226 Difference]: Without dead ends: 16 [2022-01-10 02:55:07,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:55:07,113 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:55:07,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 18 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:55:07,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-01-10 02:55:07,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2022-01-10 02:55:07,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-01-10 02:55:07,116 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2022-01-10 02:55:07,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:55:07,116 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-01-10 02:55:07,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:07,116 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-01-10 02:55:07,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 02:55:07,117 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:55:07,117 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:55:07,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 02:55:07,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:55:07,321 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:55:07,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:55:07,322 INFO L85 PathProgramCache]: Analyzing trace with hash 904437762, now seen corresponding path program 1 times [2022-01-10 02:55:07,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:55:07,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456457428] [2022-01-10 02:55:07,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:55:07,323 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:55:07,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:55:07,326 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:55:07,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 02:55:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:55:07,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:55:07,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:55:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:55:07,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:55:07,385 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:55:07,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456457428] [2022-01-10 02:55:07,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456457428] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:55:07,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:55:07,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:55:07,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729042288] [2022-01-10 02:55:07,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:55:07,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:55:07,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:55:07,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:55:07,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:55:07,389 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:07,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:55:07,404 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-01-10 02:55:07,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:55:07,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-01-10 02:55:07,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:55:07,405 INFO L225 Difference]: With dead ends: 25 [2022-01-10 02:55:07,405 INFO L226 Difference]: Without dead ends: 15 [2022-01-10 02:55:07,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:55:07,411 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:55:07,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:55:07,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-01-10 02:55:07,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-01-10 02:55:07,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:07,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-01-10 02:55:07,416 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2022-01-10 02:55:07,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:55:07,416 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-01-10 02:55:07,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:07,416 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-01-10 02:55:07,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 02:55:07,417 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:55:07,417 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:55:07,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 02:55:07,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:55:07,645 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:55:07,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:55:07,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2012164800, now seen corresponding path program 1 times [2022-01-10 02:55:07,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:55:07,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717144433] [2022-01-10 02:55:07,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:55:07,647 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:55:07,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:55:07,648 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:55:07,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 02:55:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:55:07,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:55:07,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:55:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:55:07,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:55:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:55:07,767 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:55:07,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717144433] [2022-01-10 02:55:07,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717144433] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:55:07,767 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:55:07,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 02:55:07,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350857607] [2022-01-10 02:55:07,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:55:07,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:55:07,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:55:07,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:55:07,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:55:07,769 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:55:07,797 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-01-10 02:55:07,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 02:55:07,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 02:55:07,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:55:07,798 INFO L225 Difference]: With dead ends: 31 [2022-01-10 02:55:07,798 INFO L226 Difference]: Without dead ends: 20 [2022-01-10 02:55:07,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:55:07,799 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:55:07,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 25 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:55:07,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-01-10 02:55:07,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-01-10 02:55:07,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:07,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-01-10 02:55:07,803 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2022-01-10 02:55:07,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:55:07,803 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-01-10 02:55:07,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:07,803 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-01-10 02:55:07,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 02:55:07,803 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:55:07,803 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:55:07,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 02:55:08,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:55:08,014 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:55:08,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:55:08,015 INFO L85 PathProgramCache]: Analyzing trace with hash -924137478, now seen corresponding path program 2 times [2022-01-10 02:55:08,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:55:08,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288416785] [2022-01-10 02:55:08,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 02:55:08,015 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:55:08,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:55:08,019 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:55:08,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 02:55:08,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 02:55:08,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:55:08,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 02:55:08,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:55:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:55:08,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:55:08,189 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:55:08,189 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:55:08,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288416785] [2022-01-10 02:55:08,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288416785] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:55:08,189 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:55:08,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-01-10 02:55:08,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146596860] [2022-01-10 02:55:08,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:55:08,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 02:55:08,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:55:08,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 02:55:08,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-01-10 02:55:08,191 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:08,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:55:08,240 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-01-10 02:55:08,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 02:55:08,241 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-10 02:55:08,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:55:08,241 INFO L225 Difference]: With dead ends: 41 [2022-01-10 02:55:08,241 INFO L226 Difference]: Without dead ends: 24 [2022-01-10 02:55:08,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-01-10 02:55:08,242 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:55:08,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 46 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:55:08,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-01-10 02:55:08,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-01-10 02:55:08,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-01-10 02:55:08,245 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 19 [2022-01-10 02:55:08,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:55:08,245 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-01-10 02:55:08,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:08,246 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-01-10 02:55:08,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 02:55:08,246 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:55:08,246 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:55:08,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 02:55:08,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:55:08,453 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:55:08,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:55:08,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1713377014, now seen corresponding path program 3 times [2022-01-10 02:55:08,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:55:08,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958131886] [2022-01-10 02:55:08,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 02:55:08,454 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:55:08,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:55:08,458 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:55:08,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 02:55:08,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-10 02:55:08,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:55:08,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:55:08,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:55:08,524 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-01-10 02:55:08,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:55:08,592 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-01-10 02:55:08,593 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:55:08,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958131886] [2022-01-10 02:55:08,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958131886] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:55:08,593 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:55:08,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 02:55:08,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294825605] [2022-01-10 02:55:08,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:55:08,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:55:08,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:55:08,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:55:08,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:55:08,594 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:08,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:55:08,632 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-01-10 02:55:08,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 02:55:08,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 02:55:08,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:55:08,633 INFO L225 Difference]: With dead ends: 81 [2022-01-10 02:55:08,633 INFO L226 Difference]: Without dead ends: 78 [2022-01-10 02:55:08,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:55:08,634 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:55:08,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 43 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:55:08,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-10 02:55:08,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-01-10 02:55:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 77 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2022-01-10 02:55:08,642 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 23 [2022-01-10 02:55:08,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:55:08,642 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2022-01-10 02:55:08,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2022-01-10 02:55:08,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-10 02:55:08,643 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:55:08,644 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2022-01-10 02:55:08,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 02:55:08,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:55:08,850 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:55:08,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:55:08,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1826433562, now seen corresponding path program 4 times [2022-01-10 02:55:08,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:55:08,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367922633] [2022-01-10 02:55:08,852 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 02:55:08,852 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:55:08,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:55:08,857 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:55:08,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 02:55:08,897 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 02:55:08,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:55:08,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:55:08,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:55:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 274 proven. 1 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2022-01-10 02:55:09,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:55:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 274 proven. 1 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2022-01-10 02:55:09,126 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:55:09,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367922633] [2022-01-10 02:55:09,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367922633] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:55:09,126 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:55:09,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 02:55:09,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283862262] [2022-01-10 02:55:09,126 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:55:09,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:55:09,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:55:09,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:55:09,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:55:09,127 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:55:09,167 INFO L93 Difference]: Finished difference Result 317 states and 355 transitions. [2022-01-10 02:55:09,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 02:55:09,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-01-10 02:55:09,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:55:09,169 INFO L225 Difference]: With dead ends: 317 [2022-01-10 02:55:09,169 INFO L226 Difference]: Without dead ends: 258 [2022-01-10 02:55:09,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:55:09,170 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:55:09,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 39 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:55:09,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-01-10 02:55:09,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2022-01-10 02:55:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 1.0817120622568093) internal successors, (278), 257 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:09,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 278 transitions. [2022-01-10 02:55:09,191 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 278 transitions. Word has length 77 [2022-01-10 02:55:09,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:55:09,192 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 278 transitions. [2022-01-10 02:55:09,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:09,192 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 278 transitions. [2022-01-10 02:55:09,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-01-10 02:55:09,207 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:55:09,207 INFO L514 BasicCegarLoop]: trace histogram [96, 96, 16, 16, 16, 4, 4, 4, 1, 1, 1, 1, 1] [2022-01-10 02:55:09,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-01-10 02:55:09,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:55:09,414 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:55:09,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:55:09,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1076464986, now seen corresponding path program 5 times [2022-01-10 02:55:09,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:55:09,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698988379] [2022-01-10 02:55:09,416 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-10 02:55:09,416 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:55:09,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:55:09,418 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:55:09,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 02:55:09,521 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-01-10 02:55:09,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:55:09,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 02:55:09,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:55:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 11102 backedges. 7014 proven. 526 refuted. 0 times theorem prover too weak. 3562 trivial. 0 not checked. [2022-01-10 02:55:09,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:55:10,317 INFO L134 CoverageAnalysis]: Checked inductivity of 11102 backedges. 7014 proven. 526 refuted. 0 times theorem prover too weak. 3562 trivial. 0 not checked. [2022-01-10 02:55:10,317 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:55:10,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698988379] [2022-01-10 02:55:10,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698988379] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:55:10,318 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:55:10,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-01-10 02:55:10,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998681312] [2022-01-10 02:55:10,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:55:10,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 02:55:10,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:55:10,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 02:55:10,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-01-10 02:55:10,319 INFO L87 Difference]: Start difference. First operand 258 states and 278 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:55:10,381 INFO L93 Difference]: Finished difference Result 572 states and 623 transitions. [2022-01-10 02:55:10,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 02:55:10,381 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 257 [2022-01-10 02:55:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:55:10,382 INFO L225 Difference]: With dead ends: 572 [2022-01-10 02:55:10,382 INFO L226 Difference]: Without dead ends: 378 [2022-01-10 02:55:10,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-01-10 02:55:10,384 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:55:10,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 131 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:55:10,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-01-10 02:55:10,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2022-01-10 02:55:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 1.0769230769230769) internal successors, (406), 377 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:10,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 406 transitions. [2022-01-10 02:55:10,408 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 406 transitions. Word has length 257 [2022-01-10 02:55:10,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:55:10,408 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 406 transitions. [2022-01-10 02:55:10,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:10,408 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 406 transitions. [2022-01-10 02:55:10,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2022-01-10 02:55:10,411 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:55:10,412 INFO L514 BasicCegarLoop]: trace histogram [144, 144, 24, 24, 24, 4, 4, 4, 1, 1, 1, 1, 1] [2022-01-10 02:55:10,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 02:55:10,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:55:10,620 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:55:10,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:55:10,621 INFO L85 PathProgramCache]: Analyzing trace with hash 382291622, now seen corresponding path program 6 times [2022-01-10 02:55:10,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:55:10,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381941872] [2022-01-10 02:55:10,621 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-10 02:55:10,622 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:55:10,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:55:10,623 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:55:10,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 02:55:11,386 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2022-01-10 02:55:11,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:55:11,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 02:55:11,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:55:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 24994 backedges. 0 proven. 18886 refuted. 0 times theorem prover too weak. 6108 trivial. 0 not checked. [2022-01-10 02:55:12,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:55:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 24994 backedges. 0 proven. 18886 refuted. 0 times theorem prover too weak. 6108 trivial. 0 not checked. [2022-01-10 02:55:12,818 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:55:12,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381941872] [2022-01-10 02:55:12,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381941872] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:55:12,818 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:55:12,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-01-10 02:55:12,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165990863] [2022-01-10 02:55:12,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:55:12,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 02:55:12,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:55:12,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 02:55:12,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-01-10 02:55:12,820 INFO L87 Difference]: Start difference. First operand 378 states and 406 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:12,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:55:12,876 INFO L93 Difference]: Finished difference Result 567 states and 610 transitions. [2022-01-10 02:55:12,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 02:55:12,877 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 377 [2022-01-10 02:55:12,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:55:12,879 INFO L225 Difference]: With dead ends: 567 [2022-01-10 02:55:12,879 INFO L226 Difference]: Without dead ends: 564 [2022-01-10 02:55:12,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 742 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-01-10 02:55:12,879 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 42 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:55:12,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 181 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:55:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-01-10 02:55:12,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2022-01-10 02:55:12,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 563 states have (on average 1.0763765541740675) internal successors, (606), 563 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 606 transitions. [2022-01-10 02:55:12,919 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 606 transitions. Word has length 377 [2022-01-10 02:55:12,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:55:12,919 INFO L470 AbstractCegarLoop]: Abstraction has 564 states and 606 transitions. [2022-01-10 02:55:12,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:12,919 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 606 transitions. [2022-01-10 02:55:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2022-01-10 02:55:12,929 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:55:12,929 INFO L514 BasicCegarLoop]: trace histogram [216, 216, 36, 36, 36, 6, 6, 6, 1, 1, 1, 1, 1] [2022-01-10 02:55:12,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 02:55:13,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:55:13,139 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:55:13,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:55:13,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1072389210, now seen corresponding path program 7 times [2022-01-10 02:55:13,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:55:13,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48270848] [2022-01-10 02:55:13,141 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-10 02:55:13,141 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:55:13,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:55:13,142 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:55:13,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 02:55:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:55:15,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-10 02:55:15,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:55:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 56373 backedges. 0 proven. 48558 refuted. 0 times theorem prover too weak. 7815 trivial. 0 not checked. [2022-01-10 02:55:16,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:55:17,776 INFO L134 CoverageAnalysis]: Checked inductivity of 56373 backedges. 0 proven. 48558 refuted. 0 times theorem prover too weak. 7815 trivial. 0 not checked. [2022-01-10 02:55:17,776 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:55:17,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48270848] [2022-01-10 02:55:17,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48270848] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:55:17,776 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:55:17,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2022-01-10 02:55:17,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121891181] [2022-01-10 02:55:17,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:55:17,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-10 02:55:17,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:55:17,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-10 02:55:17,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-01-10 02:55:17,778 INFO L87 Difference]: Start difference. First operand 564 states and 606 transitions. Second operand has 23 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 23 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:18,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:55:18,121 INFO L93 Difference]: Finished difference Result 658 states and 708 transitions. [2022-01-10 02:55:18,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-10 02:55:18,122 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 23 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 563 [2022-01-10 02:55:18,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:55:18,122 INFO L225 Difference]: With dead ends: 658 [2022-01-10 02:55:18,122 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 02:55:18,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1124 GetRequests, 1089 SyntacticMatches, 14 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-01-10 02:55:18,124 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 30 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:55:18,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 405 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:55:18,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 02:55:18,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 02:55:18,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 02:55:18,125 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 563 [2022-01-10 02:55:18,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:55:18,125 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 02:55:18,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 23 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:55:18,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 02:55:18,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 02:55:18,127 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 02:55:18,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 02:55:18,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:55:18,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 02:55:21,446 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 02:55:21,447 INFO L861 garLoopResultBuilder]: At program point L31(lines 15 32) the Hoare annotation is: true [2022-01-10 02:55:21,447 INFO L858 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-01-10 02:55:21,447 INFO L858 garLoopResultBuilder]: For program point L23-2(lines 23 25) no Hoare annotation was computed. [2022-01-10 02:55:21,447 INFO L854 garLoopResultBuilder]: At program point L23-3(lines 23 25) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_main_~b~0#1| (_ bv5 32))) (.cse0 (bvslt |ULTIMATE.start_main_~b~0#1| (_ bv6 32))) (.cse1 (= |ULTIMATE.start_main_~a~0#1| (_ bv5 32)))) (or (and (= |ULTIMATE.start_main_~a~0#1| (_ bv2 32)) .cse0) (and (= (_ bv4 32) |ULTIMATE.start_main_~b~0#1|) .cse1) (and (= (_ bv4 32) |ULTIMATE.start_main_~a~0#1|) .cse0) (and (= |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) .cse0) (and (= |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) .cse1) (and (= |ULTIMATE.start_main_~c~0#1| (_ bv0 32)) .cse1 .cse2) (and (= |ULTIMATE.start_main_~c~0#1| (_ bv5 32)) .cse1 .cse2) (and .cse1 (= |ULTIMATE.start_main_~c~0#1| (_ bv3 32)) .cse2) (and (= |ULTIMATE.start_main_~c~0#1| (_ bv1 32)) .cse1 .cse2) (and (= (_ bv4 32) |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2) (and (= |ULTIMATE.start_main_~a~0#1| (_ bv0 32)) .cse0) (and (= |ULTIMATE.start_main_~c~0#1| (_ bv6 32)) .cse1 .cse2) (and (= |ULTIMATE.start_main_~c~0#1| (_ bv2 32)) .cse1 .cse2) (and (= |ULTIMATE.start_main_~a~0#1| (_ bv3 32)) .cse0) (and (= |ULTIMATE.start_main_~b~0#1| (_ bv0 32)) .cse1) (and (= |ULTIMATE.start_main_~b~0#1| (_ bv3 32)) .cse1) (and (= |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) .cse1))) [2022-01-10 02:55:21,447 INFO L858 garLoopResultBuilder]: For program point L21-2(lines 21 27) no Hoare annotation was computed. [2022-01-10 02:55:21,448 INFO L854 garLoopResultBuilder]: At program point L21-3(lines 21 27) the Hoare annotation is: (or (= |ULTIMATE.start_main_~a~0#1| (_ bv3 32)) (= |ULTIMATE.start_main_~a~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~a~0#1| (_ bv2 32)) (= (_ bv4 32) |ULTIMATE.start_main_~a~0#1|) (and (= |ULTIMATE.start_main_~a~0#1| (_ bv6 32)) (= |ULTIMATE.start_main_~c~0#1| (_ bv6 32)) (= |ULTIMATE.start_main_~b~0#1| (_ bv6 32))) (= |ULTIMATE.start_main_~a~0#1| (_ bv5 32))) [2022-01-10 02:55:21,448 INFO L858 garLoopResultBuilder]: For program point L21-4(lines 15 32) no Hoare annotation was computed. [2022-01-10 02:55:21,448 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 02:55:21,448 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 02:55:21,448 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 02:55:21,448 INFO L858 garLoopResultBuilder]: For program point L28-1(lines 28 30) no Hoare annotation was computed. [2022-01-10 02:55:21,448 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 29) no Hoare annotation was computed. [2022-01-10 02:55:21,448 INFO L858 garLoopResultBuilder]: For program point L22-2(lines 22 26) no Hoare annotation was computed. [2022-01-10 02:55:21,449 INFO L854 garLoopResultBuilder]: At program point L22-3(lines 22 26) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~a~0#1| (_ bv5 32)))) (or (and (= (_ bv4 32) |ULTIMATE.start_main_~b~0#1|) .cse0) (= |ULTIMATE.start_main_~a~0#1| (_ bv3 32)) (and (= |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) .cse0) (and (= |ULTIMATE.start_main_~c~0#1| (_ bv6 32)) (= |ULTIMATE.start_main_~b~0#1| (_ bv6 32)) .cse0) (= |ULTIMATE.start_main_~a~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) (and .cse0 (= |ULTIMATE.start_main_~b~0#1| (_ bv5 32))) (= |ULTIMATE.start_main_~a~0#1| (_ bv2 32)) (= (_ bv4 32) |ULTIMATE.start_main_~a~0#1|) (and (= |ULTIMATE.start_main_~b~0#1| (_ bv0 32)) .cse0) (and (= |ULTIMATE.start_main_~b~0#1| (_ bv3 32)) .cse0) (and (= |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) .cse0))) [2022-01-10 02:55:21,452 INFO L732 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1] [2022-01-10 02:55:21,453 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 02:55:21,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:55:21 BoogieIcfgContainer [2022-01-10 02:55:21,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 02:55:21,469 INFO L158 Benchmark]: Toolchain (without parser) took 15778.41ms. Allocated memory was 172.0MB in the beginning and 302.0MB in the end (delta: 130.0MB). Free memory was 114.6MB in the beginning and 114.6MB in the end (delta: 4.9kB). Peak memory consumption was 152.3MB. Max. memory is 8.0GB. [2022-01-10 02:55:21,469 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 172.0MB. Free memory was 130.6MB in the beginning and 130.5MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 02:55:21,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.67ms. Allocated memory was 172.0MB in the beginning and 251.7MB in the end (delta: 79.7MB). Free memory was 114.5MB in the beginning and 224.3MB in the end (delta: -109.8MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-01-10 02:55:21,470 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.67ms. Allocated memory is still 251.7MB. Free memory was 224.3MB in the beginning and 222.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 02:55:21,470 INFO L158 Benchmark]: Boogie Preprocessor took 25.38ms. Allocated memory is still 251.7MB. Free memory was 222.8MB in the beginning and 221.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 02:55:21,470 INFO L158 Benchmark]: RCFGBuilder took 230.87ms. Allocated memory is still 251.7MB. Free memory was 221.7MB in the beginning and 211.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-10 02:55:21,471 INFO L158 Benchmark]: TraceAbstraction took 15267.18ms. Allocated memory was 251.7MB in the beginning and 302.0MB in the end (delta: 50.3MB). Free memory was 210.7MB in the beginning and 114.6MB in the end (delta: 96.1MB). Peak memory consumption was 168.6MB. Max. memory is 8.0GB. [2022-01-10 02:55:21,472 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 172.0MB. Free memory was 130.6MB in the beginning and 130.5MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.67ms. Allocated memory was 172.0MB in the beginning and 251.7MB in the end (delta: 79.7MB). Free memory was 114.5MB in the beginning and 224.3MB in the end (delta: -109.8MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.67ms. Allocated memory is still 251.7MB. Free memory was 224.3MB in the beginning and 222.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.38ms. Allocated memory is still 251.7MB. Free memory was 222.8MB in the beginning and 221.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 230.87ms. Allocated memory is still 251.7MB. Free memory was 221.7MB in the beginning and 211.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 15267.18ms. Allocated memory was 251.7MB in the beginning and 302.0MB in the end (delta: 50.3MB). Free memory was 210.7MB in the beginning and 114.6MB in the end (delta: 96.1MB). Peak memory consumption was 168.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 29]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 11, TraceHistogramMax: 216, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 163 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 942 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 734 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1197 IncrementalHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 208 mSDtfsCounter, 1197 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2672 GetRequests, 2589 SyntacticMatches, 14 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=564occurred in iteration=10, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 306 NumberOfFragments, 239 HoareAnnotationTreeSize, 4 FomulaSimplifications, 1940 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 4 FomulaSimplificationsInter, 4309 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1358 NumberOfCodeBlocks, 1049 NumberOfCodeBlocksAsserted, 129 NumberOfCheckSat, 2669 ConstructedInterpolants, 0 QuantifiedInterpolants, 10093 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1286 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 50489/186467 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((((a == 3bv32 || a == 0bv32) || a == 1bv32) || a == 2bv32) || 4bv32 == a) || ((a == 6bv32 && c == 6bv32) && b == 6bv32)) || a == 5bv32 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((((((((((((((a == 2bv32 && ~bvslt32(b, 6bv32)) || (4bv32 == b && a == 5bv32)) || (4bv32 == a && ~bvslt32(b, 6bv32))) || (a == 1bv32 && ~bvslt32(b, 6bv32))) || (b == 1bv32 && a == 5bv32)) || ((c == 0bv32 && a == 5bv32) && b == 5bv32)) || ((c == 5bv32 && a == 5bv32) && b == 5bv32)) || ((a == 5bv32 && c == 3bv32) && b == 5bv32)) || ((c == 1bv32 && a == 5bv32) && b == 5bv32)) || ((4bv32 == c && a == 5bv32) && b == 5bv32)) || (a == 0bv32 && ~bvslt32(b, 6bv32))) || ((c == 6bv32 && a == 5bv32) && b == 5bv32)) || ((c == 2bv32 && a == 5bv32) && b == 5bv32)) || (a == 3bv32 && ~bvslt32(b, 6bv32))) || (b == 0bv32 && a == 5bv32)) || (b == 3bv32 && a == 5bv32)) || (b == 2bv32 && a == 5bv32) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((((((((((4bv32 == b && a == 5bv32) || a == 3bv32) || (b == 1bv32 && a == 5bv32)) || ((c == 6bv32 && b == 6bv32) && a == 5bv32)) || a == 0bv32) || a == 1bv32) || (a == 5bv32 && b == 5bv32)) || a == 2bv32) || 4bv32 == a) || (b == 0bv32 && a == 5bv32)) || (b == 3bv32 && a == 5bv32)) || (b == 2bv32 && a == 5bv32) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-10 02:55:21,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...