./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-6.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 62ea2a992a63f62694d044d93223d6b697490145b70f7277a2bce759d06cac7e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:22:25,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:22:25,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:22:25,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:22:25,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:22:25,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:22:25,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:22:25,282 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:22:25,282 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:22:25,282 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:22:25,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:22:25,283 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:22:25,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:22:25,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:22:25,284 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:22:25,284 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:22:25,284 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:22:25,284 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:22:25,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:22:25,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:22:25,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:22:25,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:22:25,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:22:25,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:22:25,285 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:22:25,285 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:22:25,285 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:22:25,285 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:22:25,285 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:22:25,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:22:25,285 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:22:25,285 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:22:25,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:22:25,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:22:25,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:22:25,286 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:22:25,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:22:25,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:22:25,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:22:25,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:22:25,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:22:25,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:22:25,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:22:25,287 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 62ea2a992a63f62694d044d93223d6b697490145b70f7277a2bce759d06cac7e [2025-03-16 23:22:25,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:22:25,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:22:25,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:22:25,496 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:22:25,496 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:22:25,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-6.i [2025-03-16 23:22:26,647 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1b107fd/23954761e27d400fb7f174fe1f19b897/FLAG4097e9e3d [2025-03-16 23:22:26,882 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:22:26,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-6.i [2025-03-16 23:22:26,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1b107fd/23954761e27d400fb7f174fe1f19b897/FLAG4097e9e3d [2025-03-16 23:22:27,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1b107fd/23954761e27d400fb7f174fe1f19b897 [2025-03-16 23:22:27,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:22:27,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:22:27,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:22:27,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:22:27,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:22:27,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:22:27" (1/1) ... [2025-03-16 23:22:27,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4110503e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:27, skipping insertion in model container [2025-03-16 23:22:27,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:22:27" (1/1) ... [2025-03-16 23:22:27,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:22:27,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-6.i[916,929] [2025-03-16 23:22:27,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:22:27,383 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:22:27,391 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-6.i[916,929] [2025-03-16 23:22:27,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:22:27,431 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:22:27,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:27 WrapperNode [2025-03-16 23:22:27,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:22:27,434 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:22:27,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:22:27,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:22:27,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:27" (1/1) ... [2025-03-16 23:22:27,449 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:27" (1/1) ... [2025-03-16 23:22:27,476 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2025-03-16 23:22:27,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:22:27,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:22:27,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:22:27,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:22:27,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:27" (1/1) ... [2025-03-16 23:22:27,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:27" (1/1) ... [2025-03-16 23:22:27,490 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:27" (1/1) ... [2025-03-16 23:22:27,499 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]. [2025-03-16 23:22:27,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:27" (1/1) ... [2025-03-16 23:22:27,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:27" (1/1) ... [2025-03-16 23:22:27,503 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:27" (1/1) ... [2025-03-16 23:22:27,504 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:27" (1/1) ... [2025-03-16 23:22:27,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:27" (1/1) ... [2025-03-16 23:22:27,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:27" (1/1) ... [2025-03-16 23:22:27,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:22:27,507 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:22:27,507 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:22:27,507 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:22:27,511 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:27" (1/1) ... [2025-03-16 23:22:27,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:22:27,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:22:27,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 23:22:27,539 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 [2025-03-16 23:22:27,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:22:27,554 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:22:27,554 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:22:27,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:22:27,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:22:27,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:22:27,608 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:22:27,609 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:22:27,795 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-16 23:22:27,795 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:22:27,805 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:22:27,806 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:22:27,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:22:27 BoogieIcfgContainer [2025-03-16 23:22:27,806 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:22:27,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:22:27,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:22:27,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:22:27,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:22:27" (1/3) ... [2025-03-16 23:22:27,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c045284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:22:27, skipping insertion in model container [2025-03-16 23:22:27,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:27" (2/3) ... [2025-03-16 23:22:27,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c045284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:22:27, skipping insertion in model container [2025-03-16 23:22:27,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:22:27" (3/3) ... [2025-03-16 23:22:27,813 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-6.i [2025-03-16 23:22:27,823 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:22:27,825 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-6.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:22:27,862 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:22:27,871 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;@178580c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:22:27,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:22:27,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 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) [2025-03-16 23:22:27,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-16 23:22:27,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:22:27,882 INFO L218 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, 1, 1, 1, 1, 1] [2025-03-16 23:22:27,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:22:27,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:22:27,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1294679803, now seen corresponding path program 1 times [2025-03-16 23:22:27,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:22:27,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378866788] [2025-03-16 23:22:27,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:22:27,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:22:27,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 23:22:27,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 23:22:27,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:22:27,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:22:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-16 23:22:28,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:22:28,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378866788] [2025-03-16 23:22:28,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378866788] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:22:28,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311478655] [2025-03-16 23:22:28,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:22:28,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:22:28,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:22:28,088 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) [2025-03-16 23:22:28,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 23:22:28,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 23:22:28,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 23:22:28,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:22:28,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:22:28,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:22:28,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:22:28,248 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-16 23:22:28,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:22:28,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311478655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:22:28,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:22:28,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:22:28,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073575385] [2025-03-16 23:22:28,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:22:28,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:22:28,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:22:28,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:22:28,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:22:28,282 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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) [2025-03-16 23:22:28,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:22:28,301 INFO L93 Difference]: Finished difference Result 109 states and 187 transitions. [2025-03-16 23:22:28,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:22:28,302 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (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 120 [2025-03-16 23:22:28,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:22:28,306 INFO L225 Difference]: With dead ends: 109 [2025-03-16 23:22:28,306 INFO L226 Difference]: Without dead ends: 54 [2025-03-16 23:22:28,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:22:28,310 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:22:28,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:22:28,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-16 23:22:28,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-16 23:22:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 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) [2025-03-16 23:22:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 81 transitions. [2025-03-16 23:22:28,344 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 81 transitions. Word has length 120 [2025-03-16 23:22:28,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:22:28,344 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 81 transitions. [2025-03-16 23:22:28,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (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) [2025-03-16 23:22:28,345 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 81 transitions. [2025-03-16 23:22:28,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-16 23:22:28,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:22:28,348 INFO L218 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, 1, 1, 1, 1, 1] [2025-03-16 23:22:28,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 23:22:28,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 23:22:28,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:22:28,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:22:28,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2007508006, now seen corresponding path program 1 times [2025-03-16 23:22:28,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:22:28,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146053670] [2025-03-16 23:22:28,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:22:28,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:22:28,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 23:22:28,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 23:22:28,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:22:28,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:22:29,088 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-16 23:22:29,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:22:29,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146053670] [2025-03-16 23:22:29,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146053670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:22:29,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446600405] [2025-03-16 23:22:29,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:22:29,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:22:29,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:22:29,092 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:22:29,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 23:22:29,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 23:22:29,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 23:22:29,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:22:29,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:22:29,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 23:22:29,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:22:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 120 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-16 23:22:29,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:22:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-16 23:22:29,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446600405] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:22:29,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 23:22:29,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-16 23:22:29,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589381313] [2025-03-16 23:22:29,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 23:22:29,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 23:22:29,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:22:29,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 23:22:29,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:22:29,532 INFO L87 Difference]: Start difference. First operand 54 states and 81 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-16 23:22:29,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:22:29,694 INFO L93 Difference]: Finished difference Result 113 states and 166 transitions. [2025-03-16 23:22:29,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:22:29,697 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 120 [2025-03-16 23:22:29,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:22:29,698 INFO L225 Difference]: With dead ends: 113 [2025-03-16 23:22:29,698 INFO L226 Difference]: Without dead ends: 60 [2025-03-16 23:22:29,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:22:29,699 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 65 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:22:29,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 129 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:22:29,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-16 23:22:29,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-03-16 23:22:29,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-16 23:22:29,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2025-03-16 23:22:29,714 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 83 transitions. Word has length 120 [2025-03-16 23:22:29,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:22:29,716 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 83 transitions. [2025-03-16 23:22:29,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-16 23:22:29,717 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 83 transitions. [2025-03-16 23:22:29,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 23:22:29,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:22:29,720 INFO L218 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, 1, 1, 1, 1, 1, 1] [2025-03-16 23:22:29,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 23:22:29,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-16 23:22:29,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:22:29,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:22:29,921 INFO L85 PathProgramCache]: Analyzing trace with hash 2104161310, now seen corresponding path program 1 times [2025-03-16 23:22:29,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:22:29,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586049512] [2025-03-16 23:22:29,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:22:29,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:22:29,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 23:22:29,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 23:22:29,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:22:29,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:22:29,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2127204339] [2025-03-16 23:22:29,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:22:29,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:22:29,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:22:29,996 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:22:29,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 23:22:30,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 23:22:30,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 23:22:30,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:22:30,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:22:30,071 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:22:30,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 23:22:30,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 23:22:30,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:22:30,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:22:30,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:22:30,154 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:22:30,155 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:22:30,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 23:22:30,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:22:30,364 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-16 23:22:30,419 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:22:30,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:22:30 BoogieIcfgContainer [2025-03-16 23:22:30,422 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:22:30,423 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:22:30,424 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:22:30,425 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:22:30,425 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:22:27" (3/4) ... [2025-03-16 23:22:30,427 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:22:30,427 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:22:30,428 INFO L158 Benchmark]: Toolchain (without parser) took 3200.31ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 43.8MB in the end (delta: 62.0MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2025-03-16 23:22:30,428 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:22:30,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.08ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 92.0MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:22:30,428 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.82ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 89.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:22:30,428 INFO L158 Benchmark]: Boogie Preprocessor took 29.84ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 87.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:22:30,429 INFO L158 Benchmark]: IcfgBuilder took 298.81ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 69.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:22:30,429 INFO L158 Benchmark]: TraceAbstraction took 2614.92ms. Allocated memory is still 142.6MB. Free memory was 68.8MB in the beginning and 43.9MB in the end (delta: 24.9MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2025-03-16 23:22:30,429 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 142.6MB. Free memory was 43.9MB in the beginning and 43.8MB in the end (delta: 12.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:22:30,430 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.46ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.08ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 92.0MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.82ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 89.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.84ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 87.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 298.81ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 69.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2614.92ms. Allocated memory is still 142.6MB. Free memory was 68.8MB in the beginning and 43.9MB in the end (delta: 24.9MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 142.6MB. Free memory was 43.9MB in the beginning and 43.8MB in the end (delta: 12.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryArithmeticFLOAToperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 100.25; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 8; [L25] unsigned char var_1_4 = 0; [L26] double var_1_5 = 1.9; [L27] double var_1_6 = 7.5; [L28] double var_1_7 = 64.25; [L29] signed long int var_1_8 = 2; [L30] signed long int var_1_9 = 1000000000; [L31] signed long int var_1_10 = 1000000000; [L32] signed long int var_1_11 = 1957998270; [L33] float var_1_12 = 50.25; [L34] float var_1_13 = 9.8; [L35] float var_1_14 = 25.5; [L36] float var_1_15 = 3.5; [L37] signed long int var_1_16 = -500; [L38] unsigned char var_1_17 = 1; [L39] unsigned char var_1_18 = 1; [L40] unsigned char var_1_19 = 0; [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] FCALL updateLastVariables() [L125] CALL updateVariables() [L82] var_1_2 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L83] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L84] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L84] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L85] var_1_3 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L86] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L87] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L87] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L88] var_1_4 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L89] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L90] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L90] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L91] var_1_5 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L92] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L93] var_1_6 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L94] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L95] var_1_7 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1000000000] [L96] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1000000000] [L97] var_1_9 = __VERIFIER_nondet_long() [L98] CALL assume_abort_if_not(var_1_9 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L98] RET assume_abort_if_not(var_1_9 >= 536870911) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L99] CALL assume_abort_if_not(var_1_9 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L99] RET assume_abort_if_not(var_1_9 <= 1073741823) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L100] var_1_10 = __VERIFIER_nondet_long() [L101] CALL assume_abort_if_not(var_1_10 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=536871167, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536871167, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L101] RET assume_abort_if_not(var_1_10 >= 536870911) VAL [isInitial=1, var_1_10=536871167, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L102] CALL assume_abort_if_not(var_1_10 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=536871167, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536871167, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L102] RET assume_abort_if_not(var_1_10 <= 1073741823) VAL [isInitial=1, var_1_10=536871167, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L103] var_1_11 = __VERIFIER_nondet_long() [L104] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=536871167, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536871167, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L104] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, var_1_10=536871167, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L105] CALL assume_abort_if_not(var_1_11 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=536871167, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536871167, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L105] RET assume_abort_if_not(var_1_11 <= 2147483646) VAL [isInitial=1, var_1_10=536871167, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L106] var_1_14 = __VERIFIER_nondet_float() [L107] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=536871167, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536871167, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L107] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=536871167, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L108] var_1_15 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=536871167, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536871167, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L109] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=536871167, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L110] var_1_18 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=536871167, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536871167, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L111] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, var_1_10=536871167, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L112] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=536871167, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536871167, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L112] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, var_1_10=536871167, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L125] RET updateVariables() [L126] CALL step() [L44] unsigned char stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=0, var_1_10=536871167, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_8=2, var_1_9=536870911] [L45] COND FALSE !(\read(var_1_2)) [L52] var_1_1 = var_1_5 VAL [isInitial=1, stepLocal_0=0, var_1_10=536871167, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=2, var_1_2=0, var_1_4=0, var_1_5=2, var_1_8=2, var_1_9=536870911] [L54] var_1_8 = (((var_1_9 + var_1_10) - var_1_3) - (var_1_11 - ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) [L55] signed long int stepLocal_1 = (((var_1_3) < (var_1_9)) ? (var_1_3) : (var_1_9)); VAL [isInitial=1, stepLocal_0=0, stepLocal_1=255, var_1_10=536871167, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=2, var_1_2=0, var_1_3=255, var_1_4=0, var_1_5=2, var_1_8=0, var_1_9=536870911] [L56] COND TRUE stepLocal_1 >= (var_1_4 - var_1_11) [L57] var_1_12 = var_1_7 VAL [isInitial=1, stepLocal_0=0, var_1_10=536871167, var_1_11=1073741823, var_1_12=3, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=2, var_1_2=0, var_1_3=255, var_1_4=0, var_1_5=2, var_1_7=3, var_1_8=0, var_1_9=536870911] [L59] signed long int stepLocal_2 = var_1_8; VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, var_1_10=536871167, var_1_11=1073741823, var_1_12=3, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=2, var_1_2=0, var_1_3=255, var_1_4=0, var_1_5=2, var_1_7=3, var_1_8=0, var_1_9=536870911] [L60] COND TRUE stepLocal_2 < var_1_11 [L61] var_1_13 = ((7.3868261718112563E18f - (var_1_14 + var_1_15)) - 5.4f) VAL [isInitial=1, stepLocal_0=0, var_1_10=536871167, var_1_11=1073741823, var_1_12=3, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=2, var_1_2=0, var_1_3=255, var_1_4=0, var_1_5=2, var_1_7=3, var_1_8=0, var_1_9=536870911] [L65] COND FALSE !((((((- var_1_15)) > ((var_1_13 * var_1_6))) ? ((- var_1_15)) : ((var_1_13 * var_1_6)))) < var_1_5) VAL [isInitial=1, stepLocal_0=0, var_1_10=536871167, var_1_11=1073741823, var_1_12=3, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=2, var_1_2=0, var_1_3=255, var_1_4=0, var_1_5=2, var_1_7=3, var_1_8=0, var_1_9=536870911] [L72] var_1_17 = (((var_1_3 * var_1_9) >= ((((var_1_16) > (var_1_8)) ? (var_1_16) : (var_1_8)))) || var_1_18) VAL [isInitial=1, stepLocal_0=0, var_1_10=536871167, var_1_11=1073741823, var_1_12=3, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=2, var_1_2=0, var_1_3=255, var_1_4=0, var_1_5=2, var_1_7=3, var_1_8=0, var_1_9=536870911] [L73] COND TRUE \read(var_1_17) VAL [isInitial=1, stepLocal_0=0, var_1_10=536871167, var_1_11=1073741823, var_1_12=3, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=2, var_1_2=0, var_1_3=255, var_1_4=0, var_1_5=2, var_1_7=3, var_1_8=0, var_1_9=536870911] [L74] COND TRUE var_1_7 > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (var_1_13 * 63.375)) [L75] var_1_19 = var_1_18 VAL [isInitial=1, stepLocal_0=0, var_1_10=536871167, var_1_11=1073741823, var_1_12=3, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=2, var_1_2=0, var_1_3=255, var_1_4=0, var_1_5=2, var_1_7=3, var_1_8=0, var_1_9=536870911] [L126] RET step() [L127] CALL, EXPR property() [L117-L118] return ((((((var_1_2 ? ((var_1_3 >= var_1_4) ? (var_1_1 == ((double) (var_1_5 + var_1_6))) : (var_1_1 == ((double) (4.125 - var_1_7)))) : (var_1_1 == ((double) var_1_5))) && (var_1_8 == ((signed long int) (((var_1_9 + var_1_10) - var_1_3) - (var_1_11 - ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))))) && ((((((var_1_3) < (var_1_9)) ? (var_1_3) : (var_1_9))) >= (var_1_4 - var_1_11)) ? (var_1_12 == ((float) var_1_7)) : 1)) && ((var_1_8 < var_1_11) ? (var_1_13 == ((float) ((7.3868261718112563E18f - (var_1_14 + var_1_15)) - 5.4f))) : (var_1_13 == ((float) (var_1_15 + ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))))))) && (((((((- var_1_15)) > ((var_1_13 * var_1_6))) ? ((- var_1_15)) : ((var_1_13 * var_1_6)))) < var_1_5) ? ((var_1_11 != ((((var_1_8) < (var_1_10)) ? (var_1_8) : (var_1_10)))) ? (var_1_2 ? (var_1_16 == ((signed long int) var_1_3)) : 1) : 1) : 1)) && (var_1_17 == ((unsigned char) (((var_1_3 * var_1_9) >= ((((var_1_16) > (var_1_8)) ? (var_1_16) : (var_1_8)))) || var_1_18)))) && (var_1_17 ? ((var_1_7 > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (var_1_13 * 63.375))) ? (var_1_19 == ((unsigned char) var_1_18)) : 1) : (var_1_19 == ((unsigned char) var_1_18))) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=536871167, var_1_11=1073741823, var_1_12=3, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=2, var_1_2=0, var_1_3=255, var_1_4=0, var_1_5=2, var_1_7=3, var_1_8=0, var_1_9=536870911] [L19] reach_error() VAL [isInitial=1, var_1_10=536871167, var_1_11=1073741823, var_1_12=3, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=2, var_1_2=0, var_1_3=255, var_1_4=0, var_1_5=2, var_1_7=3, var_1_8=0, var_1_9=536870911] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 104 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 210 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 115 IncrementalHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 136 mSDtfsCounter, 115 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 357 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 722 NumberOfCodeBlocks, 722 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 595 ConstructedInterpolants, 0 QuantifiedInterpolants, 779 SizeOfPredicates, 7 NumberOfNonLiveVariables, 566 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 3375/3420 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 23:22:30,447 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/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-6.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 62ea2a992a63f62694d044d93223d6b697490145b70f7277a2bce759d06cac7e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:22:32,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:22:32,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:22:32,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:22:32,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:22:32,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:22:32,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:22:32,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:22:32,360 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:22:32,362 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:22:32,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:22:32,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:22:32,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:22:32,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:22:32,363 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:22:32,363 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:22:32,363 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:22:32,363 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:22:32,363 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:22:32,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:22:32,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:22:32,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:22:32,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:22:32,364 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:22:32,364 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:22:32,364 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:22:32,364 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:22:32,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:22:32,364 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:22:32,364 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:22:32,364 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:22:32,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:22:32,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:22:32,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:22:32,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:22:32,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:22:32,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:22:32,365 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:22:32,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:22:32,365 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:22:32,365 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:22:32,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:22:32,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:22:32,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:22:32,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:22:32,366 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 62ea2a992a63f62694d044d93223d6b697490145b70f7277a2bce759d06cac7e [2025-03-16 23:22:32,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:22:32,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:22:32,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:22:32,597 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:22:32,598 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:22:32,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-6.i [2025-03-16 23:22:33,746 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6172fa623/8651879c0bf6411ba44cdd8dca194c6d/FLAG5e78918a1 [2025-03-16 23:22:33,923 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:22:33,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-6.i [2025-03-16 23:22:33,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6172fa623/8651879c0bf6411ba44cdd8dca194c6d/FLAG5e78918a1 [2025-03-16 23:22:33,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6172fa623/8651879c0bf6411ba44cdd8dca194c6d [2025-03-16 23:22:33,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:22:33,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:22:33,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:22:33,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:22:33,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:22:33,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:22:33" (1/1) ... [2025-03-16 23:22:33,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@494fa0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:33, skipping insertion in model container [2025-03-16 23:22:33,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:22:33" (1/1) ... [2025-03-16 23:22:33,974 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:22:34,078 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-6.i[916,929] [2025-03-16 23:22:34,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:22:34,143 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:22:34,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-6.i[916,929] [2025-03-16 23:22:34,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:22:34,199 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:22:34,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:34 WrapperNode [2025-03-16 23:22:34,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:22:34,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:22:34,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:22:34,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:22:34,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:34" (1/1) ... [2025-03-16 23:22:34,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:34" (1/1) ... [2025-03-16 23:22:34,238 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2025-03-16 23:22:34,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:22:34,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:22:34,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:22:34,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:22:34,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:34" (1/1) ... [2025-03-16 23:22:34,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:34" (1/1) ... [2025-03-16 23:22:34,249 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:34" (1/1) ... [2025-03-16 23:22:34,271 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]. [2025-03-16 23:22:34,272 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:34" (1/1) ... [2025-03-16 23:22:34,272 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:34" (1/1) ... [2025-03-16 23:22:34,280 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:34" (1/1) ... [2025-03-16 23:22:34,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:34" (1/1) ... [2025-03-16 23:22:34,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:34" (1/1) ... [2025-03-16 23:22:34,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:34" (1/1) ... [2025-03-16 23:22:34,293 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:22:34,294 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:22:34,297 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:22:34,297 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:22:34,298 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:34" (1/1) ... [2025-03-16 23:22:34,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:22:34,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:22:34,323 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) [2025-03-16 23:22:34,326 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 [2025-03-16 23:22:34,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:22:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:22:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:22:34,345 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:22:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:22:34,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:22:34,405 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:22:34,407 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:22:57,572 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-16 23:22:57,572 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:22:57,582 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:22:57,582 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:22:57,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:22:57 BoogieIcfgContainer [2025-03-16 23:22:57,582 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:22:57,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:22:57,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:22:57,588 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:22:57,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:22:33" (1/3) ... [2025-03-16 23:22:57,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e68793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:22:57, skipping insertion in model container [2025-03-16 23:22:57,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:34" (2/3) ... [2025-03-16 23:22:57,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e68793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:22:57, skipping insertion in model container [2025-03-16 23:22:57,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:22:57" (3/3) ... [2025-03-16 23:22:57,591 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-6.i [2025-03-16 23:22:57,600 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:22:57,601 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-6.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:22:57,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:22:57,651 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;@7ea03929, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:22:57,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:22:57,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 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) [2025-03-16 23:22:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-16 23:22:57,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:22:57,662 INFO L218 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, 1, 1, 1, 1, 1] [2025-03-16 23:22:57,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:22:57,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:22:57,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1294679803, now seen corresponding path program 1 times [2025-03-16 23:22:57,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:22:57,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845374913] [2025-03-16 23:22:57,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:22:57,674 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 [2025-03-16 23:22:57,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:22:57,677 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) [2025-03-16 23:22:57,678 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 [2025-03-16 23:22:57,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 23:22:58,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 23:22:58,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:22:58,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:22:58,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:22:58,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:22:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-16 23:22:58,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:22:58,451 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:22:58,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845374913] [2025-03-16 23:22:58,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845374913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:22:58,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:22:58,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:22:58,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694404705] [2025-03-16 23:22:58,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:22:58,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:22:58,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:22:58,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:22:58,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:22:58,469 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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) [2025-03-16 23:22:58,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:22:58,484 INFO L93 Difference]: Finished difference Result 109 states and 187 transitions. [2025-03-16 23:22:58,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:22:58,486 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (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 120 [2025-03-16 23:22:58,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:22:58,490 INFO L225 Difference]: With dead ends: 109 [2025-03-16 23:22:58,490 INFO L226 Difference]: Without dead ends: 54 [2025-03-16 23:22:58,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:22:58,494 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:22:58,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:22:58,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-16 23:22:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-16 23:22:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 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) [2025-03-16 23:22:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 81 transitions. [2025-03-16 23:22:58,525 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 81 transitions. Word has length 120 [2025-03-16 23:22:58,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:22:58,525 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 81 transitions. [2025-03-16 23:22:58,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (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) [2025-03-16 23:22:58,526 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 81 transitions. [2025-03-16 23:22:58,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-16 23:22:58,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:22:58,528 INFO L218 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, 1, 1, 1, 1, 1] [2025-03-16 23:22:58,552 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 [2025-03-16 23:22:58,729 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 [2025-03-16 23:22:58,729 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:22:58,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:22:58,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2007508006, now seen corresponding path program 1 times [2025-03-16 23:22:58,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:22:58,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619524796] [2025-03-16 23:22:58,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:22:58,731 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 [2025-03-16 23:22:58,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:22:58,734 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) [2025-03-16 23:22:58,735 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 [2025-03-16 23:22:58,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 23:22:59,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 23:22:59,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:22:59,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:22:59,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 23:22:59,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:23:00,456 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 120 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-16 23:23:00,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:23:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-16 23:23:02,416 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:23:02,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619524796] [2025-03-16 23:23:02,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1619524796] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:23:02,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 23:23:02,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-16 23:23:02,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798876836] [2025-03-16 23:23:02,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 23:23:02,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:23:02,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:23:02,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:23:02,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:23:02,422 INFO L87 Difference]: Start difference. First operand 54 states and 81 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-16 23:23:08,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:23:12,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:23:16,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:23:21,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:23:25,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:23:29,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:23:29,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:23:29,019 INFO L93 Difference]: Finished difference Result 113 states and 166 transitions. [2025-03-16 23:23:29,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:23:29,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 120 [2025-03-16 23:23:29,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:23:29,131 INFO L225 Difference]: With dead ends: 113 [2025-03-16 23:23:29,131 INFO L226 Difference]: Without dead ends: 60 [2025-03-16 23:23:29,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:23:29,132 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 182 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 176 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.9s IncrementalHoareTripleChecker+Time [2025-03-16 23:23:29,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 127 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 104 Invalid, 6 Unknown, 0 Unchecked, 25.9s Time] [2025-03-16 23:23:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-16 23:23:29,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-03-16 23:23:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-16 23:23:29,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2025-03-16 23:23:29,144 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 83 transitions. Word has length 120 [2025-03-16 23:23:29,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:23:29,145 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 83 transitions. [2025-03-16 23:23:29,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-16 23:23:29,145 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 83 transitions. [2025-03-16 23:23:29,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 23:23:29,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:23:29,147 INFO L218 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, 1, 1, 1, 1, 1, 1] [2025-03-16 23:23:29,176 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 (3)] Ended with exit code 0 [2025-03-16 23:23:29,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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 [2025-03-16 23:23:29,348 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:23:29,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:23:29,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2104161310, now seen corresponding path program 1 times [2025-03-16 23:23:29,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:23:29,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193327956] [2025-03-16 23:23:29,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:23:29,349 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 [2025-03-16 23:23:29,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:23:29,352 INFO L229 MonitoredProcess]: Starting monitored process 4 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) [2025-03-16 23:23:29,352 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 (4)] Waiting until timeout for monitored process [2025-03-16 23:23:29,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 23:23:30,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 23:23:30,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:23:30,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:23:30,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 23:23:30,490 INFO L279 TraceCheckSpWp]: Computing forward predicates...