./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8b70edc51f7e2052ea5af42ef22b470e7ca8ff27d9c5bbc8f8b46c1568f3646 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:51:39,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:51:39,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:51:39,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:51:39,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:51:39,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:51:39,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:51:39,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:51:39,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:51:39,218 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:51:39,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:51:39,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:51:39,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:51:39,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:51:39,220 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:51:39,220 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:51:39,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:51:39,221 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:51:39,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:51:39,221 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:51:39,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:51:39,222 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:51:39,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:51:39,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:51:39,223 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:51:39,223 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:51:39,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:51:39,224 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:51:39,224 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:51:39,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:51:39,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:51:39,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:51:39,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:51:39,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:51:39,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:51:39,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:51:39,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:51:39,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:51:39,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:51:39,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:51:39,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:51:39,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:51:39,228 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a8b70edc51f7e2052ea5af42ef22b470e7ca8ff27d9c5bbc8f8b46c1568f3646 [2024-11-10 07:51:39,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:51:39,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:51:39,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:51:39,436 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:51:39,436 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:51:39,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i [2024-11-10 07:51:40,933 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:51:41,098 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:51:41,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i [2024-11-10 07:51:41,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3cb4e2d8/4dd5d06ad1e64155adeb83b4d1a8c8d5/FLAGb1f22adab [2024-11-10 07:51:41,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3cb4e2d8/4dd5d06ad1e64155adeb83b4d1a8c8d5 [2024-11-10 07:51:41,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:51:41,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:51:41,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:51:41,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:51:41,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:51:41,142 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:51:41" (1/1) ... [2024-11-10 07:51:41,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@320a4868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:41, skipping insertion in model container [2024-11-10 07:51:41,143 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:51:41" (1/1) ... [2024-11-10 07:51:41,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:51:41,341 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i[915,928] [2024-11-10 07:51:41,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:51:41,428 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:51:41,441 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i[915,928] [2024-11-10 07:51:41,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:51:41,499 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:51:41,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:41 WrapperNode [2024-11-10 07:51:41,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:51:41,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:51:41,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:51:41,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:51:41,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:41" (1/1) ... [2024-11-10 07:51:41,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:41" (1/1) ... [2024-11-10 07:51:41,581 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-11-10 07:51:41,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:51:41,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:51:41,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:51:41,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:51:41,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:41" (1/1) ... [2024-11-10 07:51:41,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:41" (1/1) ... [2024-11-10 07:51:41,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:41" (1/1) ... [2024-11-10 07:51:41,621 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]. [2024-11-10 07:51:41,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:41" (1/1) ... [2024-11-10 07:51:41,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:41" (1/1) ... [2024-11-10 07:51:41,628 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:41" (1/1) ... [2024-11-10 07:51:41,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:41" (1/1) ... [2024-11-10 07:51:41,630 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:41" (1/1) ... [2024-11-10 07:51:41,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:41" (1/1) ... [2024-11-10 07:51:41,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:51:41,634 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:51:41,634 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:51:41,634 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:51:41,635 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:41" (1/1) ... [2024-11-10 07:51:41,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:51:41,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:51:41,684 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) [2024-11-10 07:51:41,687 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 [2024-11-10 07:51:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:51:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:51:41,736 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:51:41,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:51:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:51:41,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:51:41,848 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:51:41,851 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:51:42,136 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-10 07:51:42,136 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:51:42,152 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:51:42,153 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:51:42,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:51:42 BoogieIcfgContainer [2024-11-10 07:51:42,154 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:51:42,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:51:42,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:51:42,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:51:42,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:51:41" (1/3) ... [2024-11-10 07:51:42,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9dcdff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:51:42, skipping insertion in model container [2024-11-10 07:51:42,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:41" (2/3) ... [2024-11-10 07:51:42,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9dcdff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:51:42, skipping insertion in model container [2024-11-10 07:51:42,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:51:42" (3/3) ... [2024-11-10 07:51:42,167 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-82.i [2024-11-10 07:51:42,183 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:51:42,184 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:51:42,235 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:51:42,240 INFO L333 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, 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;@50ad947, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:51:42,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:51:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 43 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 07:51:42,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 07:51:42,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:51:42,253 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:51:42,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:51:42,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:51:42,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1130679483, now seen corresponding path program 1 times [2024-11-10 07:51:42,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:51:42,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319972020] [2024-11-10 07:51:42,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:51:42,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:51:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:42,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:51:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:42,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 07:51:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:42,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 07:51:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:42,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 07:51:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:42,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 07:51:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:42,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:51:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:42,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 07:51:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:42,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:51:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:42,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 07:51:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:42,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:51:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:42,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:51:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:42,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:51:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:42,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 07:51:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:42,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 07:51:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:42,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 07:51:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:42,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 07:51:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:42,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 07:51:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:42,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:51:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:42,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:51:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:42,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:51:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:51:42,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:51:42,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319972020] [2024-11-10 07:51:42,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319972020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:51:42,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:51:42,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:51:42,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639350925] [2024-11-10 07:51:42,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:51:42,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:51:42,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:51:42,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:51:42,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:51:42,622 INFO L87 Difference]: Start difference. First operand has 65 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 43 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 07:51:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:51:42,649 INFO L93 Difference]: Finished difference Result 126 states and 206 transitions. [2024-11-10 07:51:42,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:51:42,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 130 [2024-11-10 07:51:42,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:51:42,659 INFO L225 Difference]: With dead ends: 126 [2024-11-10 07:51:42,659 INFO L226 Difference]: Without dead ends: 60 [2024-11-10 07:51:42,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:51:42,666 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:51:42,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:51:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-10 07:51:42,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-10 07:51:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 07:51:42,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2024-11-10 07:51:42,713 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 130 [2024-11-10 07:51:42,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:51:42,713 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2024-11-10 07:51:42,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 07:51:42,714 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2024-11-10 07:51:42,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 07:51:42,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:51:42,718 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:51:42,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:51:42,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:51:42,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:51:42,720 INFO L85 PathProgramCache]: Analyzing trace with hash 960539831, now seen corresponding path program 1 times [2024-11-10 07:51:42,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:51:42,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408098855] [2024-11-10 07:51:42,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:51:42,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:51:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:51:42,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:51:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:51:43,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:51:43,055 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:51:43,057 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:51:43,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:51:43,062 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 07:51:43,181 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:51:43,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:51:43 BoogieIcfgContainer [2024-11-10 07:51:43,186 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:51:43,186 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:51:43,187 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:51:43,187 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:51:43,188 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:51:42" (3/4) ... [2024-11-10 07:51:43,190 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:51:43,191 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:51:43,192 INFO L158 Benchmark]: Toolchain (without parser) took 2061.37ms. Allocated memory is still 178.3MB. Free memory was 107.2MB in the beginning and 139.4MB in the end (delta: -32.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:51:43,193 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 178.3MB. Free memory was 133.5MB in the beginning and 133.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:51:43,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.08ms. Allocated memory is still 178.3MB. Free memory was 107.1MB in the beginning and 147.7MB in the end (delta: -40.6MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2024-11-10 07:51:43,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.29ms. Allocated memory is still 178.3MB. Free memory was 147.7MB in the beginning and 145.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 07:51:43,194 INFO L158 Benchmark]: Boogie Preprocessor took 50.32ms. Allocated memory is still 178.3MB. Free memory was 145.3MB in the beginning and 142.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 07:51:43,194 INFO L158 Benchmark]: IcfgBuilder took 519.89ms. Allocated memory is still 178.3MB. Free memory was 142.5MB in the beginning and 124.3MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 07:51:43,194 INFO L158 Benchmark]: TraceAbstraction took 1026.55ms. Allocated memory is still 178.3MB. Free memory was 123.6MB in the beginning and 139.4MB in the end (delta: -15.8MB). Peak memory consumption was 76.1MB. Max. memory is 16.1GB. [2024-11-10 07:51:43,195 INFO L158 Benchmark]: Witness Printer took 4.94ms. Allocated memory is still 178.3MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:51:43,199 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.18ms. Allocated memory is still 178.3MB. Free memory was 133.5MB in the beginning and 133.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.08ms. Allocated memory is still 178.3MB. Free memory was 107.1MB in the beginning and 147.7MB in the end (delta: -40.6MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.29ms. Allocated memory is still 178.3MB. Free memory was 147.7MB in the beginning and 145.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.32ms. Allocated memory is still 178.3MB. Free memory was 145.3MB in the beginning and 142.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 519.89ms. Allocated memory is still 178.3MB. Free memory was 142.5MB in the beginning and 124.3MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1026.55ms. Allocated memory is still 178.3MB. Free memory was 123.6MB in the beginning and 139.4MB in the end (delta: -15.8MB). Peak memory consumption was 76.1MB. Max. memory is 16.1GB. * Witness Printer took 4.94ms. Allocated memory is still 178.3MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. * 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 127, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryArithmeticDOUBLEoperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 10.8; [L23] double var_1_4 = 5.5; [L24] float var_1_5 = 49.2; [L25] double var_1_7 = 49.5; [L26] double var_1_8 = 999999999999.4; [L27] double var_1_9 = 255.3; [L28] unsigned char var_1_10 = 1; [L29] unsigned char var_1_11 = 0; [L30] unsigned char var_1_13 = 1; [L31] signed long int var_1_14 = -16; [L32] signed long int var_1_15 = 25; [L33] signed long int var_1_16 = -8; [L34] signed long int var_1_17 = 1000000000; [L35] signed long int var_1_18 = 256; [L36] signed long int var_1_19 = 25; [L37] signed long int var_1_20 = 4; [L38] unsigned char var_1_21 = 1; [L39] unsigned char var_1_22 = 0; [L40] signed long int var_1_23 = 50; [L41] double last_1_var_1_7 = 49.5; [L42] signed long int last_1_var_1_14 = -16; [L43] signed long int last_1_var_1_23 = 50; VAL [isInitial=0, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_4=11/2, var_1_5=246/5, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L131] isInitial = 1 [L132] FCALL initially() [L133] int k_loop; [L134] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_4=11/2, var_1_5=246/5, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L134] COND TRUE k_loop < 1 [L135] CALL updateLastVariables() [L122] last_1_var_1_7 = var_1_7 [L123] last_1_var_1_14 = var_1_14 [L124] last_1_var_1_23 = var_1_23 VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_4=11/2, var_1_5=246/5, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L135] RET updateLastVariables() [L136] CALL updateVariables() [L88] var_1_4 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_5=246/5, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_5=246/5, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L89] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_5=246/5, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L90] var_1_5 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L91] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L92] var_1_8 = __VERIFIER_nondet_double() [L93] 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, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_9=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_9=2553/10] [L93] 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, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_9=2553/10] [L94] var_1_9 = __VERIFIER_nondet_double() [L95] 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, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L95] 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, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L96] var_1_11 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L97] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L98] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L98] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L99] var_1_13 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L100] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L101] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L101] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L102] var_1_15 = __VERIFIER_nondet_long() [L103] CALL assume_abort_if_not(var_1_15 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L103] RET assume_abort_if_not(var_1_15 >= -1073741823) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L104] CALL assume_abort_if_not(var_1_15 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L104] RET assume_abort_if_not(var_1_15 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L105] var_1_17 = __VERIFIER_nondet_long() [L106] CALL assume_abort_if_not(var_1_17 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L106] RET assume_abort_if_not(var_1_17 >= 536870911) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L107] CALL assume_abort_if_not(var_1_17 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L107] RET assume_abort_if_not(var_1_17 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L108] var_1_18 = __VERIFIER_nondet_long() [L109] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L109] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L110] CALL assume_abort_if_not(var_1_18 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L110] RET assume_abort_if_not(var_1_18 <= 536870911) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L111] var_1_19 = __VERIFIER_nondet_long() [L112] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L112] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L113] CALL assume_abort_if_not(var_1_19 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L113] RET assume_abort_if_not(var_1_19 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L114] var_1_20 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_1=54/5, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_1=54/5, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L115] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_1=54/5, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L116] CALL assume_abort_if_not(var_1_20 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_1=54/5, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_1=54/5, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L116] RET assume_abort_if_not(var_1_20 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_1=54/5, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L117] var_1_22 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_1=54/5, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_1=54/5, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L118] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_1=54/5, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L119] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_1=54/5, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_1=54/5, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L119] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_1=54/5, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L136] RET updateVariables() [L137] CALL step() [L47] var_1_23 = last_1_var_1_14 [L48] var_1_7 = (var_1_4 - (var_1_8 + var_1_9)) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_1=54/5, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=-16] [L49] COND TRUE var_1_8 <= (((((var_1_5 * 1.25)) > ((last_1_var_1_7 * var_1_9))) ? ((var_1_5 * 1.25)) : ((last_1_var_1_7 * var_1_9)))) [L50] var_1_16 = ((((((last_1_var_1_23) < 0 ) ? -(last_1_var_1_23) : (last_1_var_1_23))) + last_1_var_1_23) + ((var_1_17 - var_1_18) - ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20))))) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-16, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_1=54/5, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=-16] [L56] signed long int stepLocal_0 = var_1_23; VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, stepLocal_0=-16, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-16, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_1=54/5, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=-16] [L57] COND TRUE stepLocal_0 == var_1_16 [L58] var_1_1 = (var_1_4 - 4.531) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-16, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=-16] [L66] signed long int stepLocal_1 = (50 / -10) + var_1_23; VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, stepLocal_1=-21, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-16, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=-16] [L67] COND FALSE !(stepLocal_1 >= var_1_16) [L74] var_1_21 = var_1_11 VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-16, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_20=0, var_1_21=-255, var_1_22=1, var_1_23=-16] [L76] var_1_10 = (var_1_11 && (var_1_21 || var_1_13)) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-16, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_20=0, var_1_21=-255, var_1_22=1, var_1_23=-16] [L77] COND FALSE !(var_1_8 <= ((((var_1_4) > ((var_1_1 + var_1_5))) ? (var_1_4) : ((var_1_1 + var_1_5))))) [L84] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-16, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_20=0, var_1_21=-255, var_1_22=1, var_1_23=-16] [L137] RET step() [L138] CALL, EXPR property() [L127-L128] return (((((((var_1_23 == var_1_16) ? (var_1_1 == ((double) (var_1_4 - 4.531))) : (((var_1_4 - var_1_5) > var_1_7) ? (var_1_1 == ((double) var_1_4)) : (var_1_1 == ((double) var_1_4)))) && (var_1_7 == ((double) (var_1_4 - (var_1_8 + var_1_9))))) && (var_1_10 == ((unsigned char) (var_1_11 && (var_1_21 || var_1_13))))) && ((var_1_8 <= ((((var_1_4) > ((var_1_1 + var_1_5))) ? (var_1_4) : ((var_1_1 + var_1_5))))) ? (var_1_10 ? (var_1_14 == ((signed long int) (var_1_15 + (8 + var_1_16)))) : (var_1_14 == ((signed long int) -256))) : (var_1_14 == ((signed long int) var_1_16)))) && ((var_1_8 <= (((((var_1_5 * 1.25)) > ((last_1_var_1_7 * var_1_9))) ? ((var_1_5 * 1.25)) : ((last_1_var_1_7 * var_1_9))))) ? (var_1_16 == ((signed long int) ((((((last_1_var_1_23) < 0 ) ? -(last_1_var_1_23) : (last_1_var_1_23))) + last_1_var_1_23) + ((var_1_17 - var_1_18) - ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20))))))) : ((var_1_4 <= last_1_var_1_7) ? (var_1_16 == ((signed long int) var_1_17)) : 1))) && ((((50 / -10) + var_1_23) >= var_1_16) ? (var_1_13 ? (var_1_21 == ((unsigned char) (var_1_11 && var_1_22))) : (var_1_21 == ((unsigned char) var_1_11))) : (var_1_21 == ((unsigned char) var_1_11)))) && (var_1_23 == ((signed long int) last_1_var_1_14)) ; VAL [\result=0, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-16, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_20=0, var_1_21=-255, var_1_22=1, var_1_23=-16] [L138] RET, EXPR property() [L138] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-16, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_20=0, var_1_21=-255, var_1_22=1, var_1_23=-16] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-16, var_1_17=1073741823, var_1_18=116, var_1_19=1073741823, var_1_20=0, var_1_21=-255, var_1_22=1, var_1_23=-16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 20, 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, 91 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 91 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 129 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 760/760 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 [2024-11-10 07:51:43,240 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8b70edc51f7e2052ea5af42ef22b470e7ca8ff27d9c5bbc8f8b46c1568f3646 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:51:45,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:51:45,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:51:45,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:51:45,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:51:45,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:51:45,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:51:45,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:51:45,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:51:45,686 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:51:45,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:51:45,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:51:45,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:51:45,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:51:45,688 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:51:45,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:51:45,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:51:45,690 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:51:45,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:51:45,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:51:45,691 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:51:45,691 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:51:45,691 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:51:45,692 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:51:45,692 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:51:45,692 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:51:45,693 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:51:45,693 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:51:45,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:51:45,693 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:51:45,694 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:51:45,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:51:45,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:51:45,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:51:45,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:51:45,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:51:45,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:51:45,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:51:45,696 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:51:45,696 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:51:45,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:51:45,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:51:45,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:51:45,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:51:45,697 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a8b70edc51f7e2052ea5af42ef22b470e7ca8ff27d9c5bbc8f8b46c1568f3646 [2024-11-10 07:51:46,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:51:46,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:51:46,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:51:46,070 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:51:46,070 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:51:46,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i [2024-11-10 07:51:47,612 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:51:47,847 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:51:47,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i [2024-11-10 07:51:47,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4022255c/d8bee796f96248efbf697b10112b49fb/FLAGd48f6ea57 [2024-11-10 07:51:47,866 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4022255c/d8bee796f96248efbf697b10112b49fb [2024-11-10 07:51:47,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:51:47,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:51:47,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:51:47,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:51:47,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:51:47,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:51:47" (1/1) ... [2024-11-10 07:51:47,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3117f6cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:47, skipping insertion in model container [2024-11-10 07:51:47,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:51:47" (1/1) ... [2024-11-10 07:51:47,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:51:48,070 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i[915,928] [2024-11-10 07:51:48,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:51:48,166 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:51:48,178 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i[915,928] [2024-11-10 07:51:48,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:51:48,241 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:51:48,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:48 WrapperNode [2024-11-10 07:51:48,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:51:48,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:51:48,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:51:48,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:51:48,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:48" (1/1) ... [2024-11-10 07:51:48,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:48" (1/1) ... [2024-11-10 07:51:48,302 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2024-11-10 07:51:48,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:51:48,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:51:48,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:51:48,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:51:48,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:48" (1/1) ... [2024-11-10 07:51:48,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:48" (1/1) ... [2024-11-10 07:51:48,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:48" (1/1) ... [2024-11-10 07:51:48,348 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]. [2024-11-10 07:51:48,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:48" (1/1) ... [2024-11-10 07:51:48,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:48" (1/1) ... [2024-11-10 07:51:48,356 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:48" (1/1) ... [2024-11-10 07:51:48,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:48" (1/1) ... [2024-11-10 07:51:48,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:48" (1/1) ... [2024-11-10 07:51:48,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:48" (1/1) ... [2024-11-10 07:51:48,363 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:51:48,364 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:51:48,364 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:51:48,365 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:51:48,365 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:48" (1/1) ... [2024-11-10 07:51:48,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:51:48,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:51:48,409 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) [2024-11-10 07:51:48,414 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 [2024-11-10 07:51:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:51:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:51:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:51:48,456 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:51:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:51:48,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:51:48,534 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:51:48,539 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:52:03,123 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-10 07:52:03,123 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:52:03,137 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:52:03,137 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:52:03,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:52:03 BoogieIcfgContainer [2024-11-10 07:52:03,137 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:52:03,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:52:03,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:52:03,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:52:03,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:51:47" (1/3) ... [2024-11-10 07:52:03,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d40a104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:52:03, skipping insertion in model container [2024-11-10 07:52:03,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:48" (2/3) ... [2024-11-10 07:52:03,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d40a104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:52:03, skipping insertion in model container [2024-11-10 07:52:03,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:52:03" (3/3) ... [2024-11-10 07:52:03,143 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-82.i [2024-11-10 07:52:03,155 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:52:03,156 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:52:03,199 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:52:03,204 INFO L333 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, 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;@55c695b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:52:03,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:52:03,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 43 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 07:52:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 07:52:03,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:52:03,228 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:52:03,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:52:03,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:52:03,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1130679483, now seen corresponding path program 1 times [2024-11-10 07:52:03,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:52:03,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377298478] [2024-11-10 07:52:03,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:52:03,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:52:03,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:52:03,245 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:52:03,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 07:52:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:03,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:52:03,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:52:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-10 07:52:03,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:52:03,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:52:03,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377298478] [2024-11-10 07:52:03,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377298478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:52:03,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:52:03,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:52:03,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990727052] [2024-11-10 07:52:03,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:52:03,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:52:03,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:52:03,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:52:03,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:52:03,988 INFO L87 Difference]: Start difference. First operand has 65 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 43 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:52:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:52:04,013 INFO L93 Difference]: Finished difference Result 126 states and 206 transitions. [2024-11-10 07:52:04,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:52:04,015 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2024-11-10 07:52:04,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:52:04,020 INFO L225 Difference]: With dead ends: 126 [2024-11-10 07:52:04,020 INFO L226 Difference]: Without dead ends: 60 [2024-11-10 07:52:04,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:52:04,025 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:52:04,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:52:04,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-10 07:52:04,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-10 07:52:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 07:52:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2024-11-10 07:52:04,058 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 130 [2024-11-10 07:52:04,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:52:04,059 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2024-11-10 07:52:04,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:52:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2024-11-10 07:52:04,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 07:52:04,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:52:04,064 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:52:04,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 07:52:04,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:52:04,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:52:04,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:52:04,266 INFO L85 PathProgramCache]: Analyzing trace with hash 960539831, now seen corresponding path program 1 times [2024-11-10 07:52:04,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:52:04,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1811321827] [2024-11-10 07:52:04,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:52:04,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:52:04,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:52:04,270 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:52:04,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 07:52:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:05,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-10 07:52:05,497 INFO L278 TraceCheckSpWp]: Computing forward predicates...