/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_operatoramount_amount25_file-82.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:05:43,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:05:43,300 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 04:05:43,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:05:43,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:05:43,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:05:43,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:05:43,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:05:43,326 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:05:43,329 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:05:43,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:05:43,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:05:43,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:05:43,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:05:43,331 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:05:43,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:05:43,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:05:43,332 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:05:43,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:05:43,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:05:43,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:05:43,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:05:43,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:05:43,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:05:43,334 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:05:43,334 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:05:43,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:05:43,334 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:05:43,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:05:43,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:05:43,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:05:43,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:05:43,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:05:43,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:05:43,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:05:43,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:05:43,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:05:43,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:05:43,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:05:43,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:05:43,337 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:05:43,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:05:43,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:05:43,337 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 04:05:43,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:05:43,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:05:43,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:05:43,573 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:05:43,573 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:05:43,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-82.i [2023-12-16 04:05:44,646 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:05:44,811 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:05:44,812 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-82.i [2023-12-16 04:05:44,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40eee7bfc/db69fd9a7b864ea19d7e7315699214a5/FLAG85fecfa21 [2023-12-16 04:05:44,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40eee7bfc/db69fd9a7b864ea19d7e7315699214a5 [2023-12-16 04:05:44,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:05:44,829 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:05:44,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:05:44,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:05:44,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:05:44,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:05:44" (1/1) ... [2023-12-16 04:05:44,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e46257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:05:44, skipping insertion in model container [2023-12-16 04:05:44,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:05:44" (1/1) ... [2023-12-16 04:05:44,860 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:05:44,947 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_operatoramount_amount25_file-82.i[915,928] [2023-12-16 04:05:44,968 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:05:44,982 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:05:44,990 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_operatoramount_amount25_file-82.i[915,928] [2023-12-16 04:05:45,007 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:05:45,018 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:05:45,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:05:45 WrapperNode [2023-12-16 04:05:45,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:05:45,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:05:45,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:05:45,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:05:45,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:05:45" (1/1) ... [2023-12-16 04:05:45,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:05:45" (1/1) ... [2023-12-16 04:05:45,048 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2023-12-16 04:05:45,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:05:45,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:05:45,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:05:45,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:05:45,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:05:45" (1/1) ... [2023-12-16 04:05:45,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:05:45" (1/1) ... [2023-12-16 04:05:45,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:05:45" (1/1) ... [2023-12-16 04:05:45,071 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 04:05:45,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:05:45" (1/1) ... [2023-12-16 04:05:45,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:05:45" (1/1) ... [2023-12-16 04:05:45,083 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:05:45" (1/1) ... [2023-12-16 04:05:45,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:05:45" (1/1) ... [2023-12-16 04:05:45,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:05:45" (1/1) ... [2023-12-16 04:05:45,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:05:45" (1/1) ... [2023-12-16 04:05:45,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:05:45,103 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:05:45,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:05:45,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:05:45,104 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:05:45" (1/1) ... [2023-12-16 04:05:45,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:05:45,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:05:45,140 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 04:05:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:05:45,165 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:05:45,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:05:45,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:05:45,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:05:45,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:05:45,160 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 04:05:45,219 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:05:45,222 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:05:45,403 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:05:45,430 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:05:45,430 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:05:45,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:05:45 BoogieIcfgContainer [2023-12-16 04:05:45,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:05:45,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:05:45,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:05:45,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:05:45,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:05:44" (1/3) ... [2023-12-16 04:05:45,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79885411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:05:45, skipping insertion in model container [2023-12-16 04:05:45,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:05:45" (2/3) ... [2023-12-16 04:05:45,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79885411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:05:45, skipping insertion in model container [2023-12-16 04:05:45,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:05:45" (3/3) ... [2023-12-16 04:05:45,452 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-82.i [2023-12-16 04:05:45,467 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:05:45,467 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:05:45,512 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:05:45,517 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;@7936482d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:05:45,517 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:05:45,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 04:05:45,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-16 04:05:45,527 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:05:45,527 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:05:45,527 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:05:45,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:05:45,569 INFO L85 PathProgramCache]: Analyzing trace with hash 837678317, now seen corresponding path program 1 times [2023-12-16 04:05:45,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:05:45,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808852503] [2023-12-16 04:05:45,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:05:45,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:05:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:46,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:05:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:46,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:05:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:46,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:05:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:46,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 04:05:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:46,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 04:05:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:46,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 04:05:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:46,546 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 04:05:46,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:05:46,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808852503] [2023-12-16 04:05:46,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808852503] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:05:46,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:05:46,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:05:46,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972102704] [2023-12-16 04:05:46,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:05:46,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:05:46,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:05:46,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:05:46,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:05:46,583 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 04:05:46,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:05:46,788 INFO L93 Difference]: Finished difference Result 103 states and 169 transitions. [2023-12-16 04:05:46,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:05:46,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2023-12-16 04:05:46,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:05:46,796 INFO L225 Difference]: With dead ends: 103 [2023-12-16 04:05:46,796 INFO L226 Difference]: Without dead ends: 72 [2023-12-16 04:05:46,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:05:46,804 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 59 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:05:46,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 169 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:05:46,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-16 04:05:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 56. [2023-12-16 04:05:46,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 04:05:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2023-12-16 04:05:46,843 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 45 [2023-12-16 04:05:46,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:05:46,844 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2023-12-16 04:05:46,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 04:05:46,844 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2023-12-16 04:05:46,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-16 04:05:46,845 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:05:46,845 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:05:46,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:05:46,846 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:05:46,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:05:46,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1517736687, now seen corresponding path program 1 times [2023-12-16 04:05:46,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:05:46,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102528723] [2023-12-16 04:05:46,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:05:46,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:05:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:47,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:05:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:47,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:05:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:47,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:05:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:47,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 04:05:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:47,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 04:05:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:47,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 04:05:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:47,162 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 04:05:47,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:05:47,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102528723] [2023-12-16 04:05:47,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102528723] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:05:47,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:05:47,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:05:47,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699509873] [2023-12-16 04:05:47,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:05:47,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:05:47,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:05:47,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:05:47,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:05:47,165 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 04:05:47,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:05:47,327 INFO L93 Difference]: Finished difference Result 142 states and 193 transitions. [2023-12-16 04:05:47,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:05:47,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2023-12-16 04:05:47,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:05:47,333 INFO L225 Difference]: With dead ends: 142 [2023-12-16 04:05:47,333 INFO L226 Difference]: Without dead ends: 87 [2023-12-16 04:05:47,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:05:47,334 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 58 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:05:47,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 206 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:05:47,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-16 04:05:47,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 45. [2023-12-16 04:05:47,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 04:05:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2023-12-16 04:05:47,357 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 45 [2023-12-16 04:05:47,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:05:47,357 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2023-12-16 04:05:47,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 04:05:47,358 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2023-12-16 04:05:47,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-16 04:05:47,359 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:05:47,360 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:05:47,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:05:47,360 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:05:47,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:05:47,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1197865237, now seen corresponding path program 1 times [2023-12-16 04:05:47,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:05:47,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103041349] [2023-12-16 04:05:47,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:05:47,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:05:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:47,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:05:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:47,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:05:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:47,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:05:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:47,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 04:05:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:47,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 04:05:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:47,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 04:05:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 04:05:47,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:05:47,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103041349] [2023-12-16 04:05:47,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103041349] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:05:47,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:05:47,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:05:47,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598535265] [2023-12-16 04:05:47,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:05:47,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:05:47,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:05:47,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:05:47,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:05:47,553 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 04:05:47,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:05:47,619 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2023-12-16 04:05:47,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:05:47,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2023-12-16 04:05:47,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:05:47,621 INFO L225 Difference]: With dead ends: 111 [2023-12-16 04:05:47,621 INFO L226 Difference]: Without dead ends: 74 [2023-12-16 04:05:47,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:05:47,624 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 31 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:05:47,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 82 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:05:47,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-16 04:05:47,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2023-12-16 04:05:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.196078431372549) internal successors, (61), 53 states have internal predecessors, (61), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:05:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2023-12-16 04:05:47,642 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 46 [2023-12-16 04:05:47,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:05:47,643 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2023-12-16 04:05:47,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 04:05:47,644 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2023-12-16 04:05:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-16 04:05:47,645 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:05:47,646 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:05:47,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:05:47,646 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:05:47,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:05:47,646 INFO L85 PathProgramCache]: Analyzing trace with hash 804838227, now seen corresponding path program 1 times [2023-12-16 04:05:47,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:05:47,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104760994] [2023-12-16 04:05:47,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:05:47,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:05:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:47,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:05:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:47,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:05:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:47,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:05:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:47,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 04:05:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:47,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 04:05:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:47,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 04:05:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:05:47,765 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 04:05:47,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:05:47,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104760994] [2023-12-16 04:05:47,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104760994] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:05:47,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:05:47,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:05:47,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560788583] [2023-12-16 04:05:47,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:05:47,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:05:47,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:05:47,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:05:47,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:05:47,768 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 04:05:47,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:05:47,795 INFO L93 Difference]: Finished difference Result 128 states and 163 transitions. [2023-12-16 04:05:47,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:05:47,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2023-12-16 04:05:47,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:05:47,796 INFO L225 Difference]: With dead ends: 128 [2023-12-16 04:05:47,796 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 04:05:47,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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 04:05:47,803 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:05:47,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:05:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 04:05:47,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 04:05:47,806 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 04:05:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 04:05:47,806 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2023-12-16 04:05:47,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:05:47,806 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 04:05:47,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 04:05:47,806 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 04:05:47,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 04:05:47,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:05:47,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:05:47,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 04:05:48,081 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse1 (div ~var_1_5~0 256))) (or (let ((.cse0 (div ~var_1_9~0 256))) (and (<= .cse0 .cse1) (= (+ (* .cse0 256) ~var_1_5~0) (+ ~var_1_9~0 (* .cse1 256))))) (and (<= .cse1 0) (<= 0 ~var_1_5~0)))) [2023-12-16 04:05:48,082 INFO L899 garLoopResultBuilder]: For program point L64-1(line 64) no Hoare annotation was computed. [2023-12-16 04:05:48,082 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-16 04:05:48,082 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-16 04:05:48,082 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-16 04:05:48,082 INFO L895 garLoopResultBuilder]: At program point L81-2(lines 81 87) the Hoare annotation is: (let ((.cse1 (div ~var_1_5~0 256))) (or (let ((.cse0 (div ~var_1_9~0 256))) (and (<= .cse0 .cse1) (= (+ (* .cse0 256) ~var_1_5~0) (+ ~var_1_9~0 (* .cse1 256))))) (and (<= .cse1 0) (<= 0 ~var_1_5~0)))) [2023-12-16 04:05:48,082 INFO L899 garLoopResultBuilder]: For program point L81-3(lines 81 87) no Hoare annotation was computed. [2023-12-16 04:05:48,082 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2023-12-16 04:05:48,082 INFO L899 garLoopResultBuilder]: For program point L69(lines 59 70) no Hoare annotation was computed. [2023-12-16 04:05:48,082 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 58) no Hoare annotation was computed. [2023-12-16 04:05:48,082 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (let ((.cse1 (div ~var_1_5~0 256))) (or (let ((.cse0 (div ~var_1_9~0 256))) (and (<= .cse0 .cse1) (= (+ (* .cse0 256) ~var_1_5~0) (+ ~var_1_9~0 (* .cse1 256))))) (and (<= .cse1 0) (<= 0 ~var_1_5~0)))) [2023-12-16 04:05:48,083 INFO L895 garLoopResultBuilder]: At program point L61-1(line 61) the Hoare annotation is: (let ((.cse1 (div ~var_1_5~0 256))) (or (let ((.cse0 (div ~var_1_9~0 256))) (and (<= .cse0 .cse1) (= (+ (* .cse0 256) ~var_1_5~0) (+ ~var_1_9~0 (* .cse1 256))))) (and (<= .cse1 0) (<= 0 ~var_1_5~0)))) [2023-12-16 04:05:48,083 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-16 04:05:48,083 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 53) no Hoare annotation was computed. [2023-12-16 04:05:48,083 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 57) no Hoare annotation was computed. [2023-12-16 04:05:48,083 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (let ((.cse1 (div ~var_1_5~0 256))) (or (let ((.cse0 (div ~var_1_9~0 256))) (and (<= .cse0 .cse1) (= (+ (* .cse0 256) ~var_1_5~0) (+ ~var_1_9~0 (* .cse1 256))))) (and (<= .cse1 0) (<= 0 ~var_1_5~0)))) [2023-12-16 04:05:48,083 INFO L899 garLoopResultBuilder]: For program point L66-1(line 66) no Hoare annotation was computed. [2023-12-16 04:05:48,083 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 04:05:48,083 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-12-16 04:05:48,083 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-12-16 04:05:48,083 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-12-16 04:05:48,083 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 04:05:48,083 INFO L899 garLoopResultBuilder]: For program point L75-2(line 75) no Hoare annotation was computed. [2023-12-16 04:05:48,083 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 38) no Hoare annotation was computed. [2023-12-16 04:05:48,084 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 32 58) no Hoare annotation was computed. [2023-12-16 04:05:48,084 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-12-16 04:05:48,084 INFO L902 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: true [2023-12-16 04:05:48,084 INFO L902 garLoopResultBuilder]: At program point L68-1(line 68) the Hoare annotation is: true [2023-12-16 04:05:48,084 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-16 04:05:48,084 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-16 04:05:48,084 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-16 04:05:48,084 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-16 04:05:48,086 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-16 04:05:48,088 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:05:48,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:05:48 BoogieIcfgContainer [2023-12-16 04:05:48,095 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:05:48,096 INFO L158 Benchmark]: Toolchain (without parser) took 3267.24ms. Allocated memory is still 270.5MB. Free memory was 219.3MB in the beginning and 218.8MB in the end (delta: 522.8kB). Peak memory consumption was 138.0MB. Max. memory is 8.0GB. [2023-12-16 04:05:48,096 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 212.9MB. Free memory is still 163.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:05:48,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.90ms. Allocated memory is still 270.5MB. Free memory was 219.0MB in the beginning and 207.0MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 04:05:48,096 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.51ms. Allocated memory is still 270.5MB. Free memory was 207.0MB in the beginning and 204.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 04:05:48,096 INFO L158 Benchmark]: Boogie Preprocessor took 53.25ms. Allocated memory is still 270.5MB. Free memory was 204.6MB in the beginning and 201.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 04:05:48,096 INFO L158 Benchmark]: RCFGBuilder took 327.57ms. Allocated memory is still 270.5MB. Free memory was 201.5MB in the beginning and 186.4MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 04:05:48,097 INFO L158 Benchmark]: TraceAbstraction took 2663.43ms. Allocated memory is still 270.5MB. Free memory was 185.7MB in the beginning and 218.8MB in the end (delta: -33.0MB). Peak memory consumption was 104.4MB. Max. memory is 8.0GB. [2023-12-16 04:05:48,097 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.46ms. Allocated memory is still 212.9MB. Free memory is still 163.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 188.90ms. Allocated memory is still 270.5MB. Free memory was 219.0MB in the beginning and 207.0MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.51ms. Allocated memory is still 270.5MB. Free memory was 207.0MB in the beginning and 204.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.25ms. Allocated memory is still 270.5MB. Free memory was 204.6MB in the beginning and 201.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 327.57ms. Allocated memory is still 270.5MB. Free memory was 201.5MB in the beginning and 186.4MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 2663.43ms. Allocated memory is still 270.5MB. Free memory was 185.7MB in the beginning and 218.8MB in the end (delta: -33.0MB). Peak memory consumption was 104.4MB. 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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 149 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 511 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 334 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 233 IncrementalHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 177 mSDtfsCounter, 233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=3, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 60 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 57 PreInvPairs, 76 NumberOfFragments, 168 HoareAnnotationTreeSize, 57 FormulaSimplifications, 45 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FormulaSimplificationsInter, 1413 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 516 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 240/240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: ((((var_1_9 / 256) <= (var_1_5 / 256)) && ((((var_1_9 / 256) * 256) + var_1_5) == (var_1_9 + ((var_1_5 / 256) * 256)))) || (((var_1_5 / 256) <= 0) && (0 <= var_1_5))) RESULT: Ultimate proved your program to be correct! [2023-12-16 04:05:48,111 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...