/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-82.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 11:58:03,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 11:58:03,434 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 11:58:03,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 11:58:03,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 11:58:03,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 11:58:03,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 11:58:03,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 11:58:03,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 11:58:03,455 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 11:58:03,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 11:58:03,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 11:58:03,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 11:58:03,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 11:58:03,456 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 11:58:03,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 11:58:03,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 11:58:03,458 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 11:58:03,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 11:58:03,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 11:58:03,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 11:58:03,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 11:58:03,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 11:58:03,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 11:58:03,460 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 11:58:03,460 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 11:58:03,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 11:58:03,461 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 11:58:03,461 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 11:58:03,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 11:58:03,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 11:58:03,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 11:58:03,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 11:58:03,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 11:58:03,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 11:58:03,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 11:58:03,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 11:58:03,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 11:58:03,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 11:58:03,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 11:58:03,464 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 11:58:03,465 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 11:58:03,465 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 11:58:03,465 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 11:58:03,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 11:58:03,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 11:58:03,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 11:58:03,670 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 11:58:03,673 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 11:58:03,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-82.i [2023-12-19 11:58:05,052 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 11:58:05,231 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 11:58:05,233 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-82.i [2023-12-19 11:58:05,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d1c2901e/08b4033c06814444a3cf273a78078fea/FLAGd708351b1 [2023-12-19 11:58:05,251 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d1c2901e/08b4033c06814444a3cf273a78078fea [2023-12-19 11:58:05,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 11:58:05,254 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 11:58:05,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 11:58:05,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 11:58:05,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 11:58:05,259 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:58:05" (1/1) ... [2023-12-19 11:58:05,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c47a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:58:05, skipping insertion in model container [2023-12-19 11:58:05,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:58:05" (1/1) ... [2023-12-19 11:58:05,288 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 11:58:05,392 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-82.i[915,928] [2023-12-19 11:58:05,437 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 11:58:05,449 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 11:58:05,457 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-82.i[915,928] [2023-12-19 11:58:05,468 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 11:58:05,479 INFO L206 MainTranslator]: Completed translation [2023-12-19 11:58:05,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:58:05 WrapperNode [2023-12-19 11:58:05,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 11:58:05,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 11:58:05,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 11:58:05,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 11:58:05,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:58:05" (1/1) ... [2023-12-19 11:58:05,490 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:58:05" (1/1) ... [2023-12-19 11:58:05,526 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2023-12-19 11:58:05,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 11:58:05,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 11:58:05,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 11:58:05,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 11:58:05,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:58:05" (1/1) ... [2023-12-19 11:58:05,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:58:05" (1/1) ... [2023-12-19 11:58:05,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:58:05" (1/1) ... [2023-12-19 11:58:05,569 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-19 11:58:05,570 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:58:05" (1/1) ... [2023-12-19 11:58:05,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:58:05" (1/1) ... [2023-12-19 11:58:05,574 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:58:05" (1/1) ... [2023-12-19 11:58:05,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:58:05" (1/1) ... [2023-12-19 11:58:05,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:58:05" (1/1) ... [2023-12-19 11:58:05,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:58:05" (1/1) ... [2023-12-19 11:58:05,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 11:58:05,580 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 11:58:05,580 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 11:58:05,580 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 11:58:05,581 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:58:05" (1/1) ... [2023-12-19 11:58:05,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 11:58:05,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:58:05,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 11:58:05,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 11:58:05,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 11:58:05,669 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 11:58:05,670 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 11:58:05,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 11:58:05,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 11:58:05,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 11:58:05,725 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 11:58:05,729 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 11:58:05,935 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 11:58:05,959 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 11:58:05,959 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 11:58:05,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:58:05 BoogieIcfgContainer [2023-12-19 11:58:05,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 11:58:05,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 11:58:05,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 11:58:05,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 11:58:05,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 11:58:05" (1/3) ... [2023-12-19 11:58:05,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156cb5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:58:05, skipping insertion in model container [2023-12-19 11:58:05,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:58:05" (2/3) ... [2023-12-19 11:58:05,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156cb5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:58:05, skipping insertion in model container [2023-12-19 11:58:05,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:58:05" (3/3) ... [2023-12-19 11:58:05,965 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-82.i [2023-12-19 11:58:05,984 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 11:58:05,984 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 11:58:06,024 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 11:58:06,030 INFO L357 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=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7917cc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 11:58:06,030 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 11:58:06,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 11:58:06,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-19 11:58:06,042 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:58:06,043 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:58:06,043 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:58:06,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:58:06,049 INFO L85 PathProgramCache]: Analyzing trace with hash 399764016, now seen corresponding path program 1 times [2023-12-19 11:58:06,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:58:06,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001064278] [2023-12-19 11:58:06,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:58:06,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:58:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:06,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:58:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:06,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:58:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:06,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:58:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:06,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:58:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:06,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 11:58:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:06,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:58:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-19 11:58:06,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:58:06,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001064278] [2023-12-19 11:58:06,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001064278] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:58:06,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:58:06,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 11:58:06,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156496586] [2023-12-19 11:58:06,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:58:06,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 11:58:06,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:58:06,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 11:58:06,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 11:58:06,342 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-19 11:58:06,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:58:06,379 INFO L93 Difference]: Finished difference Result 69 states and 112 transitions. [2023-12-19 11:58:06,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 11:58:06,381 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2023-12-19 11:58:06,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:58:06,387 INFO L225 Difference]: With dead ends: 69 [2023-12-19 11:58:06,387 INFO L226 Difference]: Without dead ends: 33 [2023-12-19 11:58:06,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 11:58:06,392 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:58:06,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:58:06,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-19 11:58:06,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-19 11:58:06,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 11:58:06,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2023-12-19 11:58:06,424 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 46 [2023-12-19 11:58:06,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:58:06,424 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2023-12-19 11:58:06,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-19 11:58:06,424 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2023-12-19 11:58:06,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-19 11:58:06,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:58:06,427 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:58:06,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 11:58:06,428 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:58:06,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:58:06,429 INFO L85 PathProgramCache]: Analyzing trace with hash -550470476, now seen corresponding path program 1 times [2023-12-19 11:58:06,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:58:06,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895893171] [2023-12-19 11:58:06,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:58:06,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:58:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:06,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:58:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:06,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:58:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:06,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:58:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:06,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:58:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:06,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 11:58:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:06,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:58:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-19 11:58:06,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:58:06,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895893171] [2023-12-19 11:58:06,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895893171] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:58:06,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:58:06,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 11:58:06,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297647203] [2023-12-19 11:58:06,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:58:06,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 11:58:06,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:58:06,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 11:58:06,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 11:58:06,676 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-19 11:58:06,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:58:06,734 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2023-12-19 11:58:06,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 11:58:06,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2023-12-19 11:58:06,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:58:06,737 INFO L225 Difference]: With dead ends: 79 [2023-12-19 11:58:06,737 INFO L226 Difference]: Without dead ends: 47 [2023-12-19 11:58:06,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 11:58:06,738 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 17 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:58:06,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 106 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:58:06,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-19 11:58:06,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2023-12-19 11:58:06,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 11:58:06,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2023-12-19 11:58:06,748 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 46 [2023-12-19 11:58:06,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:58:06,749 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2023-12-19 11:58:06,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-19 11:58:06,749 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2023-12-19 11:58:06,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-19 11:58:06,752 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:58:06,752 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:58:06,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 11:58:06,752 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:58:06,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:58:06,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1176673383, now seen corresponding path program 1 times [2023-12-19 11:58:06,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:58:06,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432932099] [2023-12-19 11:58:06,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:58:06,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:58:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:07,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:58:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:07,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:58:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:07,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:58:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:07,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:58:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:07,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 11:58:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:07,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:58:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:07,155 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-19 11:58:07,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:58:07,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432932099] [2023-12-19 11:58:07,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432932099] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:58:07,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:58:07,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 11:58:07,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043765015] [2023-12-19 11:58:07,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:58:07,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 11:58:07,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:58:07,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 11:58:07,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 11:58:07,159 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-19 11:58:07,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:58:07,286 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2023-12-19 11:58:07,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 11:58:07,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 48 [2023-12-19 11:58:07,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:58:07,288 INFO L225 Difference]: With dead ends: 70 [2023-12-19 11:58:07,288 INFO L226 Difference]: Without dead ends: 68 [2023-12-19 11:58:07,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-19 11:58:07,292 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 50 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:58:07,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 175 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:58:07,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-19 11:58:07,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2023-12-19 11:58:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 42 states have internal predecessors, (50), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-19 11:58:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2023-12-19 11:58:07,306 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 48 [2023-12-19 11:58:07,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:58:07,306 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2023-12-19 11:58:07,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-19 11:58:07,307 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2023-12-19 11:58:07,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-19 11:58:07,307 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:58:07,307 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:58:07,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 11:58:07,308 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:58:07,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:58:07,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2002854494, now seen corresponding path program 1 times [2023-12-19 11:58:07,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:58:07,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267284278] [2023-12-19 11:58:07,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:58:07,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:58:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:07,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:58:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:07,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:58:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:07,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:58:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:07,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:58:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:07,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 11:58:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:07,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:58:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-19 11:58:07,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:58:07,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267284278] [2023-12-19 11:58:07,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267284278] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:58:07,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:58:07,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 11:58:07,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664193320] [2023-12-19 11:58:07,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:58:07,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 11:58:07,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:58:07,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 11:58:07,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-19 11:58:07,557 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-19 11:58:07,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:58:07,627 INFO L93 Difference]: Finished difference Result 134 states and 171 transitions. [2023-12-19 11:58:07,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 11:58:07,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2023-12-19 11:58:07,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:58:07,631 INFO L225 Difference]: With dead ends: 134 [2023-12-19 11:58:07,631 INFO L226 Difference]: Without dead ends: 88 [2023-12-19 11:58:07,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-19 11:58:07,635 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 32 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:58:07,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 88 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:58:07,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-19 11:58:07,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2023-12-19 11:58:07,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 64 states have internal predecessors, (73), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 11:58:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2023-12-19 11:58:07,659 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 49 [2023-12-19 11:58:07,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:58:07,659 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2023-12-19 11:58:07,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-19 11:58:07,659 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2023-12-19 11:58:07,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-19 11:58:07,663 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:58:07,663 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:58:07,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 11:58:07,664 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:58:07,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:58:07,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2033947364, now seen corresponding path program 1 times [2023-12-19 11:58:07,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:58:07,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314478155] [2023-12-19 11:58:07,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:58:07,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:58:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:07,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:58:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:07,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:58:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:07,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:58:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:07,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:58:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:07,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 11:58:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:07,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:58:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:07,910 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-19 11:58:07,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:58:07,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314478155] [2023-12-19 11:58:07,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314478155] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:58:07,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:58:07,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 11:58:07,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124040833] [2023-12-19 11:58:07,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:58:07,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 11:58:07,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:58:07,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 11:58:07,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 11:58:07,915 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-19 11:58:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:58:08,045 INFO L93 Difference]: Finished difference Result 180 states and 224 transitions. [2023-12-19 11:58:08,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 11:58:08,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2023-12-19 11:58:08,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:58:08,047 INFO L225 Difference]: With dead ends: 180 [2023-12-19 11:58:08,047 INFO L226 Difference]: Without dead ends: 105 [2023-12-19 11:58:08,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-19 11:58:08,050 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 33 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:58:08,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 157 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:58:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-19 11:58:08,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 68. [2023-12-19 11:58:08,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 11:58:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2023-12-19 11:58:08,069 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 49 [2023-12-19 11:58:08,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:58:08,070 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2023-12-19 11:58:08,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-19 11:58:08,070 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2023-12-19 11:58:08,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-19 11:58:08,072 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:58:08,072 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:58:08,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 11:58:08,073 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:58:08,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:58:08,073 INFO L85 PathProgramCache]: Analyzing trace with hash 639634093, now seen corresponding path program 1 times [2023-12-19 11:58:08,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:58:08,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513404367] [2023-12-19 11:58:08,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:58:08,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:58:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:08,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:58:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:08,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:58:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:08,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:58:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:08,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:58:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:08,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 11:58:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:08,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:58:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:08,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-19 11:58:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:08,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-19 11:58:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:08,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-19 11:58:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:08,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 11:58:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:08,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-19 11:58:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:08,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 11:58:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:58:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2023-12-19 11:58:08,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:58:08,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513404367] [2023-12-19 11:58:08,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513404367] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:58:08,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:58:08,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 11:58:08,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758297592] [2023-12-19 11:58:08,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:58:08,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 11:58:08,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:58:08,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 11:58:08,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 11:58:08,327 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-19 11:58:08,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:58:08,347 INFO L93 Difference]: Finished difference Result 106 states and 136 transitions. [2023-12-19 11:58:08,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 11:58:08,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 96 [2023-12-19 11:58:08,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:58:08,350 INFO L225 Difference]: With dead ends: 106 [2023-12-19 11:58:08,350 INFO L226 Difference]: Without dead ends: 0 [2023-12-19 11:58:08,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 11:58:08,353 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:58:08,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:58:08,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-19 11:58:08,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-19 11:58:08,354 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) [2023-12-19 11:58:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-19 11:58:08,354 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2023-12-19 11:58:08,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:58:08,355 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-19 11:58:08,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-19 11:58:08,355 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-19 11:58:08,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-19 11:58:08,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 11:58:08,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 11:58:08,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-19 11:58:08,420 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-19 11:58:08,421 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-19 11:58:08,421 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-19 11:58:08,421 INFO L899 garLoopResultBuilder]: For program point L69(lines 59 70) no Hoare annotation was computed. [2023-12-19 11:58:08,421 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (let ((.cse0 (div ~var_1_5~0 256))) (or (and (<= .cse0 0) (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) (<= 0 ~var_1_5~0)) (= (+ (* (div ~var_1_9~0 256) 256) ~var_1_5~0) (+ ~var_1_9~0 (* .cse0 256))))) [2023-12-19 11:58:08,421 INFO L895 garLoopResultBuilder]: At program point L61-1(line 61) the Hoare annotation is: (let ((.cse0 (div ~var_1_5~0 256))) (or (and (<= .cse0 0) (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) (<= 0 ~var_1_5~0)) (= (+ (* (div ~var_1_9~0 256) 256) ~var_1_5~0) (+ ~var_1_9~0 (* .cse0 256))))) [2023-12-19 11:58:08,421 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 57) no Hoare annotation was computed. [2023-12-19 11:58:08,421 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-12-19 11:58:08,421 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-12-19 11:58:08,421 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-19 11:58:08,422 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-12-19 11:58:08,422 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse0 (div ~var_1_5~0 256))) (or (and (<= .cse0 0) (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) (<= 0 ~var_1_5~0)) (= (+ (* (div ~var_1_9~0 256) 256) ~var_1_5~0) (+ ~var_1_9~0 (* .cse0 256))))) [2023-12-19 11:58:08,422 INFO L899 garLoopResultBuilder]: For program point L64-1(line 64) no Hoare annotation was computed. [2023-12-19 11:58:08,422 INFO L895 garLoopResultBuilder]: At program point L81-2(lines 81 87) the Hoare annotation is: (let ((.cse0 (div ~var_1_5~0 256))) (or (and (<= .cse0 0) (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) (<= 0 ~var_1_5~0)) (= (+ (* (div ~var_1_9~0 256) 256) ~var_1_5~0) (+ ~var_1_9~0 (* .cse0 256))))) [2023-12-19 11:58:08,422 INFO L899 garLoopResultBuilder]: For program point L81-3(lines 81 87) no Hoare annotation was computed. [2023-12-19 11:58:08,422 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2023-12-19 11:58:08,422 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 58) no Hoare annotation was computed. [2023-12-19 11:58:08,422 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-19 11:58:08,422 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 53) no Hoare annotation was computed. [2023-12-19 11:58:08,422 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (let ((.cse0 (div ~var_1_5~0 256))) (or (and (<= .cse0 0) (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) (<= 0 ~var_1_5~0)) (= (+ (* (div ~var_1_9~0 256) 256) ~var_1_5~0) (+ ~var_1_9~0 (* .cse0 256))))) [2023-12-19 11:58:08,422 INFO L899 garLoopResultBuilder]: For program point L66-1(line 66) no Hoare annotation was computed. [2023-12-19 11:58:08,422 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-19 11:58:08,423 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-12-19 11:58:08,423 INFO L899 garLoopResultBuilder]: For program point L75-1(line 75) no Hoare annotation was computed. [2023-12-19 11:58:08,423 INFO L899 garLoopResultBuilder]: For program point L75-3(line 75) no Hoare annotation was computed. [2023-12-19 11:58:08,423 INFO L899 garLoopResultBuilder]: For program point L75-5(line 75) no Hoare annotation was computed. [2023-12-19 11:58:08,423 INFO L899 garLoopResultBuilder]: For program point L75-7(line 75) no Hoare annotation was computed. [2023-12-19 11:58:08,423 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2023-12-19 11:58:08,423 INFO L899 garLoopResultBuilder]: For program point L34-2(line 34) no Hoare annotation was computed. [2023-12-19 11:58:08,423 INFO L899 garLoopResultBuilder]: For program point L34-4(lines 34 38) no Hoare annotation was computed. [2023-12-19 11:58:08,423 INFO L899 garLoopResultBuilder]: For program point L34-6(lines 32 58) no Hoare annotation was computed. [2023-12-19 11:58:08,423 INFO L902 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: true [2023-12-19 11:58:08,423 INFO L902 garLoopResultBuilder]: At program point L68-1(line 68) the Hoare annotation is: true [2023-12-19 11:58:08,424 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-19 11:58:08,424 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-19 11:58:08,424 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-19 11:58:08,424 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-19 11:58:08,427 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-19 11:58:08,428 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 11:58:08,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 11:58:08 BoogieIcfgContainer [2023-12-19 11:58:08,438 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 11:58:08,438 INFO L158 Benchmark]: Toolchain (without parser) took 3184.26ms. Allocated memory is still 398.5MB. Free memory was 347.2MB in the beginning and 237.2MB in the end (delta: 110.0MB). Peak memory consumption was 111.6MB. Max. memory is 8.0GB. [2023-12-19 11:58:08,438 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 199.2MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 11:58:08,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.66ms. Allocated memory is still 398.5MB. Free memory was 347.2MB in the beginning and 334.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-19 11:58:08,439 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.12ms. Allocated memory is still 398.5MB. Free memory was 334.6MB in the beginning and 332.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 11:58:08,439 INFO L158 Benchmark]: Boogie Preprocessor took 43.26ms. Allocated memory is still 398.5MB. Free memory was 332.5MB in the beginning and 329.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 11:58:08,439 INFO L158 Benchmark]: RCFGBuilder took 379.95ms. Allocated memory is still 398.5MB. Free memory was 328.9MB in the beginning and 313.7MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-19 11:58:08,439 INFO L158 Benchmark]: TraceAbstraction took 2476.67ms. Allocated memory is still 398.5MB. Free memory was 313.2MB in the beginning and 237.2MB in the end (delta: 75.9MB). Peak memory consumption was 77.0MB. Max. memory is 8.0GB. [2023-12-19 11:58:08,441 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 199.2MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.66ms. Allocated memory is still 398.5MB. Free memory was 347.2MB in the beginning and 334.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.12ms. Allocated memory is still 398.5MB. Free memory was 334.6MB in the beginning and 332.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.26ms. Allocated memory is still 398.5MB. Free memory was 332.5MB in the beginning and 329.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 379.95ms. Allocated memory is still 398.5MB. Free memory was 328.9MB in the beginning and 313.7MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 2476.67ms. Allocated memory is still 398.5MB. Free memory was 313.2MB in the beginning and 237.2MB in the end (delta: 75.9MB). Peak memory consumption was 77.0MB. 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: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 628 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 394 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 218 IncrementalHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 234 mSDtfsCounter, 218 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=4, InterpolantAutomatonStates: 27, 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, 6 MinimizatonAttempts, 66 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 55 PreInvPairs, 69 NumberOfFragments, 178 HoareAnnotationTreeSize, 55 FormulaSimplifications, 734 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FormulaSimplificationsInter, 151 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 328 ConstructedInterpolants, 0 QuantifiedInterpolants, 730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 586/586 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: 81]: Loop Invariant Derived loop invariant: ((((((var_1_5 / 256) <= 0) && ((last_1_var_1_10 + 10) <= 0)) && ((var_1_10 + 10) <= 0)) && (0 <= var_1_5)) || ((((var_1_9 / 256) * 256) + var_1_5) == (var_1_9 + ((var_1_5 / 256) * 256)))) RESULT: Ultimate proved your program to be correct! [2023-12-19 11:58:08,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...