/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-26.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 11:39:03,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 11:39:03,571 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 11:39:03,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 11:39:03,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 11:39:03,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 11:39:03,604 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 11:39:03,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 11:39:03,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 11:39:03,608 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 11:39:03,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 11:39:03,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 11:39:03,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 11:39:03,610 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 11:39:03,610 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 11:39:03,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 11:39:03,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 11:39:03,611 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 11:39:03,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 11:39:03,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 11:39:03,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 11:39:03,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 11:39:03,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 11:39:03,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 11:39:03,613 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 11:39:03,613 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 11:39:03,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 11:39:03,613 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 11:39:03,614 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 11:39:03,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 11:39:03,614 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 11:39:03,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 11:39:03,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 11:39:03,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 11:39:03,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 11:39:03,615 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 11:39:03,615 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 11:39:03,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 11:39:03,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 11:39:03,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 11:39:03,616 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 11:39:03,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 11:39:03,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 11:39:03,616 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 11:39:03,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 11:39:03,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 11:39:03,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 11:39:03,850 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 11:39:03,850 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 11:39:03,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-26.i [2023-12-19 11:39:04,886 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 11:39:05,002 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 11:39:05,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-26.i [2023-12-19 11:39:05,008 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c8cda757/8b5c61407bd941e6a568746ea9d8eb6c/FLAG112aca743 [2023-12-19 11:39:05,019 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c8cda757/8b5c61407bd941e6a568746ea9d8eb6c [2023-12-19 11:39:05,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 11:39:05,022 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 11:39:05,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 11:39:05,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 11:39:05,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 11:39:05,026 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:39:05" (1/1) ... [2023-12-19 11:39:05,027 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b9174d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:39:05, skipping insertion in model container [2023-12-19 11:39:05,027 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:39:05" (1/1) ... [2023-12-19 11:39:05,044 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 11:39:05,142 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-26.i[915,928] [2023-12-19 11:39:05,174 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 11:39:05,181 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 11:39:05,189 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-26.i[915,928] [2023-12-19 11:39:05,204 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 11:39:05,216 INFO L206 MainTranslator]: Completed translation [2023-12-19 11:39:05,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:39:05 WrapperNode [2023-12-19 11:39:05,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 11:39:05,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 11:39:05,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 11:39:05,222 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 11:39:05,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:39:05" (1/1) ... [2023-12-19 11:39:05,232 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:39:05" (1/1) ... [2023-12-19 11:39:05,266 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2023-12-19 11:39:05,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 11:39:05,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 11:39:05,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 11:39:05,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 11:39:05,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:39:05" (1/1) ... [2023-12-19 11:39:05,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:39:05" (1/1) ... [2023-12-19 11:39:05,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:39:05" (1/1) ... [2023-12-19 11:39:05,292 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-19 11:39:05,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:39:05" (1/1) ... [2023-12-19 11:39:05,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:39:05" (1/1) ... [2023-12-19 11:39:05,302 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:39:05" (1/1) ... [2023-12-19 11:39:05,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:39:05" (1/1) ... [2023-12-19 11:39:05,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:39:05" (1/1) ... [2023-12-19 11:39:05,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:39:05" (1/1) ... [2023-12-19 11:39:05,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 11:39:05,307 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 11:39:05,307 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 11:39:05,308 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 11:39:05,309 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:39:05" (1/1) ... [2023-12-19 11:39:05,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 11:39:05,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:39:05,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 11:39:05,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 11:39:05,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 11:39:05,380 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 11:39:05,380 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 11:39:05,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 11:39:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 11:39:05,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 11:39:05,430 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 11:39:05,432 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 11:39:05,653 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 11:39:05,683 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 11:39:05,684 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 11:39:05,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:39:05 BoogieIcfgContainer [2023-12-19 11:39:05,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 11:39:05,686 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 11:39:05,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 11:39:05,689 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 11:39:05,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 11:39:05" (1/3) ... [2023-12-19 11:39:05,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d94d5bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:39:05, skipping insertion in model container [2023-12-19 11:39:05,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:39:05" (2/3) ... [2023-12-19 11:39:05,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d94d5bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:39:05, skipping insertion in model container [2023-12-19 11:39:05,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:39:05" (3/3) ... [2023-12-19 11:39:05,691 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-26.i [2023-12-19 11:39:05,705 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 11:39:05,705 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 11:39:05,745 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 11:39:05,751 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;@5e00afc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 11:39:05,751 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 11:39:05,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-19 11:39:05,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-19 11:39:05,766 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:39:05,767 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:39:05,768 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:39:05,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:39:05,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1558522227, now seen corresponding path program 1 times [2023-12-19 11:39:05,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:39:05,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709141188] [2023-12-19 11:39:05,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:39:05,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:39:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:39:05,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:39:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:39:05,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:39:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:39:05,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:39:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:39:05,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:39:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:39:05,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:39:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:39:05,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:39:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:39:05,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 11:39:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:39:05,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 11:39:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:39:05,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 11:39:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:39:05,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 11:39:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:39:06,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 11:39:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:39:06,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 11:39:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:39:06,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 11:39:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:39:06,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 11:39:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:39:06,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 11:39:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:39:06,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 11:39:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:39:06,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 11:39:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:39:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 11:39:06,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:39:06,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709141188] [2023-12-19 11:39:06,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709141188] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:39:06,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:39:06,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 11:39:06,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982598024] [2023-12-19 11:39:06,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:39:06,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 11:39:06,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:39:06,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 11:39:06,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 11:39:06,062 INFO L87 Difference]: Start difference. First operand has 46 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 11:39:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:39:06,102 INFO L93 Difference]: Finished difference Result 91 states and 156 transitions. [2023-12-19 11:39:06,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 11:39:06,111 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 103 [2023-12-19 11:39:06,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:39:06,117 INFO L225 Difference]: With dead ends: 91 [2023-12-19 11:39:06,117 INFO L226 Difference]: Without dead ends: 44 [2023-12-19 11:39:06,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 11:39:06,126 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:39:06,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:39:06,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-19 11:39:06,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-19 11:39:06,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-19 11:39:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2023-12-19 11:39:06,160 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 103 [2023-12-19 11:39:06,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:39:06,161 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2023-12-19 11:39:06,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 11:39:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2023-12-19 11:39:06,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-19 11:39:06,165 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:39:06,166 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:39:06,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 11:39:06,166 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:39:06,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:39:06,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2076838099, now seen corresponding path program 1 times [2023-12-19 11:39:06,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:39:06,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028929967] [2023-12-19 11:39:06,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:39:06,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:39:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 11:39:06,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 11:39:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 11:39:06,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 11:39:06,324 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 11:39:06,326 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 11:39:06,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 11:39:06,329 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-19 11:39:06,332 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 11:39:06,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 11:39:06 BoogieIcfgContainer [2023-12-19 11:39:06,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 11:39:06,392 INFO L158 Benchmark]: Toolchain (without parser) took 1370.50ms. Allocated memory was 226.5MB in the beginning and 359.7MB in the end (delta: 133.2MB). Free memory was 158.6MB in the beginning and 260.2MB in the end (delta: -101.6MB). Peak memory consumption was 32.0MB. Max. memory is 8.0GB. [2023-12-19 11:39:06,392 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 226.5MB. Free memory is still 173.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 11:39:06,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.62ms. Allocated memory is still 226.5MB. Free memory was 158.4MB in the beginning and 145.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-19 11:39:06,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.35ms. Allocated memory was 226.5MB in the beginning and 359.7MB in the end (delta: 133.2MB). Free memory was 145.5MB in the beginning and 323.5MB in the end (delta: -178.0MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. [2023-12-19 11:39:06,394 INFO L158 Benchmark]: Boogie Preprocessor took 40.27ms. Allocated memory is still 359.7MB. Free memory was 323.5MB in the beginning and 321.2MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 11:39:06,394 INFO L158 Benchmark]: RCFGBuilder took 376.95ms. Allocated memory is still 359.7MB. Free memory was 321.1MB in the beginning and 314.7MB in the end (delta: 6.4MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2023-12-19 11:39:06,394 INFO L158 Benchmark]: TraceAbstraction took 705.72ms. Allocated memory is still 359.7MB. Free memory was 314.2MB in the beginning and 260.2MB in the end (delta: 54.0MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. [2023-12-19 11:39:06,396 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.09ms. Allocated memory is still 226.5MB. Free memory is still 173.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.62ms. Allocated memory is still 226.5MB. Free memory was 158.4MB in the beginning and 145.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.35ms. Allocated memory was 226.5MB in the beginning and 359.7MB in the end (delta: 133.2MB). Free memory was 145.5MB in the beginning and 323.5MB in the end (delta: -178.0MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.27ms. Allocated memory is still 359.7MB. Free memory was 323.5MB in the beginning and 321.2MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 376.95ms. Allocated memory is still 359.7MB. Free memory was 321.1MB in the beginning and 314.7MB in the end (delta: 6.4MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. * TraceAbstraction took 705.72ms. Allocated memory is still 359.7MB. Free memory was 314.2MB in the beginning and 260.2MB in the end (delta: 54.0MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryArithmeticDOUBLEoperation at line 38. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -1; [L23] signed short int var_1_4 = 1; [L24] signed short int var_1_5 = -10; [L25] double var_1_6 = 10.4; [L26] double var_1_7 = 100000000000000.2; [L27] double var_1_8 = 99.4; [L28] double var_1_9 = 49.825; [L29] unsigned short int var_1_10 = 50; [L30] unsigned char var_1_11 = 0; [L31] double var_1_12 = 4.3; [L32] double var_1_13 = 2.875; [L33] unsigned short int var_1_14 = 64; [L34] unsigned short int var_1_15 = 50; [L96] isInitial = 1 [L97] FCALL initially() [L98] int k_loop; [L99] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=1, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L99] COND TRUE k_loop < 1 [L100] FCALL updateLastVariables() [L101] CALL updateVariables() [L61] var_1_4 = __VERIFIER_nondet_short() [L62] CALL assume_abort_if_not(var_1_4 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L62] RET assume_abort_if_not(var_1_4 >= -32767) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L63] CALL assume_abort_if_not(var_1_4 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L63] RET assume_abort_if_not(var_1_4 <= 32766) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L64] var_1_5 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_5 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L65] RET assume_abort_if_not(var_1_5 >= -32767) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L66] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L66] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L67] var_1_7 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5, var_1_8=497/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5, var_1_8=497/5, var_1_9=1993/40] [L68] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5, var_1_8=497/5, var_1_9=1993/40] [L69] var_1_8 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5, var_1_9=1993/40] [L70] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5, var_1_9=1993/40] [L71] var_1_9 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_9 >= 0.0F && 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_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L72] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L73] var_1_11 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=50, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L74] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=50, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L75] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L75] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L76] var_1_12 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L77] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L78] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L78] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L79] var_1_13 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L80] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L81] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L81] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L82] var_1_14 = __VERIFIER_nondet_ushort() [L83] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L83] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L84] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=65534, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=65534, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L84] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=65534, var_1_15=50, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L85] var_1_15 = __VERIFIER_nondet_ushort() [L86] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=65534, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=65534, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L86] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=65534, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L87] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=65534, var_1_15=65534, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=65534, var_1_15=65534, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L87] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=65534, var_1_15=65534, var_1_1=-1, var_1_4=-2, var_1_5=-1, var_1_6=52/5] [L101] RET updateVariables() [L102] CALL step() [L38] var_1_6 = (var_1_7 - (var_1_8 + var_1_9)) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=65534, var_1_15=65534, var_1_1=-1, var_1_4=-2, var_1_5=-1] [L39] COND TRUE var_1_6 > var_1_6 [L40] var_1_1 = ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=65534, var_1_15=65534, var_1_1=-1, var_1_4=-2, var_1_5=-1] [L44] signed long int stepLocal_1 = 100; [L45] unsigned char stepLocal_0 = var_1_8 <= (var_1_7 + var_1_9); VAL [isInitial=1, stepLocal_0=0, stepLocal_1=100, var_1_10=50, var_1_11=0, var_1_14=65534, var_1_15=65534, var_1_1=-1, var_1_4=-2, var_1_5=-1] [L46] COND FALSE !(var_1_11 || stepLocal_0) VAL [isInitial=1, stepLocal_0=0, stepLocal_1=100, var_1_10=50, var_1_11=0, var_1_14=65534, var_1_15=65534, var_1_1=-1, var_1_4=-2, var_1_5=-1] [L102] RET step() [L103] CALL, EXPR property() [L92-L93] return (((var_1_6 > var_1_6) ? (var_1_1 == ((signed short int) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : (var_1_1 == ((signed short int) ((((-4) < (var_1_5)) ? (-4) : (var_1_5)))))) && (var_1_6 == ((double) (var_1_7 - (var_1_8 + var_1_9))))) && ((var_1_11 || (var_1_8 <= (var_1_7 + var_1_9))) ? ((((var_1_7 + var_1_6) / ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13)))) <= var_1_9) ? ((var_1_6 > 2.5) ? ((100 > var_1_1) ? (var_1_10 == ((unsigned short int) var_1_14)) : (var_1_10 == ((unsigned short int) var_1_15))) : (var_1_10 == ((unsigned short int) var_1_14))) : 1) : 1) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=65534, var_1_15=65534, var_1_1=-1, var_1_4=-2, var_1_5=-1] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=65534, var_1_15=65534, var_1_1=-1, var_1_4=-2, var_1_5=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 17, 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, 62 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 62 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred 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.1s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 544/544 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-19 11:39:06,418 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...