/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 03:44:56,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 03:44:57,063 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-16 03:44:57,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 03:44:57,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 03:44:57,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 03:44:57,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 03:44:57,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 03:44:57,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 03:44:57,110 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 03:44:57,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 03:44:57,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 03:44:57,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 03:44:57,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 03:44:57,113 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 03:44:57,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 03:44:57,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 03:44:57,113 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 03:44:57,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 03:44:57,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 03:44:57,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 03:44:57,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 03:44:57,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 03:44:57,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 03:44:57,115 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 03:44:57,116 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 03:44:57,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 03:44:57,116 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 03:44:57,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 03:44:57,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 03:44:57,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 03:44:57,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 03:44:57,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:44:57,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 03:44:57,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 03:44:57,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 03:44:57,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 03:44:57,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 03:44:57,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 03:44:57,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 03:44:57,119 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 03:44:57,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 03:44:57,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 03:44:57,120 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 -> false [2023-12-16 03:44:57,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 03:44:57,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 03:44:57,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 03:44:57,577 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 03:44:57,578 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 03:44:57,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i [2023-12-16 03:44:59,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 03:44:59,298 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 03:44:59,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i [2023-12-16 03:44:59,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dea072ac/8ba6c5c283944074bf9f3206e4a9a70a/FLAGcdb56eb29 [2023-12-16 03:44:59,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dea072ac/8ba6c5c283944074bf9f3206e4a9a70a [2023-12-16 03:44:59,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 03:44:59,323 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 03:44:59,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 03:44:59,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 03:44:59,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 03:44:59,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:44:59" (1/1) ... [2023-12-16 03:44:59,335 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a543fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:44:59, skipping insertion in model container [2023-12-16 03:44:59,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:44:59" (1/1) ... [2023-12-16 03:44:59,367 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 03:44:59,546 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-1loop_file-5.i[914,927] [2023-12-16 03:44:59,593 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:44:59,603 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 03:44:59,611 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-1loop_file-5.i[914,927] [2023-12-16 03:44:59,633 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:44:59,646 INFO L206 MainTranslator]: Completed translation [2023-12-16 03:44:59,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:44:59 WrapperNode [2023-12-16 03:44:59,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 03:44:59,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 03:44:59,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 03:44:59,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 03:44:59,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:44:59" (1/1) ... [2023-12-16 03:44:59,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:44:59" (1/1) ... [2023-12-16 03:44:59,694 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2023-12-16 03:44:59,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 03:44:59,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 03:44:59,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 03:44:59,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 03:44:59,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:44:59" (1/1) ... [2023-12-16 03:44:59,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:44:59" (1/1) ... [2023-12-16 03:44:59,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:44:59" (1/1) ... [2023-12-16 03:44:59,727 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-16 03:44:59,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:44:59" (1/1) ... [2023-12-16 03:44:59,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:44:59" (1/1) ... [2023-12-16 03:44:59,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:44:59" (1/1) ... [2023-12-16 03:44:59,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:44:59" (1/1) ... [2023-12-16 03:44:59,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:44:59" (1/1) ... [2023-12-16 03:44:59,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:44:59" (1/1) ... [2023-12-16 03:44:59,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 03:44:59,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 03:44:59,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 03:44:59,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 03:44:59,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:44:59" (1/1) ... [2023-12-16 03:44:59,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:44:59,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:44:59,782 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-16 03:44:59,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 03:44:59,810 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 03:44:59,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 03:44:59,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 03:44:59,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 03:44:59,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 03:44:59,800 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-16 03:44:59,902 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 03:44:59,904 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 03:45:00,216 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 03:45:00,252 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 03:45:00,252 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 03:45:00,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:45:00 BoogieIcfgContainer [2023-12-16 03:45:00,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 03:45:00,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 03:45:00,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 03:45:00,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 03:45:00,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:44:59" (1/3) ... [2023-12-16 03:45:00,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db1c113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:45:00, skipping insertion in model container [2023-12-16 03:45:00,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:44:59" (2/3) ... [2023-12-16 03:45:00,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db1c113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:45:00, skipping insertion in model container [2023-12-16 03:45:00,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:45:00" (3/3) ... [2023-12-16 03:45:00,260 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-5.i [2023-12-16 03:45:00,275 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 03:45:00,275 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 03:45:00,312 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 03:45:00,317 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;@1750feb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 03:45:00,318 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 03:45:00,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 03:45:00,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-16 03:45:00,340 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:45:00,341 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:45:00,341 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:45:00,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:45:00,346 INFO L85 PathProgramCache]: Analyzing trace with hash -730090614, now seen corresponding path program 1 times [2023-12-16 03:45:00,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:45:00,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628499610] [2023-12-16 03:45:00,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:45:00,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:45:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:00,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:45:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:00,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:45:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:00,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:45:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:00,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:45:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:00,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:45:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:00,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:45:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:00,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:45:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:00,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:45:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:00,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:45:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:00,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:45:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:00,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:45:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:00,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:45:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:00,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:45:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:00,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:45:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 03:45:00,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:45:00,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628499610] [2023-12-16 03:45:00,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628499610] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:45:00,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:45:00,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 03:45:00,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221075075] [2023-12-16 03:45:00,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:45:00,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 03:45:00,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:45:00,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 03:45:00,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:45:00,896 INFO L87 Difference]: Start difference. First operand has 43 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 03:45:00,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:45:00,955 INFO L93 Difference]: Finished difference Result 85 states and 143 transitions. [2023-12-16 03:45:00,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 03:45:00,958 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 89 [2023-12-16 03:45:00,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:45:00,965 INFO L225 Difference]: With dead ends: 85 [2023-12-16 03:45:00,966 INFO L226 Difference]: Without dead ends: 41 [2023-12-16 03:45:00,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-16 03:45:00,974 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:45:00,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:45:00,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-16 03:45:01,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-12-16 03:45:01,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 03:45:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2023-12-16 03:45:01,021 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 89 [2023-12-16 03:45:01,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:45:01,022 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2023-12-16 03:45:01,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 03:45:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2023-12-16 03:45:01,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-16 03:45:01,028 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:45:01,028 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:45:01,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 03:45:01,029 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:45:01,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:45:01,030 INFO L85 PathProgramCache]: Analyzing trace with hash -907529654, now seen corresponding path program 1 times [2023-12-16 03:45:01,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:45:01,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217742645] [2023-12-16 03:45:01,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:45:01,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:45:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:01,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:45:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:01,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:45:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:01,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:45:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:01,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:45:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:01,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:45:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:01,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:45:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:01,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:45:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:01,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:45:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:01,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:45:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:01,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:45:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:01,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:45:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:01,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:45:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:01,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:45:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:01,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:45:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:01,908 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 03:45:01,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:45:01,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217742645] [2023-12-16 03:45:01,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217742645] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:45:01,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:45:01,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 03:45:01,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033204465] [2023-12-16 03:45:01,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:45:01,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 03:45:01,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:45:01,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 03:45:01,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 03:45:01,917 INFO L87 Difference]: Start difference. First operand 41 states and 60 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:45:02,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:45:02,081 INFO L93 Difference]: Finished difference Result 110 states and 159 transitions. [2023-12-16 03:45:02,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 03:45:02,083 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2023-12-16 03:45:02,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:45:02,091 INFO L225 Difference]: With dead ends: 110 [2023-12-16 03:45:02,091 INFO L226 Difference]: Without dead ends: 70 [2023-12-16 03:45:02,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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-16 03:45:02,093 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 35 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:45:02,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 180 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:45:02,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-16 03:45:02,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2023-12-16 03:45:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 03:45:02,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 97 transitions. [2023-12-16 03:45:02,124 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 97 transitions. Word has length 89 [2023-12-16 03:45:02,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:45:02,124 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 97 transitions. [2023-12-16 03:45:02,124 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:45:02,125 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 97 transitions. [2023-12-16 03:45:02,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-16 03:45:02,131 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:45:02,131 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:45:02,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 03:45:02,132 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:45:02,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:45:02,132 INFO L85 PathProgramCache]: Analyzing trace with hash -907470072, now seen corresponding path program 1 times [2023-12-16 03:45:02,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:45:02,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432421145] [2023-12-16 03:45:02,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:45:02,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:45:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:45:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:45:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:45:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:45:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:45:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:45:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:45:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:45:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:45:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:45:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:45:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:45:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:45:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:45:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 03:45:10,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:45:10,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432421145] [2023-12-16 03:45:10,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432421145] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:45:10,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:45:10,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 03:45:10,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590786699] [2023-12-16 03:45:10,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:45:10,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 03:45:10,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:45:10,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 03:45:10,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-16 03:45:10,092 INFO L87 Difference]: Start difference. First operand 67 states and 97 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:45:10,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:45:10,856 INFO L93 Difference]: Finished difference Result 143 states and 202 transitions. [2023-12-16 03:45:10,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 03:45:10,870 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2023-12-16 03:45:10,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:45:10,877 INFO L225 Difference]: With dead ends: 143 [2023-12-16 03:45:10,877 INFO L226 Difference]: Without dead ends: 141 [2023-12-16 03:45:10,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2023-12-16 03:45:10,882 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 90 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 03:45:10,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 186 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 03:45:10,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-12-16 03:45:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2023-12-16 03:45:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 80 states have (on average 1.2) internal successors, (96), 82 states have internal predecessors, (96), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-16 03:45:10,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 192 transitions. [2023-12-16 03:45:10,923 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 192 transitions. Word has length 89 [2023-12-16 03:45:10,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:45:10,924 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 192 transitions. [2023-12-16 03:45:10,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:45:10,925 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 192 transitions. [2023-12-16 03:45:10,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-16 03:45:10,926 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:45:10,926 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:45:10,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 03:45:10,927 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:45:10,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:45:10,927 INFO L85 PathProgramCache]: Analyzing trace with hash -850211770, now seen corresponding path program 1 times [2023-12-16 03:45:10,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:45:10,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026769260] [2023-12-16 03:45:10,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:45:10,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:45:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:45:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:45:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:45:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:45:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:45:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:45:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:45:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:45:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:45:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:45:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:10,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:45:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:11,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:45:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:11,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:45:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:11,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:45:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:11,013 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 03:45:11,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:45:11,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026769260] [2023-12-16 03:45:11,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026769260] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:45:11,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:45:11,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 03:45:11,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88185948] [2023-12-16 03:45:11,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:45:11,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 03:45:11,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:45:11,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 03:45:11,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:45:11,017 INFO L87 Difference]: Start difference. First operand 133 states and 192 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:45:11,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:45:11,049 INFO L93 Difference]: Finished difference Result 261 states and 378 transitions. [2023-12-16 03:45:11,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 03:45:11,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2023-12-16 03:45:11,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:45:11,053 INFO L225 Difference]: With dead ends: 261 [2023-12-16 03:45:11,053 INFO L226 Difference]: Without dead ends: 129 [2023-12-16 03:45:11,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-16 03:45:11,063 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:45:11,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 103 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:45:11,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-16 03:45:11,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2023-12-16 03:45:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 76 states have (on average 1.144736842105263) internal successors, (87), 78 states have internal predecessors, (87), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-16 03:45:11,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 183 transitions. [2023-12-16 03:45:11,093 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 183 transitions. Word has length 89 [2023-12-16 03:45:11,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:45:11,094 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 183 transitions. [2023-12-16 03:45:11,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:45:11,095 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 183 transitions. [2023-12-16 03:45:11,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-16 03:45:11,097 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:45:11,097 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:45:11,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 03:45:11,097 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:45:11,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:45:11,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1716876280, now seen corresponding path program 1 times [2023-12-16 03:45:11,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:45:11,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287721465] [2023-12-16 03:45:11,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:45:11,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:45:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:11,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:45:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:11,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:45:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:11,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:45:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:11,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:45:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:11,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:45:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:11,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:45:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:11,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:45:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:11,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:45:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:11,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:45:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:11,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:45:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:11,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:45:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:11,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:45:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:11,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:45:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:11,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:45:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:11,200 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 03:45:11,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:45:11,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287721465] [2023-12-16 03:45:11,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287721465] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:45:11,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:45:11,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 03:45:11,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133305126] [2023-12-16 03:45:11,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:45:11,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 03:45:11,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:45:11,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 03:45:11,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:45:11,204 INFO L87 Difference]: Start difference. First operand 129 states and 183 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:45:11,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:45:11,240 INFO L93 Difference]: Finished difference Result 228 states and 322 transitions. [2023-12-16 03:45:11,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 03:45:11,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2023-12-16 03:45:11,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:45:11,242 INFO L225 Difference]: With dead ends: 228 [2023-12-16 03:45:11,242 INFO L226 Difference]: Without dead ends: 100 [2023-12-16 03:45:11,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-16 03:45:11,244 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 5 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:45:11,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 98 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:45:11,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-16 03:45:11,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-12-16 03:45:11,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 57 states have (on average 1.087719298245614) internal successors, (62), 58 states have internal predecessors, (62), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-16 03:45:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2023-12-16 03:45:11,270 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 89 [2023-12-16 03:45:11,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:45:11,270 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2023-12-16 03:45:11,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:45:11,271 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2023-12-16 03:45:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-16 03:45:11,271 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:45:11,271 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:45:11,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 03:45:11,272 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:45:11,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:45:11,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2029122244, now seen corresponding path program 1 times [2023-12-16 03:45:11,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:45:11,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785498026] [2023-12-16 03:45:11,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:45:11,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:45:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:13,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:45:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:13,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:45:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:13,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:45:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:13,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:45:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:13,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:45:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:13,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:45:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:13,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:45:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:13,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:45:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:13,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:45:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:13,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:45:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:13,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:45:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:13,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:45:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:13,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:45:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:13,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:45:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:13,395 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 03:45:13,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:45:13,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785498026] [2023-12-16 03:45:13,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785498026] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:45:13,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:45:13,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 03:45:13,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660029676] [2023-12-16 03:45:13,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:45:13,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 03:45:13,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:45:13,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 03:45:13,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-16 03:45:13,397 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:45:13,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:45:13,598 INFO L93 Difference]: Finished difference Result 119 states and 157 transitions. [2023-12-16 03:45:13,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 03:45:13,599 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 90 [2023-12-16 03:45:13,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:45:13,600 INFO L225 Difference]: With dead ends: 119 [2023-12-16 03:45:13,600 INFO L226 Difference]: Without dead ends: 117 [2023-12-16 03:45:13,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2023-12-16 03:45:13,601 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 33 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:45:13,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 221 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:45:13,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-16 03:45:13,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2023-12-16 03:45:13,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 66 states have internal predecessors, (70), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-16 03:45:13,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2023-12-16 03:45:13,623 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 146 transitions. Word has length 90 [2023-12-16 03:45:13,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:45:13,623 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 146 transitions. [2023-12-16 03:45:13,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:45:13,623 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 146 transitions. [2023-12-16 03:45:13,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-16 03:45:13,624 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:45:13,624 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:45:13,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 03:45:13,625 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:45:13,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:45:13,625 INFO L85 PathProgramCache]: Analyzing trace with hash 645160051, now seen corresponding path program 1 times [2023-12-16 03:45:13,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:45:13,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287175904] [2023-12-16 03:45:13,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:45:13,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:45:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:14,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:45:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:14,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:45:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:14,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:45:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:14,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:45:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:14,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:45:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:14,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:45:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:14,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:45:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:14,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:45:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:14,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:45:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:14,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:45:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:14,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:45:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:14,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:45:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:14,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:45:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:14,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:45:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 03:45:14,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:45:14,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287175904] [2023-12-16 03:45:14,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287175904] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:45:14,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:45:14,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 03:45:14,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672705886] [2023-12-16 03:45:14,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:45:14,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 03:45:14,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:45:14,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 03:45:14,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-16 03:45:14,463 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:45:14,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:45:14,685 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2023-12-16 03:45:14,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 03:45:14,686 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2023-12-16 03:45:14,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:45:14,688 INFO L225 Difference]: With dead ends: 132 [2023-12-16 03:45:14,688 INFO L226 Difference]: Without dead ends: 130 [2023-12-16 03:45:14,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2023-12-16 03:45:14,689 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 43 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:45:14,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 243 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:45:14,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-12-16 03:45:14,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 108. [2023-12-16 03:45:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 66 states have internal predecessors, (70), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-16 03:45:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2023-12-16 03:45:14,712 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 146 transitions. Word has length 91 [2023-12-16 03:45:14,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:45:14,712 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 146 transitions. [2023-12-16 03:45:14,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:45:14,712 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 146 transitions. [2023-12-16 03:45:14,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-16 03:45:14,713 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:45:14,713 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:45:14,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 03:45:14,714 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:45:14,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:45:14,714 INFO L85 PathProgramCache]: Analyzing trace with hash 252133041, now seen corresponding path program 1 times [2023-12-16 03:45:14,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:45:14,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596670168] [2023-12-16 03:45:14,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:45:14,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:45:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:17,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:45:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:17,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:45:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:17,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:45:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:17,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:45:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:17,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:45:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:17,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:45:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:17,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:45:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:17,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:45:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:17,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:45:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:17,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:45:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:17,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:45:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:17,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:45:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:17,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:45:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:17,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:45:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:17,590 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 03:45:17,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:45:17,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596670168] [2023-12-16 03:45:17,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596670168] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:45:17,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:45:17,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 03:45:17,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072037411] [2023-12-16 03:45:17,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:45:17,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 03:45:17,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:45:17,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 03:45:17,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 03:45:17,592 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:45:18,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:45:18,042 INFO L93 Difference]: Finished difference Result 130 states and 172 transitions. [2023-12-16 03:45:18,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 03:45:18,043 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2023-12-16 03:45:18,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:45:18,043 INFO L225 Difference]: With dead ends: 130 [2023-12-16 03:45:18,043 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 03:45:18,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2023-12-16 03:45:18,046 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 33 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 03:45:18,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 243 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 03:45:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 03:45:18,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 03:45:18,047 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-16 03:45:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 03:45:18,047 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2023-12-16 03:45:18,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:45:18,047 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 03:45:18,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 03:45:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 03:45:18,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 03:45:18,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 03:45:18,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 03:45:18,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 03:45:18,564 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse0 (* (div ~var_1_8~0 256) 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (= ~var_1_8~0 10)))) [2023-12-16 03:45:18,565 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (let ((.cse0 (* (div ~var_1_8~0 256) 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (= ~var_1_8~0 10)))) [2023-12-16 03:45:18,565 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-16 03:45:18,565 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-16 03:45:18,565 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-16 03:45:18,565 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-12-16 03:45:18,565 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse0 (* (div ~var_1_8~0 256) 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (= ~var_1_8~0 10)))) [2023-12-16 03:45:18,566 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (let ((.cse0 (* (div ~var_1_8~0 256) 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (= ~var_1_8~0 10)))) [2023-12-16 03:45:18,566 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 44) no Hoare annotation was computed. [2023-12-16 03:45:18,566 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 61) no Hoare annotation was computed. [2023-12-16 03:45:18,566 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-12-16 03:45:18,566 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-16 03:45:18,566 INFO L902 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: true [2023-12-16 03:45:18,566 INFO L902 garLoopResultBuilder]: At program point L82-1(line 82) the Hoare annotation is: true [2023-12-16 03:45:18,566 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-16 03:45:18,567 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (let ((.cse0 (* (div ~var_1_8~0 256) 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (= ~var_1_8~0 10)))) [2023-12-16 03:45:18,567 INFO L895 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: (let ((.cse0 (* (div ~var_1_8~0 256) 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (= ~var_1_8~0 10)))) [2023-12-16 03:45:18,567 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 03:45:18,567 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2023-12-16 03:45:18,567 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 56) no Hoare annotation was computed. [2023-12-16 03:45:18,567 INFO L899 garLoopResultBuilder]: For program point L54-2(lines 54 56) no Hoare annotation was computed. [2023-12-16 03:45:18,567 INFO L899 garLoopResultBuilder]: For program point L83(lines 62 84) no Hoare annotation was computed. [2023-12-16 03:45:18,567 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 52) no Hoare annotation was computed. [2023-12-16 03:45:18,568 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 52) no Hoare annotation was computed. [2023-12-16 03:45:18,568 INFO L902 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: true [2023-12-16 03:45:18,568 INFO L902 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: true [2023-12-16 03:45:18,568 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 03:45:18,568 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-12-16 03:45:18,568 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 48) no Hoare annotation was computed. [2023-12-16 03:45:18,568 INFO L899 garLoopResultBuilder]: For program point L38-1(lines 38 48) no Hoare annotation was computed. [2023-12-16 03:45:18,568 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (* (div ~var_1_8~0 256) 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (= ~var_1_8~0 10)))) [2023-12-16 03:45:18,569 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (* (div ~var_1_8~0 256) 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (= ~var_1_8~0 10)))) [2023-12-16 03:45:18,569 INFO L895 garLoopResultBuilder]: At program point L96-3(lines 96 102) the Hoare annotation is: (let ((.cse4 (* 256 (div ~var_1_12~0 256)))) (let ((.cse5 (= (* (div ~var_1_9~0 256) 256) ~var_1_9~0)) (.cse0 (let ((.cse6 (* (div ~var_1_8~0 256) 256))) (let ((.cse7 (+ .cse6 ~var_1_12~0))) (or (and (= (+ .cse6 ~var_1_15~0) ~var_1_8~0) (<= .cse7 (+ .cse4 ~var_1_8~0))) (and (<= (+ .cse4 ~var_1_8~0 1) .cse7) (= (+ .cse4 ~var_1_15~0) ~var_1_12~0))))))) (or (and (= ~var_1_1~0 0) .cse0) (and (= ~var_1_8~0 10) (or (let ((.cse2 (+ (* 256 (div ~last_1_var_1_8~0 256)) ~var_1_7~0 ~var_1_10~0)) (.cse1 (= (+ (* (div ~var_1_13~0 256) 256) 10) ~var_1_13~0))) (and (or .cse1 (< (+ ~var_1_4~0 ~last_1_var_1_8~0) .cse2)) (or (< .cse2 (+ ~var_1_4~0 ~last_1_var_1_8~0 1)) (let ((.cse3 (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0))) (and (or .cse1 (not .cse3)) (or .cse3 (= (+ .cse4 10) ~var_1_12~0))))))) .cse5)) (and (not .cse5) .cse0)))) [2023-12-16 03:45:18,569 INFO L899 garLoopResultBuilder]: For program point L96-4(lines 96 102) no Hoare annotation was computed. [2023-12-16 03:45:18,569 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-12-16 03:45:18,569 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse0 (* (div ~var_1_8~0 256) 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (= ~var_1_8~0 10)))) [2023-12-16 03:45:18,569 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (let ((.cse0 (* (div ~var_1_8~0 256) 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (= ~var_1_8~0 10)))) [2023-12-16 03:45:18,570 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 47) no Hoare annotation was computed. [2023-12-16 03:45:18,570 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-12-16 03:45:18,570 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-16 03:45:18,570 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-16 03:45:18,570 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-16 03:45:18,570 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-16 03:45:18,573 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:45:18,574 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 03:45:18,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:45:18 BoogieIcfgContainer [2023-12-16 03:45:18,611 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 03:45:18,611 INFO L158 Benchmark]: Toolchain (without parser) took 19287.99ms. Allocated memory was 248.5MB in the beginning and 570.4MB in the end (delta: 321.9MB). Free memory was 192.2MB in the beginning and 194.8MB in the end (delta: -2.6MB). Peak memory consumption was 319.9MB. Max. memory is 8.0GB. [2023-12-16 03:45:18,611 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 200.3MB. Free memory was 145.3MB in the beginning and 145.2MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:45:18,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.89ms. Allocated memory is still 248.5MB. Free memory was 192.2MB in the beginning and 179.1MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 03:45:18,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.01ms. Allocated memory is still 248.5MB. Free memory was 179.1MB in the beginning and 176.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 03:45:18,612 INFO L158 Benchmark]: Boogie Preprocessor took 46.45ms. Allocated memory is still 248.5MB. Free memory was 176.5MB in the beginning and 171.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 03:45:18,612 INFO L158 Benchmark]: RCFGBuilder took 509.95ms. Allocated memory is still 248.5MB. Free memory was 171.8MB in the beginning and 152.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-16 03:45:18,613 INFO L158 Benchmark]: TraceAbstraction took 18356.26ms. Allocated memory was 248.5MB in the beginning and 570.4MB in the end (delta: 321.9MB). Free memory was 152.4MB in the beginning and 194.8MB in the end (delta: -42.4MB). Peak memory consumption was 280.0MB. Max. memory is 8.0GB. [2023-12-16 03:45:18,617 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.14ms. Allocated memory is still 200.3MB. Free memory was 145.3MB in the beginning and 145.2MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 318.89ms. Allocated memory is still 248.5MB. Free memory was 192.2MB in the beginning and 179.1MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.01ms. Allocated memory is still 248.5MB. Free memory was 179.1MB in the beginning and 176.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.45ms. Allocated memory is still 248.5MB. Free memory was 176.5MB in the beginning and 171.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 509.95ms. Allocated memory is still 248.5MB. Free memory was 171.8MB in the beginning and 152.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 18356.26ms. Allocated memory was 248.5MB in the beginning and 570.4MB in the end (delta: 321.9MB). Free memory was 152.4MB in the beginning and 194.8MB in the end (delta: -42.4MB). Peak memory consumption was 280.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, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.3s, OverallIterations: 8, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 243 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 1331 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 852 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 708 IncrementalHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 479 mSDtfsCounter, 708 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=3, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 42 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 181 PreInvPairs, 228 NumberOfFragments, 758 HoareAnnotationTreeSize, 181 FormulaSimplifications, 1954 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FormulaSimplificationsInter, 1576 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 717 NumberOfCodeBlocks, 717 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 709 ConstructedInterpolants, 0 QuantifiedInterpolants, 3756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 2912/2912 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: 96]: Loop Invariant Derived loop invariant: ((((var_1_1 == 0) && ((((((var_1_8 / 256) * 256) + var_1_15) == var_1_8) && ((((var_1_8 / 256) * 256) + var_1_12) <= ((256 * (var_1_12 / 256)) + var_1_8))) || (((((256 * (var_1_12 / 256)) + var_1_8) + 1) <= (((var_1_8 / 256) * 256) + var_1_12)) && (((256 * (var_1_12 / 256)) + var_1_15) == var_1_12)))) || ((var_1_8 == 10) && (((((((var_1_13 / 256) * 256) + 10) == var_1_13) || ((var_1_4 + last_1_var_1_8) < (((256 * (last_1_var_1_8 / 256)) + var_1_7) + var_1_10))) && (((((256 * (last_1_var_1_8 / 256)) + var_1_7) + var_1_10) < ((var_1_4 + last_1_var_1_8) + 1)) || ((((((var_1_13 / 256) * 256) + 10) == var_1_13) || !((((var_1_11 / 256) * 256) == var_1_11))) && ((((var_1_11 / 256) * 256) == var_1_11) || (((256 * (var_1_12 / 256)) + 10) == var_1_12))))) || (((var_1_9 / 256) * 256) == var_1_9)))) || (!((((var_1_9 / 256) * 256) == var_1_9)) && ((((((var_1_8 / 256) * 256) + var_1_15) == var_1_8) && ((((var_1_8 / 256) * 256) + var_1_12) <= ((256 * (var_1_12 / 256)) + var_1_8))) || (((((256 * (var_1_12 / 256)) + var_1_8) + 1) <= (((var_1_8 / 256) * 256) + var_1_12)) && (((256 * (var_1_12 / 256)) + var_1_15) == var_1_12))))) RESULT: Ultimate proved your program to be correct! [2023-12-16 03:45:18,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...