./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-45.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-45.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 5d7e41890311b17b4172246b2c6ff0c305b3b8a9717c6f0cb798c28922acd89f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:27:00,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:27:01,041 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:27:01,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:27:01,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:27:01,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:27:01,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:27:01,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:27:01,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:27:01,088 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:27:01,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:27:01,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:27:01,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:27:01,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:27:01,092 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:27:01,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:27:01,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:27:01,093 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:27:01,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:27:01,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:27:01,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:27:01,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:27:01,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:27:01,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:27:01,099 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:27:01,099 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:27:01,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:27:01,100 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:27:01,100 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:27:01,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:27:01,101 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:27:01,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:27:01,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:27:01,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:27:01,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:27:01,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:27:01,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:27:01,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:27:01,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:27:01,103 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:27:01,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:27:01,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:27:01,104 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 -> 5d7e41890311b17b4172246b2c6ff0c305b3b8a9717c6f0cb798c28922acd89f [2024-10-24 09:27:01,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:27:01,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:27:01,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:27:01,424 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:27:01,424 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:27:01,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-45.i [2024-10-24 09:27:02,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:27:03,118 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:27:03,119 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-45.i [2024-10-24 09:27:03,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bce3b95cc/de9b2372064d4325b232b3ff1493685b/FLAG188b91626 [2024-10-24 09:27:03,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bce3b95cc/de9b2372064d4325b232b3ff1493685b [2024-10-24 09:27:03,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:27:03,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:27:03,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:27:03,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:27:03,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:27:03,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:27:03" (1/1) ... [2024-10-24 09:27:03,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@374e3eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:03, skipping insertion in model container [2024-10-24 09:27:03,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:27:03" (1/1) ... [2024-10-24 09:27:03,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:27:03,339 WARN L248 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-45.i[915,928] [2024-10-24 09:27:03,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:27:03,415 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:27:03,429 WARN L248 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-45.i[915,928] [2024-10-24 09:27:03,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:27:03,484 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:27:03,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:03 WrapperNode [2024-10-24 09:27:03,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:27:03,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:27:03,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:27:03,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:27:03,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:03" (1/1) ... [2024-10-24 09:27:03,508 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:03" (1/1) ... [2024-10-24 09:27:03,547 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-10-24 09:27:03,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:27:03,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:27:03,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:27:03,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:27:03,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:03" (1/1) ... [2024-10-24 09:27:03,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:03" (1/1) ... [2024-10-24 09:27:03,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:03" (1/1) ... [2024-10-24 09:27:03,581 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-10-24 09:27:03,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:03" (1/1) ... [2024-10-24 09:27:03,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:03" (1/1) ... [2024-10-24 09:27:03,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:03" (1/1) ... [2024-10-24 09:27:03,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:03" (1/1) ... [2024-10-24 09:27:03,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:03" (1/1) ... [2024-10-24 09:27:03,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:03" (1/1) ... [2024-10-24 09:27:03,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:27:03,604 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:27:03,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:27:03,608 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:27:03,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:03" (1/1) ... [2024-10-24 09:27:03,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:27:03,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:27:03,646 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-10-24 09:27:03,652 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-10-24 09:27:03,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:27:03,702 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:27:03,702 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:27:03,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:27:03,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:27:03,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:27:03,785 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:27:03,790 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:27:04,067 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-24 09:27:04,068 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:27:04,131 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:27:04,131 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:27:04,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:27:04 BoogieIcfgContainer [2024-10-24 09:27:04,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:27:04,134 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:27:04,134 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:27:04,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:27:04,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:27:03" (1/3) ... [2024-10-24 09:27:04,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f12b485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:27:04, skipping insertion in model container [2024-10-24 09:27:04,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:03" (2/3) ... [2024-10-24 09:27:04,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f12b485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:27:04, skipping insertion in model container [2024-10-24 09:27:04,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:27:04" (3/3) ... [2024-10-24 09:27:04,143 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-45.i [2024-10-24 09:27:04,177 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:27:04,177 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:27:04,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:27:04,274 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;@5b56e20e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:27:04,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:27:04,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 09:27:04,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 09:27:04,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:27:04,296 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:27:04,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:27:04,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:27:04,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1661675722, now seen corresponding path program 1 times [2024-10-24 09:27:04,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:27:04,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425734831] [2024-10-24 09:27:04,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:27:04,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:27:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:04,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:27:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:04,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 09:27:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:04,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 09:27:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:04,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 09:27:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:04,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 09:27:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:04,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:27:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:04,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:27:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:04,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 09:27:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:04,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:27:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:04,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 09:27:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:04,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:27:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:04,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 09:27:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:04,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:27:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:04,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:27:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:04,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:27:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:04,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:27:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:04,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:27:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:04,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 09:27:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:04,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:27:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 09:27:04,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:27:04,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425734831] [2024-10-24 09:27:04,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425734831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:27:04,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:27:04,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:27:04,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095435249] [2024-10-24 09:27:04,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:27:04,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:27:04,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:27:04,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:27:04,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:27:04,746 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 09:27:04,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:27:04,801 INFO L93 Difference]: Finished difference Result 95 states and 164 transitions. [2024-10-24 09:27:04,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:27:04,805 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 115 [2024-10-24 09:27:04,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:27:04,811 INFO L225 Difference]: With dead ends: 95 [2024-10-24 09:27:04,811 INFO L226 Difference]: Without dead ends: 46 [2024-10-24 09:27:04,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-10-24 09:27:04,818 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:27:04,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:27:04,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-24 09:27:04,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-24 09:27:04,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 09:27:04,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2024-10-24 09:27:04,870 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 115 [2024-10-24 09:27:04,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:27:04,872 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2024-10-24 09:27:04,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 09:27:04,872 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2024-10-24 09:27:04,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 09:27:04,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:27:04,876 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:27:04,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:27:04,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:27:04,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:27:04,878 INFO L85 PathProgramCache]: Analyzing trace with hash -575866160, now seen corresponding path program 1 times [2024-10-24 09:27:04,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:27:04,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632622194] [2024-10-24 09:27:04,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:27:04,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:27:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:11,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:27:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:11,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 09:27:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:11,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 09:27:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:11,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 09:27:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:11,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 09:27:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:11,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:27:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:11,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:27:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:11,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 09:27:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:11,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:27:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:11,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 09:27:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:11,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:27:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:11,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 09:27:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:11,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:27:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:11,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:27:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:11,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:27:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:11,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:27:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:11,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:27:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:11,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 09:27:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:11,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:27:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 60 proven. 120 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2024-10-24 09:27:11,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:27:11,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632622194] [2024-10-24 09:27:11,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632622194] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:27:11,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147653057] [2024-10-24 09:27:11,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:27:11,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:27:11,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:27:11,968 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:27:11,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 09:27:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:12,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-24 09:27:12,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:27:14,331 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 467 proven. 120 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-10-24 09:27:14,332 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:27:21,450 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 114 proven. 126 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2024-10-24 09:27:21,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147653057] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:27:21,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 09:27:21,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22, 19] total 44 [2024-10-24 09:27:21,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3280201] [2024-10-24 09:27:21,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 09:27:21,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-24 09:27:21,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:27:21,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-24 09:27:21,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1472, Unknown=0, NotChecked=0, Total=1892 [2024-10-24 09:27:21,462 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand has 44 states, 41 states have (on average 2.024390243902439) internal successors, (83), 38 states have internal predecessors, (83), 14 states have call successors, (45), 7 states have call predecessors, (45), 14 states have return successors, (46), 14 states have call predecessors, (46), 14 states have call successors, (46) [2024-10-24 09:27:32,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-24 09:27:33,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:27:33,417 INFO L93 Difference]: Finished difference Result 236 states and 302 transitions. [2024-10-24 09:27:33,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-24 09:27:33,419 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 2.024390243902439) internal successors, (83), 38 states have internal predecessors, (83), 14 states have call successors, (45), 7 states have call predecessors, (45), 14 states have return successors, (46), 14 states have call predecessors, (46), 14 states have call successors, (46) Word has length 115 [2024-10-24 09:27:33,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:27:33,425 INFO L225 Difference]: With dead ends: 236 [2024-10-24 09:27:33,425 INFO L226 Difference]: Without dead ends: 191 [2024-10-24 09:27:33,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1810 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=1970, Invalid=5340, Unknown=0, NotChecked=0, Total=7310 [2024-10-24 09:27:33,431 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 331 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 236 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-10-24 09:27:33,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 381 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 923 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2024-10-24 09:27:33,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-24 09:27:33,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 157. [2024-10-24 09:27:33,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 98 states have (on average 1.1224489795918366) internal successors, (110), 99 states have internal predecessors, (110), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-24 09:27:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 196 transitions. [2024-10-24 09:27:33,497 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 196 transitions. Word has length 115 [2024-10-24 09:27:33,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:27:33,500 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 196 transitions. [2024-10-24 09:27:33,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 2.024390243902439) internal successors, (83), 38 states have internal predecessors, (83), 14 states have call successors, (45), 7 states have call predecessors, (45), 14 states have return successors, (46), 14 states have call predecessors, (46), 14 states have call successors, (46) [2024-10-24 09:27:33,501 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 196 transitions. [2024-10-24 09:27:33,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 09:27:33,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:27:33,503 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:27:33,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 09:27:33,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:27:33,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:27:33,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:27:33,709 INFO L85 PathProgramCache]: Analyzing trace with hash -575806578, now seen corresponding path program 1 times [2024-10-24 09:27:33,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:27:33,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489149824] [2024-10-24 09:27:33,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:27:33,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:27:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:27:33,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:27:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:27:33,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:27:33,956 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:27:33,957 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:27:33,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:27:33,962 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 09:27:34,031 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:27:34,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:27:34 BoogieIcfgContainer [2024-10-24 09:27:34,037 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:27:34,040 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:27:34,040 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:27:34,041 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:27:34,041 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:27:04" (3/4) ... [2024-10-24 09:27:34,043 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:27:34,044 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:27:34,045 INFO L158 Benchmark]: Toolchain (without parser) took 30901.92ms. Allocated memory was 157.3MB in the beginning and 394.3MB in the end (delta: 237.0MB). Free memory was 104.1MB in the beginning and 212.4MB in the end (delta: -108.3MB). Peak memory consumption was 130.5MB. Max. memory is 16.1GB. [2024-10-24 09:27:34,046 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 157.3MB. Free memory was 119.2MB in the beginning and 119.1MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:27:34,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.47ms. Allocated memory is still 157.3MB. Free memory was 103.8MB in the beginning and 89.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 09:27:34,047 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.87ms. Allocated memory is still 157.3MB. Free memory was 89.4MB in the beginning and 87.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:27:34,047 INFO L158 Benchmark]: Boogie Preprocessor took 55.03ms. Allocated memory is still 157.3MB. Free memory was 87.2MB in the beginning and 84.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 09:27:34,047 INFO L158 Benchmark]: RCFGBuilder took 527.71ms. Allocated memory is still 157.3MB. Free memory was 84.5MB in the beginning and 65.2MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 09:27:34,047 INFO L158 Benchmark]: TraceAbstraction took 29903.35ms. Allocated memory was 157.3MB in the beginning and 394.3MB in the end (delta: 237.0MB). Free memory was 64.7MB in the beginning and 213.4MB in the end (delta: -148.7MB). Peak memory consumption was 90.7MB. Max. memory is 16.1GB. [2024-10-24 09:27:34,048 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 394.3MB. Free memory was 213.4MB in the beginning and 212.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:27:34,050 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.26ms. Allocated memory is still 157.3MB. Free memory was 119.2MB in the beginning and 119.1MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.47ms. Allocated memory is still 157.3MB. Free memory was 103.8MB in the beginning and 89.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.87ms. Allocated memory is still 157.3MB. Free memory was 89.4MB in the beginning and 87.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.03ms. Allocated memory is still 157.3MB. Free memory was 87.2MB in the beginning and 84.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 527.71ms. Allocated memory is still 157.3MB. Free memory was 84.5MB in the beginning and 65.2MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 29903.35ms. Allocated memory was 157.3MB in the beginning and 394.3MB in the end (delta: 237.0MB). Free memory was 64.7MB in the beginning and 213.4MB in the end (delta: -148.7MB). Peak memory consumption was 90.7MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 394.3MB. Free memory was 213.4MB in the beginning and 212.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 999999.2; [L23] double var_1_6 = 0.0; [L24] double var_1_7 = 5.9; [L25] double var_1_8 = 255.6; [L26] unsigned long int var_1_9 = 4; [L27] unsigned char var_1_10 = 0; [L28] unsigned long int var_1_11 = 1142722175; [L29] unsigned long int var_1_12 = 1231257437; [L30] signed char var_1_13 = -10; [L31] signed char var_1_14 = 100; [L32] signed char var_1_15 = 4; [L33] signed char var_1_16 = 64; [L34] signed char var_1_17 = 1; [L35] signed char var_1_18 = -8; [L36] unsigned char var_1_19 = 4; [L97] isInitial = 1 [L98] FCALL initially() [L99] int k_loop; [L100] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_6=0, var_1_7=59/10, var_1_8=1278/5, var_1_9=4] [L100] COND TRUE k_loop < 1 [L101] FCALL updateLastVariables() [L102] CALL updateVariables() [L59] var_1_6 = __VERIFIER_nondet_double() [L60] CALL assume_abort_if_not((var_1_6 >= 4611686.018427382800e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_7=59/10, var_1_8=1278/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_7=59/10, var_1_8=1278/5, var_1_9=4] [L60] RET assume_abort_if_not((var_1_6 >= 4611686.018427382800e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_7=59/10, var_1_8=1278/5, var_1_9=4] [L61] var_1_7 = __VERIFIER_nondet_double() [L62] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_8=1278/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_8=1278/5, var_1_9=4] [L62] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_8=1278/5, var_1_9=4] [L63] var_1_8 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L64] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L65] var_1_10 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L66] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L67] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L67] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L68] var_1_11 = __VERIFIER_nondet_ulong() [L69] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L69] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L70] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L70] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L71] var_1_12 = __VERIFIER_nondet_ulong() [L72] CALL assume_abort_if_not(var_1_12 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L72] RET assume_abort_if_not(var_1_12 >= 1073741824) VAL [isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L73] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L73] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L74] var_1_14 = __VERIFIER_nondet_char() [L75] CALL assume_abort_if_not(var_1_14 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L75] RET assume_abort_if_not(var_1_14 >= -1) VAL [isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L76] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L76] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L77] var_1_15 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L78] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L79] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L79] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L80] var_1_16 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L81] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L82] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L82] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L83] var_1_17 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=-63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=-63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L84] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=-63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L85] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=-63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=-63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L85] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=-63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L86] var_1_18 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=-63, var_1_18=-63, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=-63, var_1_18=-63, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L87] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=-63, var_1_18=-63, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L88] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=-63, var_1_18=-63, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=-63, var_1_18=-63, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L88] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=-63, var_1_18=-63, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L102] RET updateVariables() [L103] CALL step() [L40] COND TRUE \read(var_1_10) [L41] var_1_9 = ((var_1_11 + var_1_12) - 5u) VAL [isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=-63, var_1_18=-63, var_1_19=4, var_1_1=4999996/5, var_1_9=2214592525] [L43] var_1_19 = var_1_16 [L44] unsigned long int stepLocal_0 = ((((var_1_19 + var_1_9)) < (var_1_9)) ? ((var_1_19 + var_1_9)) : (var_1_9)); VAL [isInitial=1, stepLocal_0=2214592525, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-10, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=-63, var_1_18=-63, var_1_19=50, var_1_1=4999996/5, var_1_9=2214592525] [L45] COND TRUE \read(var_1_10) [L46] var_1_13 = (var_1_14 - ((((((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) < (50)) ? (((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) : (50)))) VAL [isInitial=1, stepLocal_0=2214592525, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-51, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=-63, var_1_18=-63, var_1_19=50, var_1_1=4999996/5, var_1_9=2214592525] [L52] COND FALSE !((var_1_9 / 32) < (((((var_1_13 + var_1_9)) < (var_1_19)) ? ((var_1_13 + var_1_9)) : (var_1_19)))) [L55] var_1_1 = var_1_6 VAL [isInitial=1, stepLocal_0=2214592525, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-51, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=-63, var_1_18=-63, var_1_19=50, var_1_1=5368709124, var_1_6=5368709124, var_1_9=2214592525] [L103] RET step() [L104] CALL, EXPR property() [L93-L94] return (((((var_1_9 / 32) < (((((var_1_13 + var_1_9)) < (var_1_19)) ? ((var_1_13 + var_1_9)) : (var_1_19)))) ? (var_1_1 == ((double) ((var_1_6 - var_1_7) - var_1_8))) : (var_1_1 == ((double) var_1_6))) && (var_1_10 ? (var_1_9 == ((unsigned long int) ((var_1_11 + var_1_12) - 5u))) : 1)) && (var_1_10 ? (var_1_13 == ((signed char) (var_1_14 - ((((((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) < (50)) ? (((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) : (50)))))) : ((var_1_12 < (((((var_1_19 + var_1_9)) < (var_1_9)) ? ((var_1_19 + var_1_9)) : (var_1_9)))) ? (var_1_13 == ((signed char) (var_1_17 + var_1_18))) : 1))) && (var_1_19 == ((unsigned char) var_1_16)) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-51, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=-63, var_1_18=-63, var_1_19=50, var_1_1=5368709124, var_1_6=5368709124, var_1_9=2214592525] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=5368709119, var_1_12=-3154116589, var_1_13=-51, var_1_14=-1, var_1_15=126, var_1_16=50, var_1_17=-63, var_1_18=-63, var_1_19=50, var_1_1=5368709124, var_1_6=5368709124, var_1_9=2214592525] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.7s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 336 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 331 mSDsluCounter, 446 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 310 mSDsCounter, 236 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 928 IncrementalHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 236 mSolverCounterUnsat, 136 mSDtfsCounter, 928 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 389 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1810 ImplicationChecksByTransitivity, 12.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=2, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 34 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 460 NumberOfCodeBlocks, 460 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 456 ConstructedInterpolants, 3 QuantifiedInterpolants, 3975 SizeOfPredicates, 9 NumberOfNonLiveVariables, 261 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2370/2736 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-10-24 09:27:34,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-45.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 5d7e41890311b17b4172246b2c6ff0c305b3b8a9717c6f0cb798c28922acd89f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:27:36,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:27:36,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:27:36,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:27:36,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:27:36,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:27:36,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:27:36,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:27:36,309 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:27:36,309 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:27:36,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:27:36,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:27:36,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:27:36,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:27:36,312 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:27:36,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:27:36,313 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:27:36,313 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:27:36,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:27:36,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:27:36,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:27:36,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:27:36,318 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:27:36,318 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:27:36,318 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:27:36,318 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:27:36,318 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:27:36,319 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:27:36,319 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:27:36,319 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:27:36,319 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:27:36,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:27:36,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:27:36,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:27:36,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:27:36,320 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:27:36,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:27:36,321 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:27:36,321 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:27:36,321 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:27:36,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:27:36,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:27:36,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:27:36,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:27:36,324 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:27:36,324 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 -> 5d7e41890311b17b4172246b2c6ff0c305b3b8a9717c6f0cb798c28922acd89f [2024-10-24 09:27:36,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:27:36,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:27:36,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:27:36,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:27:36,675 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:27:36,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-45.i [2024-10-24 09:27:38,239 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:27:38,467 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:27:38,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-45.i [2024-10-24 09:27:38,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ec439ebf/a4ae9d9a7ee44a799cb3702ca73cb9a1/FLAGf7298c9c0 [2024-10-24 09:27:38,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ec439ebf/a4ae9d9a7ee44a799cb3702ca73cb9a1 [2024-10-24 09:27:38,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:27:38,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:27:38,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:27:38,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:27:38,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:27:38,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:27:38" (1/1) ... [2024-10-24 09:27:38,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@146c2c27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:38, skipping insertion in model container [2024-10-24 09:27:38,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:27:38" (1/1) ... [2024-10-24 09:27:38,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:27:39,047 WARN L248 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-45.i[915,928] [2024-10-24 09:27:39,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:27:39,110 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:27:39,127 WARN L248 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-45.i[915,928] [2024-10-24 09:27:39,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:27:39,172 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:27:39,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:39 WrapperNode [2024-10-24 09:27:39,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:27:39,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:27:39,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:27:39,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:27:39,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:39" (1/1) ... [2024-10-24 09:27:39,202 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:39" (1/1) ... [2024-10-24 09:27:39,236 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-10-24 09:27:39,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:27:39,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:27:39,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:27:39,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:27:39,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:39" (1/1) ... [2024-10-24 09:27:39,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:39" (1/1) ... [2024-10-24 09:27:39,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:39" (1/1) ... [2024-10-24 09:27:39,278 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-10-24 09:27:39,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:39" (1/1) ... [2024-10-24 09:27:39,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:39" (1/1) ... [2024-10-24 09:27:39,295 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:39" (1/1) ... [2024-10-24 09:27:39,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:39" (1/1) ... [2024-10-24 09:27:39,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:39" (1/1) ... [2024-10-24 09:27:39,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:39" (1/1) ... [2024-10-24 09:27:39,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:27:39,309 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:27:39,309 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:27:39,309 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:27:39,310 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:39" (1/1) ... [2024-10-24 09:27:39,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:27:39,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:27:39,345 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-10-24 09:27:39,349 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-10-24 09:27:39,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:27:39,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:27:39,393 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:27:39,394 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:27:39,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:27:39,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:27:39,486 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:27:39,488 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:27:41,178 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-24 09:27:41,178 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:27:41,241 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:27:41,242 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:27:41,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:27:41 BoogieIcfgContainer [2024-10-24 09:27:41,242 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:27:41,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:27:41,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:27:41,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:27:41,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:27:38" (1/3) ... [2024-10-24 09:27:41,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d41157c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:27:41, skipping insertion in model container [2024-10-24 09:27:41,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:27:39" (2/3) ... [2024-10-24 09:27:41,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d41157c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:27:41, skipping insertion in model container [2024-10-24 09:27:41,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:27:41" (3/3) ... [2024-10-24 09:27:41,254 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-45.i [2024-10-24 09:27:41,270 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:27:41,271 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:27:41,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:27:41,354 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;@90b4311, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:27:41,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:27:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 09:27:41,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 09:27:41,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:27:41,374 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:27:41,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:27:41,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:27:41,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1661675722, now seen corresponding path program 1 times [2024-10-24 09:27:41,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:27:41,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536168336] [2024-10-24 09:27:41,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:27:41,396 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-10-24 09:27:41,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:27:41,399 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-10-24 09:27:41,400 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-10-24 09:27:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:41,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:27:41,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:27:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-10-24 09:27:41,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:27:41,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:27:41,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536168336] [2024-10-24 09:27:41,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536168336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:27:41,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:27:41,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:27:41,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079106514] [2024-10-24 09:27:41,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:27:41,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:27:41,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:27:41,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:27:41,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:27:41,774 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 09:27:42,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:27:42,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:27:42,927 INFO L93 Difference]: Finished difference Result 95 states and 164 transitions. [2024-10-24 09:27:42,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:27:42,930 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 115 [2024-10-24 09:27:42,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:27:42,938 INFO L225 Difference]: With dead ends: 95 [2024-10-24 09:27:42,939 INFO L226 Difference]: Without dead ends: 46 [2024-10-24 09:27:42,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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-10-24 09:27:42,947 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:27:42,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 09:27:42,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-24 09:27:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-24 09:27:42,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 09:27:42,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2024-10-24 09:27:42,989 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 115 [2024-10-24 09:27:42,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:27:42,990 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2024-10-24 09:27:42,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 09:27:42,990 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2024-10-24 09:27:42,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 09:27:42,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:27:42,994 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:27:43,004 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-10-24 09:27:43,195 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-10-24 09:27:43,196 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:27:43,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:27:43,197 INFO L85 PathProgramCache]: Analyzing trace with hash -575866160, now seen corresponding path program 1 times [2024-10-24 09:27:43,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:27:43,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561901122] [2024-10-24 09:27:43,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:27:43,198 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-10-24 09:27:43,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:27:43,201 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-10-24 09:27:43,204 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-10-24 09:27:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:27:43,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 09:27:43,500 INFO L278 TraceCheckSpWp]: Computing forward predicates...