/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-46.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 03:56:24,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 03:56:24,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 03:56:24,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 03:56:24,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 03:56:24,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 03:56:24,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 03:56:24,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 03:56:24,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 03:56:24,475 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 03:56:24,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 03:56:24,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 03:56:24,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 03:56:24,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 03:56:24,477 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 03:56:24,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 03:56:24,477 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 03:56:24,477 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 03:56:24,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 03:56:24,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 03:56:24,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 03:56:24,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 03:56:24,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 03:56:24,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 03:56:24,479 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 03:56:24,479 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 03:56:24,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 03:56:24,480 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 03:56:24,480 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 03:56:24,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 03:56:24,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 03:56:24,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 03:56:24,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:56:24,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 03:56:24,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 03:56:24,482 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 03:56:24,482 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 03:56:24,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 03:56:24,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 03:56:24,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 03:56:24,482 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 03:56:24,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 03:56:24,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 03:56:24,483 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 03:56:24,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 03:56:24,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 03:56:24,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 03:56:24,680 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 03:56:24,680 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 03:56:24,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-46.i [2023-12-16 03:56:25,801 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 03:56:25,940 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 03:56:25,940 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-46.i [2023-12-16 03:56:25,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdfc04382/b8a7e13f3e99400b8076ffd2ee9807f1/FLAG54079fdea [2023-12-16 03:56:25,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdfc04382/b8a7e13f3e99400b8076ffd2ee9807f1 [2023-12-16 03:56:25,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 03:56:25,956 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 03:56:25,957 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 03:56:25,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 03:56:25,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 03:56:25,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:56:25" (1/1) ... [2023-12-16 03:56:25,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1953052d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:25, skipping insertion in model container [2023-12-16 03:56:25,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:56:25" (1/1) ... [2023-12-16 03:56:25,977 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 03:56:26,093 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-46.i[915,928] [2023-12-16 03:56:26,113 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:56:26,120 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 03:56:26,128 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-46.i[915,928] [2023-12-16 03:56:26,138 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:56:26,148 INFO L206 MainTranslator]: Completed translation [2023-12-16 03:56:26,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:26 WrapperNode [2023-12-16 03:56:26,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 03:56:26,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 03:56:26,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 03:56:26,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 03:56:26,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:26" (1/1) ... [2023-12-16 03:56:26,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:26" (1/1) ... [2023-12-16 03:56:26,174 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2023-12-16 03:56:26,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 03:56:26,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 03:56:26,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 03:56:26,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 03:56:26,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:26" (1/1) ... [2023-12-16 03:56:26,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:26" (1/1) ... [2023-12-16 03:56:26,184 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:26" (1/1) ... [2023-12-16 03:56:26,192 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 03:56:26,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:26" (1/1) ... [2023-12-16 03:56:26,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:26" (1/1) ... [2023-12-16 03:56:26,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:26" (1/1) ... [2023-12-16 03:56:26,206 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:26" (1/1) ... [2023-12-16 03:56:26,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:26" (1/1) ... [2023-12-16 03:56:26,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:26" (1/1) ... [2023-12-16 03:56:26,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 03:56:26,216 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 03:56:26,216 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 03:56:26,217 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 03:56:26,217 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:26" (1/1) ... [2023-12-16 03:56:26,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:56:26,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:56:26,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 03:56:26,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 03:56:26,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 03:56:26,314 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 03:56:26,314 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 03:56:26,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 03:56:26,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 03:56:26,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 03:56:26,366 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 03:56:26,368 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 03:56:26,541 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 03:56:26,569 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 03:56:26,569 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 03:56:26,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:56:26 BoogieIcfgContainer [2023-12-16 03:56:26,569 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 03:56:26,571 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 03:56:26,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 03:56:26,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 03:56:26,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:56:25" (1/3) ... [2023-12-16 03:56:26,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@756587a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:56:26, skipping insertion in model container [2023-12-16 03:56:26,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:26" (2/3) ... [2023-12-16 03:56:26,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@756587a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:56:26, skipping insertion in model container [2023-12-16 03:56:26,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:56:26" (3/3) ... [2023-12-16 03:56:26,575 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-46.i [2023-12-16 03:56:26,587 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 03:56:26,587 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 03:56:26,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 03:56:26,633 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;@6fbe58f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 03:56:26,633 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 03:56:26,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 03:56:26,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-16 03:56:26,643 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:56:26,643 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:56:26,644 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:56:26,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:56:26,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1848409247, now seen corresponding path program 1 times [2023-12-16 03:56:26,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:56:26,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579689554] [2023-12-16 03:56:26,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:56:26,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:56:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:26,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:56:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:26,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:56:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:26,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:56:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:26,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:56:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:26,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:56:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:26,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:56:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:26,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:56:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:26,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:56:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:26,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:56:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:26,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-16 03:56:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:26,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 03:56:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:26,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-16 03:56:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:26,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 03:56:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:26,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 03:56:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 03:56:26,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:56:26,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579689554] [2023-12-16 03:56:26,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579689554] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:56:26,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:56:26,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 03:56:26,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439815563] [2023-12-16 03:56:26,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:56:26,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 03:56:26,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:56:26,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 03:56:26,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:56:26,975 INFO L87 Difference]: Start difference. First operand has 38 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 03:56:27,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:56:27,024 INFO L93 Difference]: Finished difference Result 73 states and 124 transitions. [2023-12-16 03:56:27,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 03:56:27,026 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 85 [2023-12-16 03:56:27,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:56:27,031 INFO L225 Difference]: With dead ends: 73 [2023-12-16 03:56:27,032 INFO L226 Difference]: Without dead ends: 36 [2023-12-16 03:56:27,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:56:27,039 INFO L413 NwaCegarLoop]: 48 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, 48 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-16 03:56:27,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:56:27,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-16 03:56:27,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-12-16 03:56:27,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 03:56:27,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2023-12-16 03:56:27,075 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 85 [2023-12-16 03:56:27,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:56:27,075 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2023-12-16 03:56:27,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 03:56:27,076 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2023-12-16 03:56:27,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-16 03:56:27,080 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:56:27,080 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:56:27,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 03:56:27,081 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:56:27,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:56:27,082 INFO L85 PathProgramCache]: Analyzing trace with hash -850343593, now seen corresponding path program 1 times [2023-12-16 03:56:27,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:56:27,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650052055] [2023-12-16 03:56:27,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:56:27,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:56:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:56:27,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 03:56:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:56:27,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 03:56:27,285 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 03:56:27,286 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 03:56:27,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 03:56:27,289 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-16 03:56:27,292 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 03:56:27,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:56:27 BoogieIcfgContainer [2023-12-16 03:56:27,331 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 03:56:27,332 INFO L158 Benchmark]: Toolchain (without parser) took 1374.54ms. Allocated memory is still 284.2MB. Free memory was 233.4MB in the beginning and 156.3MB in the end (delta: 77.1MB). Peak memory consumption was 76.5MB. Max. memory is 8.0GB. [2023-12-16 03:56:27,332 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:56:27,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.95ms. Allocated memory is still 284.2MB. Free memory was 233.4MB in the beginning and 221.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 03:56:27,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.00ms. Allocated memory is still 284.2MB. Free memory was 221.3MB in the beginning and 219.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:56:27,337 INFO L158 Benchmark]: Boogie Preprocessor took 40.49ms. Allocated memory is still 284.2MB. Free memory was 219.8MB in the beginning and 217.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:56:27,337 INFO L158 Benchmark]: RCFGBuilder took 352.99ms. Allocated memory is still 284.2MB. Free memory was 217.7MB in the beginning and 202.5MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 03:56:27,337 INFO L158 Benchmark]: TraceAbstraction took 759.83ms. Allocated memory is still 284.2MB. Free memory was 201.4MB in the beginning and 156.3MB in the end (delta: 45.1MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. [2023-12-16 03:56:27,344 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.10ms. Allocated memory is still 181.4MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 191.95ms. Allocated memory is still 284.2MB. Free memory was 233.4MB in the beginning and 221.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.00ms. Allocated memory is still 284.2MB. Free memory was 221.3MB in the beginning and 219.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.49ms. Allocated memory is still 284.2MB. Free memory was 219.8MB in the beginning and 217.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 352.99ms. Allocated memory is still 284.2MB. Free memory was 217.7MB in the beginning and 202.5MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 759.83ms. Allocated memory is still 284.2MB. Free memory was 201.4MB in the beginning and 156.3MB in the end (delta: 45.1MB). Peak memory consumption was 45.1MB. 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 74, overapproximation of someUnaryDOUBLEoperation at line 31. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 255.3; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 1000000000000.5; [L25] double var_1_4 = 999999999.125; [L26] signed long int var_1_5 = 0; [L27] signed long int var_1_6 = 100; [L28] signed long int var_1_7 = 256; [L29] signed long int var_1_8 = -5; [L30] double var_1_9 = 24.2; [L31] double var_1_10 = -0.125; [L32] double var_1_11 = -0.5; [L78] isInitial = 1 [L79] FCALL initially() [L80] COND TRUE 1 [L81] FCALL updateLastVariables() [L82] CALL updateVariables() [L47] var_1_2 = __VERIFIER_nondet_uchar() [L48] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L48] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=2553/10, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L49] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L49] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L50] var_1_3 = __VERIFIER_nondet_double() [L51] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L51] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L52] var_1_4 = __VERIFIER_nondet_double() [L53] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L53] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L54] var_1_5 = __VERIFIER_nondet_long() [L55] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L55] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L56] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L56] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L57] var_1_6 = __VERIFIER_nondet_long() [L58] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L58] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L59] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L59] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L60] var_1_7 = __VERIFIER_nondet_long() [L61] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L61] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L62] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L62] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L63] var_1_8 = __VERIFIER_nondet_long() [L64] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L64] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L65] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L65] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L66] var_1_9 = __VERIFIER_nondet_double() [L67] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L67] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L68] var_1_10 = __VERIFIER_nondet_double() [L69] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L69] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L82] RET updateVariables() [L83] CALL step() [L36] signed long int stepLocal_0 = (((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) > (var_1_7)) ? (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) : (var_1_7)); VAL [isInitial=1, stepLocal_0=4, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L37] COND TRUE \read(var_1_2) [L38] var_1_1 = ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))) VAL [isInitial=1, stepLocal_0=4, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L44] var_1_11 = var_1_3 [L83] RET step() [L84] CALL, EXPR property() [L74-L75] return (var_1_2 ? (var_1_1 == ((double) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : ((((((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) > (var_1_7)) ? (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) : (var_1_7))) < var_1_8) ? (var_1_1 == ((double) (var_1_9 + var_1_10))) : 1)) && (var_1_11 == ((double) var_1_3)) ; [L84] RET, EXPR property() [L84] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_11=1000000000005, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_11=1000000000005, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 14, 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, 48 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, 48 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred 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, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 84 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 364/364 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-16 03:56:27,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...