/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-52.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 11:55:44,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 11:55:44,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 11:55:44,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 11:55:44,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 11:55:44,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 11:55:44,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 11:55:44,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 11:55:44,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 11:55:44,780 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 11:55:44,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 11:55:44,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 11:55:44,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 11:55:44,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 11:55:44,783 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 11:55:44,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 11:55:44,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 11:55:44,783 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 11:55:44,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 11:55:44,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 11:55:44,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 11:55:44,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 11:55:44,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 11:55:44,785 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 11:55:44,785 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 11:55:44,785 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 11:55:44,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 11:55:44,786 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 11:55:44,786 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 11:55:44,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 11:55:44,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 11:55:44,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 11:55:44,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 11:55:44,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 11:55:44,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 11:55:44,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 11:55:44,789 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 11:55:44,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 11:55:44,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 11:55:44,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 11:55:44,789 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 11:55:44,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 11:55:44,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 11:55:44,790 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 11:55:45,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 11:55:45,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 11:55:45,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 11:55:45,047 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 11:55:45,047 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 11:55:45,048 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-52.i [2023-12-19 11:55:46,217 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 11:55:46,388 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 11:55:46,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-52.i [2023-12-19 11:55:46,395 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c43ed9046/b8bfe7dfb6704ca99ab4c89b90285bac/FLAGf673e71ef [2023-12-19 11:55:46,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c43ed9046/b8bfe7dfb6704ca99ab4c89b90285bac [2023-12-19 11:55:46,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 11:55:46,408 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 11:55:46,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 11:55:46,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 11:55:46,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 11:55:46,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:55:46" (1/1) ... [2023-12-19 11:55:46,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7139c1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:55:46, skipping insertion in model container [2023-12-19 11:55:46,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:55:46" (1/1) ... [2023-12-19 11:55:46,445 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 11:55:46,599 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-52.i[915,928] [2023-12-19 11:55:46,632 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 11:55:46,641 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 11:55:46,650 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-52.i[915,928] [2023-12-19 11:55:46,672 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 11:55:46,688 INFO L206 MainTranslator]: Completed translation [2023-12-19 11:55:46,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:55:46 WrapperNode [2023-12-19 11:55:46,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 11:55:46,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 11:55:46,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 11:55:46,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 11:55:46,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:55:46" (1/1) ... [2023-12-19 11:55:46,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:55:46" (1/1) ... [2023-12-19 11:55:46,732 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2023-12-19 11:55:46,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 11:55:46,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 11:55:46,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 11:55:46,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 11:55:46,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:55:46" (1/1) ... [2023-12-19 11:55:46,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:55:46" (1/1) ... [2023-12-19 11:55:46,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:55:46" (1/1) ... [2023-12-19 11:55:46,782 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-19 11:55:46,782 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:55:46" (1/1) ... [2023-12-19 11:55:46,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:55:46" (1/1) ... [2023-12-19 11:55:46,789 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:55:46" (1/1) ... [2023-12-19 11:55:46,791 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:55:46" (1/1) ... [2023-12-19 11:55:46,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:55:46" (1/1) ... [2023-12-19 11:55:46,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:55:46" (1/1) ... [2023-12-19 11:55:46,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 11:55:46,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 11:55:46,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 11:55:46,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 11:55:46,817 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:55:46" (1/1) ... [2023-12-19 11:55:46,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 11:55:46,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:55:46,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 11:55:46,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 11:55:46,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 11:55:46,885 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 11:55:46,886 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 11:55:46,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 11:55:46,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 11:55:46,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 11:55:46,981 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 11:55:46,985 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 11:55:47,196 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 11:55:47,239 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 11:55:47,240 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 11:55:47,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:55:47 BoogieIcfgContainer [2023-12-19 11:55:47,240 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 11:55:47,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 11:55:47,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 11:55:47,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 11:55:47,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 11:55:46" (1/3) ... [2023-12-19 11:55:47,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734af71a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:55:47, skipping insertion in model container [2023-12-19 11:55:47,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:55:46" (2/3) ... [2023-12-19 11:55:47,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734af71a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:55:47, skipping insertion in model container [2023-12-19 11:55:47,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:55:47" (3/3) ... [2023-12-19 11:55:47,250 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-52.i [2023-12-19 11:55:47,266 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 11:55:47,266 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 11:55:47,344 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 11:55:47,351 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;@39afa2f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 11:55:47,352 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 11:55:47,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-19 11:55:47,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-19 11:55:47,371 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:55:47,372 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:55:47,373 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:55:47,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:55:47,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1214595298, now seen corresponding path program 1 times [2023-12-19 11:55:47,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:55:47,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898488264] [2023-12-19 11:55:47,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:55:47,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:55:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:55:48,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:55:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:55:48,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 11:55:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:55:48,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:55:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:55:48,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:55:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:55:48,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:55:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:55:48,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:55:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:55:48,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:55:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:55:48,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 11:55:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:55:48,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 11:55:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:55:48,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 11:55:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:55:48,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 11:55:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:55:48,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 11:55:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:55:48,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 11:55:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:55:48,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 11:55:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:55:48,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 11:55:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:55:48,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 11:55:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:55:48,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 11:55:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:55:48,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 11:55:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:55:48,299 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-19 11:55:48,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:55:48,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898488264] [2023-12-19 11:55:48,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898488264] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 11:55:48,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965725674] [2023-12-19 11:55:48,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:55:48,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:55:48,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:55:48,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 11:55:48,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 11:55:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:55:48,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-19 11:55:48,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 11:55:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 317 proven. 21 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2023-12-19 11:55:48,684 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 11:55:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-19 11:55:48,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965725674] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 11:55:48,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 11:55:48,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-12-19 11:55:48,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103979100] [2023-12-19 11:55:48,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 11:55:48,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 11:55:48,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:55:48,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 11:55:48,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-19 11:55:48,946 INFO L87 Difference]: Start difference. First operand has 46 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2023-12-19 11:55:49,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:55:49,806 INFO L93 Difference]: Finished difference Result 191 states and 344 transitions. [2023-12-19 11:55:49,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-19 11:55:49,809 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 109 [2023-12-19 11:55:49,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:55:49,817 INFO L225 Difference]: With dead ends: 191 [2023-12-19 11:55:49,817 INFO L226 Difference]: Without dead ends: 146 [2023-12-19 11:55:49,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 249 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2023-12-19 11:55:49,824 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 197 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 11:55:49,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 226 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 11:55:49,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-19 11:55:49,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 95. [2023-12-19 11:55:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 53 states have (on average 1.150943396226415) internal successors, (61), 54 states have internal predecessors, (61), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 11:55:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 133 transitions. [2023-12-19 11:55:49,880 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 133 transitions. Word has length 109 [2023-12-19 11:55:49,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:55:49,881 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 133 transitions. [2023-12-19 11:55:49,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2023-12-19 11:55:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2023-12-19 11:55:49,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-19 11:55:49,883 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:55:49,883 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:55:49,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 11:55:50,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-19 11:55:50,091 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:55:50,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:55:50,091 INFO L85 PathProgramCache]: Analyzing trace with hash -560412064, now seen corresponding path program 1 times [2023-12-19 11:55:50,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:55:50,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756182606] [2023-12-19 11:55:50,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:55:50,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:55:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 11:55:50,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 11:55:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 11:55:50,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 11:55:50,229 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 11:55:50,231 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 11:55:50,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 11:55:50,236 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-19 11:55:50,240 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 11:55:50,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 11:55:50 BoogieIcfgContainer [2023-12-19 11:55:50,319 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 11:55:50,320 INFO L158 Benchmark]: Toolchain (without parser) took 3911.28ms. Allocated memory is still 302.0MB. Free memory was 248.5MB in the beginning and 132.5MB in the end (delta: 116.1MB). Peak memory consumption was 117.1MB. Max. memory is 8.0GB. [2023-12-19 11:55:50,323 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 192.9MB. Free memory was 143.1MB in the beginning and 142.9MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 11:55:50,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.84ms. Allocated memory is still 302.0MB. Free memory was 248.2MB in the beginning and 235.5MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-19 11:55:50,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.01ms. Allocated memory is still 302.0MB. Free memory was 235.5MB in the beginning and 232.2MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 11:55:50,325 INFO L158 Benchmark]: Boogie Preprocessor took 80.88ms. Allocated memory is still 302.0MB. Free memory was 232.2MB in the beginning and 227.6MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 11:55:50,325 INFO L158 Benchmark]: RCFGBuilder took 424.52ms. Allocated memory is still 302.0MB. Free memory was 227.6MB in the beginning and 208.4MB in the end (delta: 19.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-19 11:55:50,326 INFO L158 Benchmark]: TraceAbstraction took 3074.66ms. Allocated memory is still 302.0MB. Free memory was 207.7MB in the beginning and 132.5MB in the end (delta: 75.2MB). Peak memory consumption was 76.2MB. Max. memory is 8.0GB. [2023-12-19 11:55:50,332 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.52ms. Allocated memory is still 192.9MB. Free memory was 143.1MB in the beginning and 142.9MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 276.84ms. Allocated memory is still 302.0MB. Free memory was 248.2MB in the beginning and 235.5MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.01ms. Allocated memory is still 302.0MB. Free memory was 235.5MB in the beginning and 232.2MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 80.88ms. Allocated memory is still 302.0MB. Free memory was 232.2MB in the beginning and 227.6MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 424.52ms. Allocated memory is still 302.0MB. Free memory was 227.6MB in the beginning and 208.4MB in the end (delta: 19.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 3074.66ms. Allocated memory is still 302.0MB. Free memory was 207.7MB in the beginning and 132.5MB in the end (delta: 75.2MB). Peak memory consumption was 76.2MB. 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 someBinaryDOUBLEComparisonOperation at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] double var_1_2 = 255.6; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 0; [L28] unsigned char var_1_9 = 8; [L29] double var_1_10 = 255.2; [L30] unsigned char var_1_11 = 64; [L31] unsigned char var_1_12 = 100; [L32] unsigned char var_1_13 = 32; [L33] unsigned char var_1_14 = 64; [L34] unsigned char var_1_15 = 0; [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] FCALL updateLastVariables() [L100] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=8] [L61] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=8] [L62] var_1_6 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_7=0, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_7=0, var_1_8=0, var_1_9=8] [L63] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_7=0, var_1_8=0, var_1_9=8] [L64] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=8] [L64] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=8] [L65] var_1_7 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L66] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L67] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L67] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L68] var_1_8 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_9=8] [L69] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_9=8] [L70] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L70] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L71] var_1_10 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L72] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L73] var_1_11 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L74] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L75] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L75] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L76] var_1_12 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_12 >= 64) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L77] RET assume_abort_if_not(var_1_12 >= 64) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L78] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L78] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L79] var_1_13 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L80] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L81] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L81] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L82] var_1_14 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L83] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L84] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L84] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L85] var_1_15 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L86] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L87] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L87] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L100] RET updateVariables() [L101] CALL step() [L38] COND TRUE (- var_1_2) <= var_1_10 [L39] var_1_9 = ((((((var_1_11 + var_1_12) - var_1_13)) < ((var_1_14 + var_1_15))) ? (((var_1_11 + var_1_12) - var_1_13)) : ((var_1_14 + var_1_15)))) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L43] COND TRUE var_1_2 < 63.75 [L44] var_1_1 = (10 - var_1_9) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L48] signed long int stepLocal_0 = (var_1_9 / -256) * 32; VAL [isInitial=1, stepLocal_0=0, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L49] COND FALSE !(var_1_9 > stepLocal_0) [L56] var_1_5 = var_1_7 VAL [isInitial=1, stepLocal_0=0, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L101] RET step() [L102] CALL, EXPR property() [L92-L93] return (((var_1_2 < 63.75) ? (var_1_1 == ((signed short int) (10 - var_1_9))) : (var_1_1 == ((signed short int) (4 + var_1_9)))) && ((var_1_9 > ((var_1_9 / -256) * 32)) ? (var_1_6 ? (var_1_5 == ((unsigned char) (! (var_1_7 && (! var_1_8))))) : (var_1_5 == ((unsigned char) var_1_7))) : (var_1_5 == ((unsigned char) var_1_7)))) && (((- var_1_2) <= var_1_10) ? (var_1_9 == ((unsigned char) ((((((var_1_11 + var_1_12) - var_1_13)) < ((var_1_14 + var_1_15))) ? (((var_1_11 + var_1_12) - var_1_13)) : ((var_1_14 + var_1_15)))))) : (var_1_9 == ((unsigned char) var_1_12))) ; [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 2, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 197 mSDsluCounter, 226 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 155 mSDsCounter, 203 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 418 IncrementalHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 203 mSolverCounterUnsat, 71 mSDtfsCounter, 418 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 249 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=1, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 51 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 324 ConstructedInterpolants, 0 QuantifiedInterpolants, 1077 SizeOfPredicates, 5 NumberOfNonLiveVariables, 246 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 3 InterpolantComputations, 0 PerfectInterpolantSequences, 1773/1836 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 11:55:50,353 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...