/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-80.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 12:36:58,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 12:36:58,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 12:36:58,426 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 12:36:58,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 12:36:58,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 12:36:58,449 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 12:36:58,449 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 12:36:58,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 12:36:58,452 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 12:36:58,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 12:36:58,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 12:36:58,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 12:36:58,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 12:36:58,454 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 12:36:58,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 12:36:58,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 12:36:58,454 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 12:36:58,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 12:36:58,455 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 12:36:58,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 12:36:58,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 12:36:58,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 12:36:58,455 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 12:36:58,455 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 12:36:58,456 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 12:36:58,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 12:36:58,456 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 12:36:58,456 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 12:36:58,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 12:36:58,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 12:36:58,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 12:36:58,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 12:36:58,458 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 12:36:58,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 12:36:58,458 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 12:36:58,458 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 12:36:58,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 12:36:58,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 12:36:58,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 12:36:58,458 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 12:36:58,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 12:36:58,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 12:36:58,459 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 12:36:58,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 12:36:58,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 12:36:58,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 12:36:58,679 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 12:36:58,680 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 12:36:58,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-80.i [2023-12-19 12:36:59,849 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 12:36:59,999 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 12:37:00,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-80.i [2023-12-19 12:37:00,005 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b156563b7/2c9221b6dfb34d3bb45904e9034f2900/FLAGcf2ccf3fc [2023-12-19 12:37:00,019 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b156563b7/2c9221b6dfb34d3bb45904e9034f2900 [2023-12-19 12:37:00,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 12:37:00,022 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 12:37:00,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 12:37:00,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 12:37:00,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 12:37:00,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 12:37:00" (1/1) ... [2023-12-19 12:37:00,029 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f30a19b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:37:00, skipping insertion in model container [2023-12-19 12:37:00,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 12:37:00" (1/1) ... [2023-12-19 12:37:00,047 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 12:37:00,168 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_amount10_file-80.i[915,928] [2023-12-19 12:37:00,201 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 12:37:00,212 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 12:37:00,224 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_amount10_file-80.i[915,928] [2023-12-19 12:37:00,246 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 12:37:00,258 INFO L206 MainTranslator]: Completed translation [2023-12-19 12:37:00,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:37:00 WrapperNode [2023-12-19 12:37:00,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 12:37:00,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 12:37:00,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 12:37:00,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 12:37:00,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:37:00" (1/1) ... [2023-12-19 12:37:00,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:37:00" (1/1) ... [2023-12-19 12:37:00,300 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 77 [2023-12-19 12:37:00,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 12:37:00,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 12:37:00,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 12:37:00,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 12:37:00,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:37:00" (1/1) ... [2023-12-19 12:37:00,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:37:00" (1/1) ... [2023-12-19 12:37:00,315 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:37:00" (1/1) ... [2023-12-19 12:37:00,330 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-19 12:37:00,331 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:37:00" (1/1) ... [2023-12-19 12:37:00,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:37:00" (1/1) ... [2023-12-19 12:37:00,338 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:37:00" (1/1) ... [2023-12-19 12:37:00,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:37:00" (1/1) ... [2023-12-19 12:37:00,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:37:00" (1/1) ... [2023-12-19 12:37:00,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:37:00" (1/1) ... [2023-12-19 12:37:00,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 12:37:00,349 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 12:37:00,349 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 12:37:00,350 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 12:37:00,350 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:37:00" (1/1) ... [2023-12-19 12:37:00,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 12:37:00,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 12:37:00,371 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 12:37:00,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 12:37:00,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 12:37:00,409 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 12:37:00,409 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 12:37:00,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 12:37:00,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 12:37:00,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 12:37:00,462 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 12:37:00,465 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 12:37:00,600 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 12:37:00,634 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 12:37:00,634 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 12:37:00,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:37:00 BoogieIcfgContainer [2023-12-19 12:37:00,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 12:37:00,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 12:37:00,636 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 12:37:00,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 12:37:00,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 12:37:00" (1/3) ... [2023-12-19 12:37:00,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7de45f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:37:00, skipping insertion in model container [2023-12-19 12:37:00,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:37:00" (2/3) ... [2023-12-19 12:37:00,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7de45f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:37:00, skipping insertion in model container [2023-12-19 12:37:00,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:37:00" (3/3) ... [2023-12-19 12:37:00,640 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-80.i [2023-12-19 12:37:00,651 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 12:37:00,651 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 12:37:00,683 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 12:37:00,688 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;@71fbf445, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 12:37:00,689 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 12:37:00,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-19 12:37:00,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-19 12:37:00,699 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:37:00,700 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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-19 12:37:00,700 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:37:00,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:37:00,706 INFO L85 PathProgramCache]: Analyzing trace with hash -694495615, now seen corresponding path program 1 times [2023-12-19 12:37:00,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:37:00,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415159934] [2023-12-19 12:37:00,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:37:00,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:37:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:00,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:37:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:00,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 12:37:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:00,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 12:37:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:00,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 12:37:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:00,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 12:37:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:00,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 12:37:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:00,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 12:37:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:00,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:37:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:00,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:37:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:00,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 12:37:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:00,914 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-19 12:37:00,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:37:00,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415159934] [2023-12-19 12:37:00,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415159934] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:37:00,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:37:00,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 12:37:00,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262729118] [2023-12-19 12:37:00,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:37:00,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 12:37:00,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:37:00,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 12:37:00,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 12:37:00,963 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-19 12:37:00,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:37:00,992 INFO L93 Difference]: Finished difference Result 59 states and 98 transitions. [2023-12-19 12:37:00,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 12:37:00,995 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 62 [2023-12-19 12:37:00,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:37:00,999 INFO L225 Difference]: With dead ends: 59 [2023-12-19 12:37:00,999 INFO L226 Difference]: Without dead ends: 29 [2023-12-19 12:37:01,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 12:37:01,003 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 12:37:01,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 12:37:01,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-19 12:37:01,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-19 12:37:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-19 12:37:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2023-12-19 12:37:01,029 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 62 [2023-12-19 12:37:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:37:01,032 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2023-12-19 12:37:01,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-19 12:37:01,033 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2023-12-19 12:37:01,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-19 12:37:01,036 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:37:01,036 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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-19 12:37:01,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 12:37:01,036 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:37:01,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:37:01,037 INFO L85 PathProgramCache]: Analyzing trace with hash -410990211, now seen corresponding path program 1 times [2023-12-19 12:37:01,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:37:01,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469013291] [2023-12-19 12:37:01,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:37:01,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:37:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:01,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:37:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:01,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 12:37:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:01,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 12:37:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:01,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 12:37:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:01,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 12:37:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:01,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 12:37:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:01,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 12:37:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:01,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:37:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:01,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:37:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:01,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 12:37:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-19 12:37:01,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:37:01,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469013291] [2023-12-19 12:37:01,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469013291] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:37:01,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:37:01,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 12:37:01,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903366947] [2023-12-19 12:37:01,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:37:01,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 12:37:01,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:37:01,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 12:37:01,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-19 12:37:01,654 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-19 12:37:01,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:37:01,766 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2023-12-19 12:37:01,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 12:37:01,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 62 [2023-12-19 12:37:01,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:37:01,769 INFO L225 Difference]: With dead ends: 70 [2023-12-19 12:37:01,770 INFO L226 Difference]: Without dead ends: 68 [2023-12-19 12:37:01,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-19 12:37:01,772 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 60 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 12:37:01,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 179 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 12:37:01,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-19 12:37:01,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2023-12-19 12:37:01,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-19 12:37:01,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 66 transitions. [2023-12-19 12:37:01,798 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 66 transitions. Word has length 62 [2023-12-19 12:37:01,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:37:01,798 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 66 transitions. [2023-12-19 12:37:01,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-19 12:37:01,801 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2023-12-19 12:37:01,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-19 12:37:01,806 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:37:01,806 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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-19 12:37:01,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 12:37:01,806 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:37:01,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:37:01,807 INFO L85 PathProgramCache]: Analyzing trace with hash 135104667, now seen corresponding path program 1 times [2023-12-19 12:37:01,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:37:01,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677740668] [2023-12-19 12:37:01,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:37:01,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:37:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:02,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:37:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:02,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 12:37:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:02,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 12:37:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:02,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 12:37:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:02,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 12:37:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:02,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 12:37:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:02,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 12:37:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:02,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:37:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:02,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:37:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:02,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 12:37:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:37:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-19 12:37:02,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:37:02,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677740668] [2023-12-19 12:37:02,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677740668] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:37:02,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:37:02,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 12:37:02,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524503957] [2023-12-19 12:37:02,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:37:02,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 12:37:02,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:37:02,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 12:37:02,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-19 12:37:02,387 INFO L87 Difference]: Start difference. First operand 48 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-19 12:37:02,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:37:02,593 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2023-12-19 12:37:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 12:37:02,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 63 [2023-12-19 12:37:02,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:37:02,597 INFO L225 Difference]: With dead ends: 85 [2023-12-19 12:37:02,597 INFO L226 Difference]: Without dead ends: 83 [2023-12-19 12:37:02,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-19 12:37:02,601 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 82 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 12:37:02,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 140 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 12:37:02,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-19 12:37:02,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 46. [2023-12-19 12:37:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 12:37:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2023-12-19 12:37:02,619 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 63 [2023-12-19 12:37:02,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:37:02,620 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2023-12-19 12:37:02,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-19 12:37:02,620 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2023-12-19 12:37:02,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-19 12:37:02,624 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:37:02,624 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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-19 12:37:02,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 12:37:02,624 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:37:02,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:37:02,624 INFO L85 PathProgramCache]: Analyzing trace with hash 135164249, now seen corresponding path program 1 times [2023-12-19 12:37:02,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:37:02,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386648876] [2023-12-19 12:37:02,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:37:02,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:37:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 12:37:02,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 12:37:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 12:37:02,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 12:37:02,674 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 12:37:02,674 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 12:37:02,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 12:37:02,678 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-19 12:37:02,680 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 12:37:02,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 12:37:02 BoogieIcfgContainer [2023-12-19 12:37:02,726 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 12:37:02,726 INFO L158 Benchmark]: Toolchain (without parser) took 2704.07ms. Allocated memory was 241.2MB in the beginning and 315.6MB in the end (delta: 74.4MB). Free memory was 203.6MB in the beginning and 135.5MB in the end (delta: 68.0MB). Peak memory consumption was 144.0MB. Max. memory is 8.0GB. [2023-12-19 12:37:02,726 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory was 130.1MB in the beginning and 130.0MB in the end (delta: 174.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 12:37:02,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.90ms. Allocated memory is still 241.2MB. Free memory was 203.6MB in the beginning and 192.0MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-19 12:37:02,727 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.85ms. Allocated memory is still 241.2MB. Free memory was 192.0MB in the beginning and 189.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 12:37:02,727 INFO L158 Benchmark]: Boogie Preprocessor took 46.78ms. Allocated memory is still 241.2MB. Free memory was 189.9MB in the beginning and 187.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 12:37:02,727 INFO L158 Benchmark]: RCFGBuilder took 285.35ms. Allocated memory is still 241.2MB. Free memory was 187.8MB in the beginning and 174.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-19 12:37:02,727 INFO L158 Benchmark]: TraceAbstraction took 2089.70ms. Allocated memory was 241.2MB in the beginning and 315.6MB in the end (delta: 74.4MB). Free memory was 173.6MB in the beginning and 135.5MB in the end (delta: 38.1MB). Peak memory consumption was 113.6MB. Max. memory is 8.0GB. [2023-12-19 12:37:02,728 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.11ms. Allocated memory is still 182.5MB. Free memory was 130.1MB in the beginning and 130.0MB in the end (delta: 174.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.90ms. Allocated memory is still 241.2MB. Free memory was 203.6MB in the beginning and 192.0MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.85ms. Allocated memory is still 241.2MB. Free memory was 192.0MB in the beginning and 189.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.78ms. Allocated memory is still 241.2MB. Free memory was 189.9MB in the beginning and 187.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 285.35ms. Allocated memory is still 241.2MB. Free memory was 187.8MB in the beginning and 174.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 2089.70ms. Allocated memory was 241.2MB in the beginning and 315.6MB in the end (delta: 74.4MB). Free memory was 173.6MB in the beginning and 135.5MB in the end (delta: 38.1MB). Peak memory consumption was 113.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] float var_1_4 = 200.75; [L24] float var_1_5 = 5.7; [L25] signed short int var_1_6 = 200; [L26] signed short int var_1_7 = 256; [L27] signed short int var_1_8 = -16; [L28] unsigned char var_1_9 = 1; [L29] unsigned char var_1_10 = 0; [L65] isInitial = 1 [L66] FCALL initially() [L67] COND TRUE 1 [L68] FCALL updateLastVariables() [L69] CALL updateVariables() [L41] var_1_4 = __VERIFIER_nondet_float() [L42] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_5=57/10, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_5=57/10, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L42] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_5=57/10, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L43] var_1_5 = __VERIFIER_nondet_float() [L44] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L44] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L45] var_1_6 = __VERIFIER_nondet_short() [L46] CALL assume_abort_if_not(var_1_6 >= -8192) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=256, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=256, var_1_8=-16, var_1_9=1] [L46] RET assume_abort_if_not(var_1_6 >= -8192) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=256, var_1_8=-16, var_1_9=1] [L47] CALL assume_abort_if_not(var_1_6 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=256, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=256, var_1_8=-16, var_1_9=1] [L47] RET assume_abort_if_not(var_1_6 <= 8192) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=256, var_1_8=-16, var_1_9=1] [L48] var_1_7 = __VERIFIER_nondet_short() [L49] CALL assume_abort_if_not(var_1_7 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16, var_1_9=1] [L49] RET assume_abort_if_not(var_1_7 >= -8191) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16, var_1_9=1] [L50] CALL assume_abort_if_not(var_1_7 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16, var_1_9=1] [L50] RET assume_abort_if_not(var_1_7 <= 8191) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16, var_1_9=1] [L51] var_1_8 = __VERIFIER_nondet_short() [L52] CALL assume_abort_if_not(var_1_8 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16383, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16383, var_1_9=1] [L52] RET assume_abort_if_not(var_1_8 >= -16383) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16383, var_1_9=1] [L53] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16383, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16383, var_1_9=1] [L53] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16383, var_1_9=1] [L54] var_1_10 = __VERIFIER_nondet_uchar() [L55] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16383, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16383, var_1_9=1] [L55] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16383, var_1_9=1] [L56] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16383, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16383, var_1_9=1] [L56] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16383, var_1_9=1] [L69] RET updateVariables() [L70] CALL step() [L33] var_1_9 = var_1_10 VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16383, var_1_9=0] [L34] COND TRUE ! (var_1_9 && var_1_9) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16383, var_1_9=0] [L35] COND FALSE !(var_1_4 <= var_1_5) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16383, var_1_9=0] [L70] RET step() [L71] CALL, EXPR property() [L61-L62] return ((! (var_1_9 && var_1_9)) ? ((var_1_4 <= var_1_5) ? (var_1_1 == ((signed short int) ((((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) + var_1_7) + var_1_8))) : 1) : 1) && (var_1_9 == ((unsigned char) var_1_10)) ; [L71] RET, EXPR property() [L71] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16383, var_1_9=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=0, var_1_7=8191, var_1_8=-16383, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 142 mSDsluCounter, 356 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 201 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 112 IncrementalHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 155 mSDtfsCounter, 112 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=2, InterpolantAutomatonStates: 16, 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, 3 MinimizatonAttempts, 57 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 580 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 540/540 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-19 12:37:02,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...