./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-65.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_25-1loop_file-65.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 9167d3514d92876f080e6f73b391286588106b09c0456cd9b66d9fc0d1e7cefe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:27:35,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:27:35,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:27:35,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:27:35,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:27:35,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:27:35,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:27:35,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:27:35,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:27:35,407 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:27:35,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:27:35,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:27:35,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:27:35,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:27:35,408 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:27:35,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:27:35,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:27:35,414 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:27:35,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:27:35,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:27:35,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:27:35,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:27:35,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:27:35,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:27:35,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:27:35,416 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:27:35,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:27:35,417 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:27:35,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:27:35,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:27:35,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:27:35,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:27:35,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:27:35,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:27:35,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:27:35,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:27:35,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:27:35,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:27:35,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:27:35,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:27:35,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:27:35,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:27:35,422 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 -> 9167d3514d92876f080e6f73b391286588106b09c0456cd9b66d9fc0d1e7cefe [2024-11-10 07:27:35,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:27:35,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:27:35,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:27:35,683 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:27:35,683 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:27:35,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-65.i [2024-11-10 07:27:37,149 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:27:37,372 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:27:37,373 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-65.i [2024-11-10 07:27:37,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f0083cd2/57c433506aa64df4a75bf79addca338e/FLAGa8dd704cd [2024-11-10 07:27:37,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f0083cd2/57c433506aa64df4a75bf79addca338e [2024-11-10 07:27:37,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:27:37,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:27:37,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:27:37,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:27:37,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:27:37,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:27:37" (1/1) ... [2024-11-10 07:27:37,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f9aacc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:37, skipping insertion in model container [2024-11-10 07:27:37,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:27:37" (1/1) ... [2024-11-10 07:27:37,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:27:37,612 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_25-1loop_file-65.i[915,928] [2024-11-10 07:27:37,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:27:37,690 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:27:37,701 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_25-1loop_file-65.i[915,928] [2024-11-10 07:27:37,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:27:37,738 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:27:37,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:37 WrapperNode [2024-11-10 07:27:37,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:27:37,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:27:37,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:27:37,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:27:37,748 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:27:37" (1/1) ... [2024-11-10 07:27:37,760 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:27:37" (1/1) ... [2024-11-10 07:27:37,781 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-10 07:27:37,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:27:37,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:27:37,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:27:37,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:27:37,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:37" (1/1) ... [2024-11-10 07:27:37,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:37" (1/1) ... [2024-11-10 07:27:37,797 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:37" (1/1) ... [2024-11-10 07:27:37,810 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:27:37,811 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:37" (1/1) ... [2024-11-10 07:27:37,811 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:37" (1/1) ... [2024-11-10 07:27:37,829 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:37" (1/1) ... [2024-11-10 07:27:37,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:37" (1/1) ... [2024-11-10 07:27:37,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:37" (1/1) ... [2024-11-10 07:27:37,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:37" (1/1) ... [2024-11-10 07:27:37,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:27:37,841 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:27:37,842 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:27:37,842 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:27:37,843 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:37" (1/1) ... [2024-11-10 07:27:37,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:27:37,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:27:37,885 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:27:37,891 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:27:37,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:27:37,949 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:27:37,950 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:27:37,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:27:37,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:27:37,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:27:38,048 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:27:38,050 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:27:38,325 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-10 07:27:38,326 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:27:38,339 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:27:38,339 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:27:38,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:27:38 BoogieIcfgContainer [2024-11-10 07:27:38,340 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:27:38,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:27:38,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:27:38,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:27:38,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:27:37" (1/3) ... [2024-11-10 07:27:38,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed6c3eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:27:38, skipping insertion in model container [2024-11-10 07:27:38,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:37" (2/3) ... [2024-11-10 07:27:38,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed6c3eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:27:38, skipping insertion in model container [2024-11-10 07:27:38,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:27:38" (3/3) ... [2024-11-10 07:27:38,347 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-65.i [2024-11-10 07:27:38,361 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:27:38,361 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:27:38,415 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:27:38,421 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;@2837997f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:27:38,421 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:27:38,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 07:27:38,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 07:27:38,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:27:38,435 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:27:38,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:27:38,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:27:38,441 INFO L85 PathProgramCache]: Analyzing trace with hash 146647179, now seen corresponding path program 1 times [2024-11-10 07:27:38,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:27:38,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664845425] [2024-11-10 07:27:38,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:27:38,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:27:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:27:38,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:27:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:27:38,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 07:27:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:27:38,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:27:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:27:38,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 07:27:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:27:38,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:27:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:27:38,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 07:27:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:27:38,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:27:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:27:38,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:27:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:27:38,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:27:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:27:38,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:27:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:27:38,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:27:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:27:38,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:27:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:27:38,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:27:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:27:38,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 07:27:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:27:38,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 07:27:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:27:38,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:27:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:27:38,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 07:27:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:27:38,818 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 07:27:38,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:27:38,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664845425] [2024-11-10 07:27:38,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664845425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:27:38,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:27:38,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:27:38,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937491448] [2024-11-10 07:27:38,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:27:38,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:27:38,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:27:38,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:27:38,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:27:38,848 INFO L87 Difference]: Start difference. First operand has 57 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 07:27:38,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:27:38,873 INFO L93 Difference]: Finished difference Result 110 states and 177 transitions. [2024-11-10 07:27:38,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:27:38,876 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 112 [2024-11-10 07:27:38,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:27:38,881 INFO L225 Difference]: With dead ends: 110 [2024-11-10 07:27:38,881 INFO L226 Difference]: Without dead ends: 52 [2024-11-10 07:27:38,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:27:38,888 INFO L432 NwaCegarLoop]: 78 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, 78 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:27:38,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:27:38,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-10 07:27:38,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-10 07:27:38,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 07:27:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-11-10 07:27:38,940 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 112 [2024-11-10 07:27:38,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:27:38,941 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-11-10 07:27:38,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 07:27:38,942 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-11-10 07:27:38,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 07:27:38,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:27:38,946 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:27:38,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:27:38,946 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:27:38,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:27:38,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1663195282, now seen corresponding path program 1 times [2024-11-10 07:27:38,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:27:38,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819182233] [2024-11-10 07:27:38,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:27:38,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:27:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:27:39,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:27:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:27:39,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:27:39,258 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:27:39,263 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:27:39,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:27:39,269 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 07:27:39,358 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:27:39,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:27:39 BoogieIcfgContainer [2024-11-10 07:27:39,364 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:27:39,365 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:27:39,365 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:27:39,365 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:27:39,365 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:27:38" (3/4) ... [2024-11-10 07:27:39,367 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:27:39,369 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:27:39,369 INFO L158 Benchmark]: Toolchain (without parser) took 1967.95ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 97.1MB in the beginning and 102.2MB in the end (delta: -5.0MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2024-11-10 07:27:39,370 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 153.1MB. Free memory was 112.2MB in the beginning and 112.1MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:27:39,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.92ms. Allocated memory is still 153.1MB. Free memory was 96.8MB in the beginning and 82.5MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 07:27:39,371 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.78ms. Allocated memory is still 153.1MB. Free memory was 82.5MB in the beginning and 80.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 07:27:39,371 INFO L158 Benchmark]: Boogie Preprocessor took 56.47ms. Allocated memory is still 153.1MB. Free memory was 80.4MB in the beginning and 123.7MB in the end (delta: -43.3MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-11-10 07:27:39,372 INFO L158 Benchmark]: IcfgBuilder took 498.43ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 123.6MB in the beginning and 164.0MB in the end (delta: -40.4MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2024-11-10 07:27:39,372 INFO L158 Benchmark]: TraceAbstraction took 1023.05ms. Allocated memory is still 205.5MB. Free memory was 163.0MB in the beginning and 102.2MB in the end (delta: 60.8MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-11-10 07:27:39,372 INFO L158 Benchmark]: Witness Printer took 3.88ms. Allocated memory is still 205.5MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:27:39,375 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.20ms. Allocated memory is still 153.1MB. Free memory was 112.2MB in the beginning and 112.1MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.92ms. Allocated memory is still 153.1MB. Free memory was 96.8MB in the beginning and 82.5MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.78ms. Allocated memory is still 153.1MB. Free memory was 82.5MB in the beginning and 80.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.47ms. Allocated memory is still 153.1MB. Free memory was 80.4MB in the beginning and 123.7MB in the end (delta: -43.3MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * IcfgBuilder took 498.43ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 123.6MB in the beginning and 164.0MB in the end (delta: -40.4MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1023.05ms. Allocated memory is still 205.5MB. Free memory was 163.0MB in the beginning and 102.2MB in the end (delta: 60.8MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Witness Printer took 3.88ms. Allocated memory is still 205.5MB. Free memory is still 102.2MB. 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 someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someUnaryFLOAToperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 1000000000.1; [L23] float var_1_2 = 256.75; [L24] unsigned char var_1_3 = 1; [L25] float var_1_4 = 8.2; [L26] signed long int var_1_5 = -32; [L27] signed long int var_1_6 = 4; [L28] signed char var_1_7 = 5; [L29] signed char var_1_8 = 64; [L30] signed char var_1_9 = 16; [L31] signed char var_1_10 = 64; [L32] signed char var_1_11 = -64; [L33] double var_1_12 = 15.9; [L34] double var_1_13 = 1.5; [L35] double var_1_14 = 10000000000.375; [L36] unsigned char var_1_15 = 1; VAL [isInitial=0, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_2=1027/4, var_1_3=1, var_1_4=41/5, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L99] isInitial = 1 [L100] FCALL initially() [L101] int k_loop; [L102] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_2=1027/4, var_1_3=1, var_1_4=41/5, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L102] COND TRUE k_loop < 1 [L103] FCALL updateLastVariables() [L104] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_float() [L64] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_4=41/5, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_4=41/5, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L64] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_4=41/5, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L65] var_1_3 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_4=41/5, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_4=41/5, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L66] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_4=41/5, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L67] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_4=41/5, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_4=41/5, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L67] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_4=41/5, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L68] var_1_4 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L69] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L70] var_1_6 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=16] [L71] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=16] [L72] CALL assume_abort_if_not(var_1_6 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=16] [L72] RET assume_abort_if_not(var_1_6 <= 1073741823) VAL [isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=16] [L73] var_1_8 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_8 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=16] [L74] RET assume_abort_if_not(var_1_8 >= 63) VAL [isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=16] [L75] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=16] [L75] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=16] [L76] var_1_9 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L77] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L78] CALL assume_abort_if_not(var_1_9 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L78] RET assume_abort_if_not(var_1_9 <= 63) VAL [isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L79] var_1_10 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L80] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L81] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L81] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L82] var_1_12 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L83] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L84] var_1_13 = __VERIFIER_nondet_double() [L85] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427387900e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L85] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427387900e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L86] var_1_14 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427387900e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L87] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427387900e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L88] var_1_15 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L89] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L90] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L90] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L104] RET updateVariables() [L105] CALL step() [L40] COND FALSE !(0.625f > var_1_2) [L45] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000005, var_1_3=1, var_1_4=10000000005, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L47] COND TRUE \read(var_1_3) [L48] var_1_5 = ((10 + var_1_6) - 2) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000005, var_1_3=1, var_1_4=10000000005, var_1_5=8, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L50] signed long int stepLocal_0 = var_1_6; VAL [isInitial=1, stepLocal_0=0, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000005, var_1_3=1, var_1_4=10000000005, var_1_5=8, var_1_6=0, var_1_7=5, var_1_8=75, var_1_9=36] [L51] COND TRUE ((64 - 25) - (var_1_8 - var_1_9)) >= stepLocal_0 [L52] var_1_7 = (((((var_1_9 - 32)) > (var_1_10)) ? ((var_1_9 - 32)) : (var_1_10))) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000005, var_1_3=1, var_1_4=10000000005, var_1_5=8, var_1_6=0, var_1_7=4, var_1_8=75, var_1_9=36] [L54] COND FALSE !((var_1_12 - (var_1_13 + var_1_14)) <= var_1_1) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000005, var_1_3=1, var_1_4=10000000005, var_1_5=8, var_1_6=0, var_1_7=4, var_1_8=75, var_1_9=36] [L105] RET step() [L106] CALL, EXPR property() [L95-L96] return ((((0.625f > var_1_2) ? (var_1_3 ? (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : 1) : (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) && (var_1_3 ? (var_1_5 == ((signed long int) ((10 + var_1_6) - 2))) : 1)) && ((((64 - 25) - (var_1_8 - var_1_9)) >= var_1_6) ? (var_1_7 == ((signed char) (((((var_1_9 - 32)) > (var_1_10)) ? ((var_1_9 - 32)) : (var_1_10))))) : 1)) && (((var_1_12 - (var_1_13 + var_1_14)) <= var_1_1) ? ((var_1_3 && var_1_15) ? (var_1_11 == ((signed char) var_1_10)) : (var_1_11 == ((signed char) var_1_9))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000005, var_1_3=1, var_1_4=10000000005, var_1_5=8, var_1_6=0, var_1_7=4, var_1_8=75, var_1_9=36] [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000005, var_1_3=1, var_1_4=10000000005, var_1_5=8, var_1_6=0, var_1_7=4, var_1_8=75, var_1_9=36] [L19] reach_error() VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000005, var_1_3=1, var_1_4=10000000005, var_1_5=8, var_1_6=0, var_1_7=4, var_1_8=75, var_1_9=36] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 78 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, 78 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred 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, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 544/544 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 07:27:39,419 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_25-1loop_file-65.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 9167d3514d92876f080e6f73b391286588106b09c0456cd9b66d9fc0d1e7cefe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:27:41,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:27:41,738 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:27:41,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:27:41,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:27:41,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:27:41,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:27:41,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:27:41,777 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:27:41,778 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:27:41,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:27:41,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:27:41,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:27:41,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:27:41,781 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:27:41,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:27:41,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:27:41,782 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:27:41,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:27:41,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:27:41,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:27:41,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:27:41,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:27:41,787 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:27:41,787 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:27:41,787 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:27:41,788 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:27:41,788 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:27:41,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:27:41,789 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:27:41,789 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:27:41,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:27:41,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:27:41,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:27:41,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:27:41,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:27:41,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:27:41,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:27:41,791 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:27:41,791 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:27:41,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:27:41,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:27:41,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:27:41,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:27:41,792 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 -> 9167d3514d92876f080e6f73b391286588106b09c0456cd9b66d9fc0d1e7cefe [2024-11-10 07:27:42,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:27:42,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:27:42,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:27:42,141 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:27:42,142 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:27:42,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-65.i [2024-11-10 07:27:43,753 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:27:43,956 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:27:43,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-65.i [2024-11-10 07:27:43,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83f780c38/f78d1880cb11476f9f8f9cc95e11bc37/FLAG23e138550 [2024-11-10 07:27:43,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83f780c38/f78d1880cb11476f9f8f9cc95e11bc37 [2024-11-10 07:27:43,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:27:43,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:27:43,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:27:43,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:27:43,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:27:43,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:27:43" (1/1) ... [2024-11-10 07:27:43,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e9cee88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:43, skipping insertion in model container [2024-11-10 07:27:43,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:27:43" (1/1) ... [2024-11-10 07:27:44,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:27:44,205 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_25-1loop_file-65.i[915,928] [2024-11-10 07:27:44,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:27:44,306 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:27:44,320 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_25-1loop_file-65.i[915,928] [2024-11-10 07:27:44,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:27:44,379 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:27:44,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:44 WrapperNode [2024-11-10 07:27:44,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:27:44,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:27:44,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:27:44,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:27:44,388 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:27:44" (1/1) ... [2024-11-10 07:27:44,405 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:27:44" (1/1) ... [2024-11-10 07:27:44,433 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-10 07:27:44,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:27:44,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:27:44,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:27:44,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:27:44,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:44" (1/1) ... [2024-11-10 07:27:44,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:44" (1/1) ... [2024-11-10 07:27:44,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:44" (1/1) ... [2024-11-10 07:27:44,474 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:27:44,478 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:44" (1/1) ... [2024-11-10 07:27:44,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:44" (1/1) ... [2024-11-10 07:27:44,490 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:44" (1/1) ... [2024-11-10 07:27:44,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:44" (1/1) ... [2024-11-10 07:27:44,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:44" (1/1) ... [2024-11-10 07:27:44,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:44" (1/1) ... [2024-11-10 07:27:44,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:27:44,503 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:27:44,503 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:27:44,503 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:27:44,504 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:44" (1/1) ... [2024-11-10 07:27:44,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:27:44,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:27:44,537 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:27:44,543 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:27:44,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:27:44,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:27:44,588 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:27:44,588 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:27:44,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:27:44,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:27:44,681 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:27:44,684 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:27:48,683 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-10 07:27:48,684 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:27:48,699 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:27:48,699 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:27:48,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:27:48 BoogieIcfgContainer [2024-11-10 07:27:48,700 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:27:48,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:27:48,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:27:48,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:27:48,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:27:43" (1/3) ... [2024-11-10 07:27:48,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7711b0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:27:48, skipping insertion in model container [2024-11-10 07:27:48,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:44" (2/3) ... [2024-11-10 07:27:48,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7711b0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:27:48, skipping insertion in model container [2024-11-10 07:27:48,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:27:48" (3/3) ... [2024-11-10 07:27:48,712 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-65.i [2024-11-10 07:27:48,733 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:27:48,733 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:27:48,800 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:27:48,809 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;@30011cab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:27:48,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:27:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 07:27:48,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 07:27:48,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:27:48,829 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:27:48,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:27:48,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:27:48,836 INFO L85 PathProgramCache]: Analyzing trace with hash 146647179, now seen corresponding path program 1 times [2024-11-10 07:27:48,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:27:48,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092764920] [2024-11-10 07:27:48,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:27:48,849 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:27:48,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:27:48,856 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:27:48,857 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:27:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:27:49,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:27:49,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:27:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-10 07:27:49,237 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:27:49,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:27:49,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092764920] [2024-11-10 07:27:49,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092764920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:27:49,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:27:49,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:27:49,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310481621] [2024-11-10 07:27:49,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:27:49,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:27:49,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:27:49,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:27:49,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:27:49,271 INFO L87 Difference]: Start difference. First operand has 57 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 07:27:49,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:27:49,296 INFO L93 Difference]: Finished difference Result 110 states and 177 transitions. [2024-11-10 07:27:49,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:27:49,299 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 112 [2024-11-10 07:27:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:27:49,305 INFO L225 Difference]: With dead ends: 110 [2024-11-10 07:27:49,305 INFO L226 Difference]: Without dead ends: 52 [2024-11-10 07:27:49,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 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:27:49,311 INFO L432 NwaCegarLoop]: 78 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, 78 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:27:49,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:27:49,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-10 07:27:49,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-10 07:27:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 07:27:49,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-11-10 07:27:49,356 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 112 [2024-11-10 07:27:49,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:27:49,357 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-11-10 07:27:49,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 07:27:49,358 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-11-10 07:27:49,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 07:27:49,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:27:49,361 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:27:49,371 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:27:49,561 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:27:49,562 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:27:49,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:27:49,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1663195282, now seen corresponding path program 1 times [2024-11-10 07:27:49,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:27:49,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313076908] [2024-11-10 07:27:49,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:27:49,565 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:27:49,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:27:49,567 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:27:49,569 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:27:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:27:49,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 07:27:49,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:28:44,658 WARN L286 SmtUtils]: Spent 13.33s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)