/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-79.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:07:10,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:07:10,283 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-15 21:07:10,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:07:10,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:07:10,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:07:10,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:07:10,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:07:10,309 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:07:10,309 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:07:10,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:07:10,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:07:10,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:07:10,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:07:10,311 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:07:10,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:07:10,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:07:10,312 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:07:10,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:07:10,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:07:10,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:07:10,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:07:10,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:07:10,314 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:07:10,314 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:07:10,314 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:07:10,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:07:10,315 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:07:10,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:07:10,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:07:10,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:07:10,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:07:10,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:07:10,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:07:10,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:07:10,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:07:10,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:07:10,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:07:10,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:07:10,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:07:10,318 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:07:10,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:07:10,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:07:10,319 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-15 21:07:10,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:07:10,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:07:10,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:07:10,525 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:07:10,526 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:07:10,527 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-79.i [2023-12-15 21:07:11,726 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:07:11,925 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:07:11,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-79.i [2023-12-15 21:07:11,932 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/361c71396/003a49d5a23746b6a7c80aa4827441fd/FLAG700a01fe2 [2023-12-15 21:07:11,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/361c71396/003a49d5a23746b6a7c80aa4827441fd [2023-12-15 21:07:11,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:07:11,946 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:07:11,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:07:11,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:07:11,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:07:11,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:07:11" (1/1) ... [2023-12-15 21:07:11,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17286b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:07:11, skipping insertion in model container [2023-12-15 21:07:11,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:07:11" (1/1) ... [2023-12-15 21:07:11,969 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:07:12,130 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-79.i[915,928] [2023-12-15 21:07:12,152 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:07:12,161 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:07:12,170 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-79.i[915,928] [2023-12-15 21:07:12,178 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:07:12,189 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:07:12,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:07:12 WrapperNode [2023-12-15 21:07:12,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:07:12,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:07:12,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:07:12,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:07:12,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:07:12" (1/1) ... [2023-12-15 21:07:12,202 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:07:12" (1/1) ... [2023-12-15 21:07:12,219 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 76 [2023-12-15 21:07:12,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:07:12,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:07:12,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:07:12,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:07:12,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:07:12" (1/1) ... [2023-12-15 21:07:12,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:07:12" (1/1) ... [2023-12-15 21:07:12,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:07:12" (1/1) ... [2023-12-15 21:07:12,239 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-15 21:07:12,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:07:12" (1/1) ... [2023-12-15 21:07:12,240 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:07:12" (1/1) ... [2023-12-15 21:07:12,244 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:07:12" (1/1) ... [2023-12-15 21:07:12,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:07:12" (1/1) ... [2023-12-15 21:07:12,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:07:12" (1/1) ... [2023-12-15 21:07:12,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:07:12" (1/1) ... [2023-12-15 21:07:12,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:07:12,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:07:12,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:07:12,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:07:12,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:07:12" (1/1) ... [2023-12-15 21:07:12,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:07:12,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:07:12,286 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-15 21:07:12,312 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-15 21:07:12,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:07:12,320 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:07:12,320 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:07:12,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:07:12,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:07:12,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:07:12,380 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:07:12,381 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:07:12,559 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:07:12,595 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:07:12,595 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:07:12,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:07:12 BoogieIcfgContainer [2023-12-15 21:07:12,596 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:07:12,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:07:12,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:07:12,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:07:12,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:07:11" (1/3) ... [2023-12-15 21:07:12,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625363f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:07:12, skipping insertion in model container [2023-12-15 21:07:12,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:07:12" (2/3) ... [2023-12-15 21:07:12,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625363f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:07:12, skipping insertion in model container [2023-12-15 21:07:12,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:07:12" (3/3) ... [2023-12-15 21:07:12,603 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-79.i [2023-12-15 21:07:12,617 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:07:12,617 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:07:12,654 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:07:12,659 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;@49bd7d6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:07:12,660 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:07:12,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 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-15 21:07:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-15 21:07:12,672 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:07:12,672 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-15 21:07:12,673 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:07:12,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:07:12,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1845538419, now seen corresponding path program 1 times [2023-12-15 21:07:12,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:07:12,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755066855] [2023-12-15 21:07:12,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:07:12,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:07:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:07:12,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:07:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:07:12,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:07:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:07:12,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:07:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:07:12,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:07:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:07:12,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:07:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:07:12,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:07:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:07:12,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:07:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:07:12,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:07:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:07:12,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:07:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:07:12,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-15 21:07:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:07:13,011 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-15 21:07:13,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:07:13,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755066855] [2023-12-15 21:07:13,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755066855] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:07:13,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:07:13,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:07:13,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309220610] [2023-12-15 21:07:13,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:07:13,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:07:13,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:07:13,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:07:13,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:07:13,052 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 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-15 21:07:13,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:07:13,102 INFO L93 Difference]: Finished difference Result 61 states and 102 transitions. [2023-12-15 21:07:13,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:07:13,105 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-15 21:07:13,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:07:13,110 INFO L225 Difference]: With dead ends: 61 [2023-12-15 21:07:13,111 INFO L226 Difference]: Without dead ends: 30 [2023-12-15 21:07:13,115 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-15 21:07:13,118 INFO L413 NwaCegarLoop]: 39 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, 39 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-15 21:07:13,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:07:13,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-15 21:07:13,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-15 21:07:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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-15 21:07:13,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2023-12-15 21:07:13,160 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 62 [2023-12-15 21:07:13,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:07:13,160 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2023-12-15 21:07:13,161 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-15 21:07:13,161 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2023-12-15 21:07:13,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-15 21:07:13,165 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:07:13,166 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-15 21:07:13,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:07:13,167 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:07:13,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:07:13,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1031786121, now seen corresponding path program 1 times [2023-12-15 21:07:13,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:07:13,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292375594] [2023-12-15 21:07:13,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:07:13,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:07:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:07:13,271 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:07:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:07:13,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:07:13,334 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:07:13,336 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:07:13,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:07:13,341 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-15 21:07:13,343 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:07:13,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:07:13 BoogieIcfgContainer [2023-12-15 21:07:13,385 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:07:13,385 INFO L158 Benchmark]: Toolchain (without parser) took 1438.75ms. Allocated memory is still 282.1MB. Free memory was 225.4MB in the beginning and 153.5MB in the end (delta: 71.8MB). Peak memory consumption was 72.4MB. Max. memory is 8.0GB. [2023-12-15 21:07:13,386 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 196.1MB. Free memory was 143.0MB in the beginning and 142.8MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:07:13,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.69ms. Allocated memory is still 282.1MB. Free memory was 224.9MB in the beginning and 213.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-15 21:07:13,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.79ms. Allocated memory is still 282.1MB. Free memory was 213.3MB in the beginning and 211.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-15 21:07:13,387 INFO L158 Benchmark]: Boogie Preprocessor took 31.34ms. Allocated memory is still 282.1MB. Free memory was 211.7MB in the beginning and 209.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:07:13,387 INFO L158 Benchmark]: RCFGBuilder took 343.62ms. Allocated memory is still 282.1MB. Free memory was 209.7MB in the beginning and 195.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-15 21:07:13,388 INFO L158 Benchmark]: TraceAbstraction took 786.80ms. Allocated memory is still 282.1MB. Free memory was 195.0MB in the beginning and 153.5MB in the end (delta: 41.4MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2023-12-15 21:07:13,390 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.13ms. Allocated memory is still 196.1MB. Free memory was 143.0MB in the beginning and 142.8MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.69ms. Allocated memory is still 282.1MB. Free memory was 224.9MB in the beginning and 213.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.79ms. Allocated memory is still 282.1MB. Free memory was 213.3MB in the beginning and 211.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.34ms. Allocated memory is still 282.1MB. Free memory was 211.7MB in the beginning and 209.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 343.62ms. Allocated memory is still 282.1MB. Free memory was 209.7MB in the beginning and 195.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 786.80ms. Allocated memory is still 282.1MB. Free memory was 195.0MB in the beginning and 153.5MB in the end (delta: 41.4MB). Peak memory consumption was 41.9MB. 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 65. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 3.375; [L23] unsigned char var_1_2 = 0; [L24] unsigned long int var_1_3 = 4257803242; [L25] unsigned long int var_1_4 = 16; [L26] unsigned long int var_1_5 = 256; [L27] double var_1_6 = 7.375; [L28] double var_1_7 = 9.9; [L69] isInitial = 1 [L70] FCALL initially() [L71] COND TRUE 1 [L72] FCALL updateLastVariables() [L73] CALL updateVariables() [L45] var_1_2 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_3=4257803242, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=27/8, var_1_3=4257803242, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L46] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=27/8, var_1_3=4257803242, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L47] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=4257803242, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=4257803242, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L47] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=4257803242, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L48] var_1_3 = __VERIFIER_nondet_ulong() [L49] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L49] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L50] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L50] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L51] var_1_4 = __VERIFIER_nondet_ulong() [L52] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L52] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L53] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L53] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L54] var_1_5 = __VERIFIER_nondet_ulong() [L55] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_6=59/8, var_1_7=99/10] [L55] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_6=59/8, var_1_7=99/10] [L56] CALL assume_abort_if_not(var_1_5 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_6=59/8, var_1_7=99/10] [L56] RET assume_abort_if_not(var_1_5 <= 4294967295) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_6=59/8, var_1_7=99/10] [L57] var_1_6 = __VERIFIER_nondet_double() [L58] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_7=99/10] [L58] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_7=99/10] [L59] var_1_7 = __VERIFIER_nondet_double() [L60] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1] [L60] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1] [L73] RET updateVariables() [L74] CALL step() [L32] unsigned long int stepLocal_1 = var_1_5; [L33] unsigned long int stepLocal_0 = ((((var_1_3 - var_1_4)) < (var_1_5)) ? ((var_1_3 - var_1_4)) : (var_1_5)); VAL [isInitial=1, stepLocal_0=2147483646, stepLocal_1=2147483646, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_5=2147483646] [L34] COND FALSE !(stepLocal_0 <= 50u) [L41] var_1_1 = var_1_7 VAL [isInitial=1, stepLocal_0=2147483646, stepLocal_1=2147483646, var_1_1=4257803247, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_5=2147483646, var_1_7=4257803247] [L74] RET step() [L75] CALL, EXPR property() [L65-L66] return ((((((var_1_3 - var_1_4)) < (var_1_5)) ? ((var_1_3 - var_1_4)) : (var_1_5))) <= 50u) ? (var_1_2 ? ((var_1_3 > var_1_5) ? (var_1_1 == ((double) (var_1_6 + var_1_7))) : 1) : 1) : (var_1_1 == ((double) var_1_7)) ; [L75] RET, EXPR property() [L75] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_1=4257803247, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_5=2147483646, var_1_7=4257803247] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_1=4257803247, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_5=2147483646, var_1_7=4257803247] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 39 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 61 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 180/180 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-15 21:07:13,416 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...