./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-12.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_loopvsstraightlinecode_50-1loop_file-12.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 43ef9dd1eebc45a3917d5e3d4342b9d2cd1c6c3fdb5b8922c30fd1b1edca8c87 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:46:51,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:46:51,703 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:46:51,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:46:51,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:46:51,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:46:51,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:46:51,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:46:51,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:46:51,725 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:46:51,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:46:51,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:46:51,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:46:51,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:46:51,726 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:46:51,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:46:51,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:46:51,726 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:46:51,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:46:51,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:46:51,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:46:51,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:46:51,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:46:51,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:46:51,727 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:46:51,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:46:51,727 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:46:51,727 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:46:51,727 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:46:51,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:46:51,728 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:46:51,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:46:51,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:46:51,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:46:51,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:46:51,728 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:46:51,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:46:51,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:46:51,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:46:51,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:46:51,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:46:51,729 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:46:51,729 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:46:51,729 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 -> 43ef9dd1eebc45a3917d5e3d4342b9d2cd1c6c3fdb5b8922c30fd1b1edca8c87 [2025-03-17 03:46:51,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:46:51,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:46:51,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:46:51,978 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:46:51,979 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:46:51,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-12.i [2025-03-17 03:46:53,148 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b42396548/50c3d99c90ac4990b4720c577b42f26d/FLAGce51c5e55 [2025-03-17 03:46:53,403 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:46:53,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-12.i [2025-03-17 03:46:53,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b42396548/50c3d99c90ac4990b4720c577b42f26d/FLAGce51c5e55 [2025-03-17 03:46:53,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b42396548/50c3d99c90ac4990b4720c577b42f26d [2025-03-17 03:46:53,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:46:53,724 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:46:53,725 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:46:53,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:46:53,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:46:53,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:46:53" (1/1) ... [2025-03-17 03:46:53,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70be4a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:53, skipping insertion in model container [2025-03-17 03:46:53,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:46:53" (1/1) ... [2025-03-17 03:46:53,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:46:53,845 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-12.i[915,928] [2025-03-17 03:46:53,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:46:53,906 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:46:53,916 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-12.i[915,928] [2025-03-17 03:46:53,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:46:53,966 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:46:53,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:53 WrapperNode [2025-03-17 03:46:53,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:46:53,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:46:53,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:46:53,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:46:53,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:53" (1/1) ... [2025-03-17 03:46:53,982 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:53" (1/1) ... [2025-03-17 03:46:54,019 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2025-03-17 03:46:54,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:46:54,023 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:46:54,023 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:46:54,023 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:46:54,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:53" (1/1) ... [2025-03-17 03:46:54,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:53" (1/1) ... [2025-03-17 03:46:54,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:53" (1/1) ... [2025-03-17 03:46:54,047 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-17 03:46:54,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:53" (1/1) ... [2025-03-17 03:46:54,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:53" (1/1) ... [2025-03-17 03:46:54,053 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:53" (1/1) ... [2025-03-17 03:46:54,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:53" (1/1) ... [2025-03-17 03:46:54,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:53" (1/1) ... [2025-03-17 03:46:54,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:53" (1/1) ... [2025-03-17 03:46:54,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:46:54,058 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:46:54,058 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:46:54,058 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:46:54,059 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:53" (1/1) ... [2025-03-17 03:46:54,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:46:54,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:46:54,081 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-17 03:46:54,083 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-17 03:46:54,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:46:54,098 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:46:54,098 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:46:54,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:46:54,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:46:54,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:46:54,152 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:46:54,153 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:46:54,407 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 03:46:54,409 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:46:54,418 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:46:54,419 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:46:54,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:46:54 BoogieIcfgContainer [2025-03-17 03:46:54,419 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:46:54,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:46:54,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:46:54,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:46:54,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:46:53" (1/3) ... [2025-03-17 03:46:54,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343d5830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:46:54, skipping insertion in model container [2025-03-17 03:46:54,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:53" (2/3) ... [2025-03-17 03:46:54,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343d5830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:46:54, skipping insertion in model container [2025-03-17 03:46:54,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:46:54" (3/3) ... [2025-03-17 03:46:54,426 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-12.i [2025-03-17 03:46:54,437 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:46:54,439 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-12.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:46:54,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:46:54,494 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;@76fddd34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:46:54,495 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:46:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 03:46:54,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 03:46:54,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:46:54,509 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:46:54,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:46:54,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:46:54,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1994258437, now seen corresponding path program 1 times [2025-03-17 03:46:54,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:46:54,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811549145] [2025-03-17 03:46:54,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:46:54,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:46:54,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 03:46:54,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 03:46:54,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:46:54,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:46:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-17 03:46:54,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:46:54,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811549145] [2025-03-17 03:46:54,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811549145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:46:54,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613818171] [2025-03-17 03:46:54,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:46:54,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:46:54,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:46:54,755 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-17 03:46:54,757 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-17 03:46:54,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 03:46:54,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 03:46:54,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:46:54,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:46:54,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:46:54,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:46:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-17 03:46:54,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:46:54,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613818171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:46:54,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:46:54,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:46:54,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474310388] [2025-03-17 03:46:54,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:46:54,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:46:54,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:46:54,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:46:54,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:46:54,959 INFO L87 Difference]: Start difference. First operand has 60 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 03:46:54,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:46:54,978 INFO L93 Difference]: Finished difference Result 119 states and 208 transitions. [2025-03-17 03:46:54,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:46:54,980 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 141 [2025-03-17 03:46:54,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:46:54,984 INFO L225 Difference]: With dead ends: 119 [2025-03-17 03:46:54,984 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 03:46:54,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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-17 03:46:54,989 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:46:54,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:46:54,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 03:46:55,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-17 03:46:55,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 03:46:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 89 transitions. [2025-03-17 03:46:55,016 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 89 transitions. Word has length 141 [2025-03-17 03:46:55,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:46:55,017 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 89 transitions. [2025-03-17 03:46:55,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 03:46:55,017 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 89 transitions. [2025-03-17 03:46:55,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 03:46:55,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:46:55,019 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:46:55,026 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-17 03:46:55,219 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-17 03:46:55,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:46:55,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:46:55,221 INFO L85 PathProgramCache]: Analyzing trace with hash 754113436, now seen corresponding path program 1 times [2025-03-17 03:46:55,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:46:55,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875565765] [2025-03-17 03:46:55,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:46:55,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:46:55,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 03:46:55,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 03:46:55,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:46:55,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:46:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 03:46:55,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:46:55,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875565765] [2025-03-17 03:46:55,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875565765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:46:55,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:46:55,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:46:55,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783770911] [2025-03-17 03:46:55,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:46:55,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:46:55,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:46:55,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:46:55,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:46:55,986 INFO L87 Difference]: Start difference. First operand 58 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 03:46:56,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:46:56,214 INFO L93 Difference]: Finished difference Result 173 states and 266 transitions. [2025-03-17 03:46:56,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:46:56,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 141 [2025-03-17 03:46:56,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:46:56,216 INFO L225 Difference]: With dead ends: 173 [2025-03-17 03:46:56,216 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 03:46:56,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:46:56,217 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 46 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:46:56,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 276 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:46:56,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 03:46:56,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2025-03-17 03:46:56,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-17 03:46:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 153 transitions. [2025-03-17 03:46:56,242 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 153 transitions. Word has length 141 [2025-03-17 03:46:56,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:46:56,242 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 153 transitions. [2025-03-17 03:46:56,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 03:46:56,243 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 153 transitions. [2025-03-17 03:46:56,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 03:46:56,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:46:56,245 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:46:56,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:46:56,246 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:46:56,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:46:56,246 INFO L85 PathProgramCache]: Analyzing trace with hash 215215843, now seen corresponding path program 1 times [2025-03-17 03:46:56,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:46:56,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010990060] [2025-03-17 03:46:56,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:46:56,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:46:56,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 03:46:56,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 03:46:56,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:46:56,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:46:56,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [418119653] [2025-03-17 03:46:56,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:46:56,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:46:56,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:46:56,374 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-17 03:46:56,375 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-17 03:46:56,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 03:46:56,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 03:46:56,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:46:56,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:46:56,736 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:46:56,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 03:46:56,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 03:46:56,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:46:56,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:46:56,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:46:56,871 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:46:56,871 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:46:56,881 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-17 03:46:57,074 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,SelfDestructingSolverStorable2 [2025-03-17 03:46:57,077 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 03:46:57,148 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:46:57,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:46:57 BoogieIcfgContainer [2025-03-17 03:46:57,152 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:46:57,153 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:46:57,153 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:46:57,153 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:46:57,153 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:46:54" (3/4) ... [2025-03-17 03:46:57,155 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:46:57,156 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:46:57,156 INFO L158 Benchmark]: Toolchain (without parser) took 3431.65ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 83.6MB in the end (delta: 23.4MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2025-03-17 03:46:57,156 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:46:57,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.33ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 92.4MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:46:57,157 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.49ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 89.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:46:57,157 INFO L158 Benchmark]: Boogie Preprocessor took 34.20ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 84.0MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:46:57,157 INFO L158 Benchmark]: IcfgBuilder took 361.29ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 60.5MB in the end (delta: 23.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:46:57,157 INFO L158 Benchmark]: TraceAbstraction took 2731.18ms. Allocated memory is still 142.6MB. Free memory was 60.5MB in the beginning and 84.9MB in the end (delta: -24.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:46:57,157 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 83.6MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:46:57,158 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.91ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.33ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 92.4MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.49ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 89.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.20ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 84.0MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 361.29ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 60.5MB in the end (delta: 23.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2731.18ms. Allocated memory is still 142.6MB. Free memory was 60.5MB in the beginning and 84.9MB in the end (delta: -24.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 83.6MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. 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 someBinaryArithmeticDOUBLEoperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 132, overapproximation of someBinaryFLOATComparisonOperation at line 112, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someUnaryDOUBLEoperation at line 35, overapproximation of someBinaryDOUBLEComparisonOperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 132. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] unsigned char var_1_5 = 128; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 0; [L26] signed long int var_1_8 = 128; [L27] signed long int var_1_9 = 1967984875; [L28] float var_1_10 = 256.625; [L29] float var_1_11 = 24.5; [L30] float var_1_12 = 999999.25; [L31] unsigned char var_1_13 = 1; [L32] unsigned char var_1_14 = 0; [L33] double var_1_15 = 127.3; [L34] float var_1_16 = 15.8; [L35] double var_1_17 = -0.4; [L36] unsigned long int var_1_18 = 8; [L37] unsigned long int var_1_19 = 2366774301; [L38] unsigned char var_1_20 = 0; [L39] signed short int var_1_21 = 5; [L40] signed char var_1_22 = 0; [L41] signed char var_1_23 = 2; [L42] unsigned char last_1_var_1_1 = 5; [L43] unsigned long int last_1_var_1_18 = 8; [L44] signed char last_1_var_1_22 = 0; [L136] isInitial = 1 [L137] FCALL initially() [L138] int k_loop; [L139] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=128, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L139] COND TRUE k_loop < 1 [L140] CALL updateLastVariables() [L127] last_1_var_1_1 = var_1_1 [L128] last_1_var_1_18 = var_1_18 [L129] last_1_var_1_22 = var_1_22 [L140] RET updateLastVariables() [L141] CALL updateVariables() [L89] var_1_5 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_5 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L90] RET assume_abort_if_not(var_1_5 >= 127) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L91] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L91] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L92] var_1_6 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L93] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L94] CALL assume_abort_if_not(var_1_6 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L94] RET assume_abort_if_not(var_1_6 <= 64) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L95] var_1_7 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_8=128, var_1_9=1967984875] [L96] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_8=128, var_1_9=1967984875] [L97] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1967984875] [L97] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1967984875] [L98] var_1_9 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_9 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L99] RET assume_abort_if_not(var_1_9 >= 1073741822) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L100] CALL assume_abort_if_not(var_1_9 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L100] RET assume_abort_if_not(var_1_9 <= 2147483646) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L101] var_1_11 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L102] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L103] var_1_12 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L104] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L105] var_1_13 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L106] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L107] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L107] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L108] var_1_14 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L109] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L110] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L110] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L111] var_1_16 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L112] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L113] CALL assume_abort_if_not(var_1_16 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L113] RET assume_abort_if_not(var_1_16 != 0.0F) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L114] var_1_17 = __VERIFIER_nondet_double() [L115] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L115] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L116] var_1_19 = __VERIFIER_nondet_ulong() [L117] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L117] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L118] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L118] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L119] var_1_20 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L120] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L121] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L121] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L122] var_1_23 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_23 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L123] RET assume_abort_if_not(var_1_23 >= -63) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L124] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L124] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L141] RET updateVariables() [L142] CALL step() [L48] unsigned char stepLocal_2 = var_1_9 >= last_1_var_1_22; [L49] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, stepLocal_1=5, stepLocal_2=1, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L50] COND FALSE !(stepLocal_1 > last_1_var_1_18) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, stepLocal_2=1, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L53] COND TRUE var_1_20 || stepLocal_2 [L54] var_1_18 = var_1_6 VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=-2147483649, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L59] COND TRUE last_1_var_1_1 > (var_1_18 * var_1_18) [L60] var_1_1 = (var_1_5 - (var_1_6 + var_1_7)) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=-2147483649, var_1_1=189, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L64] var_1_21 = ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) [L65] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, stepLocal_0=-1790, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=-2147483649, var_1_1=189, var_1_20=1, var_1_21=63, var_1_22=0, var_1_23=-63, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L66] COND TRUE (- var_1_18) > stepLocal_0 [L67] var_1_8 = ((var_1_9 - var_1_21) - var_1_5) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=-2147483649, var_1_1=189, var_1_20=1, var_1_21=63, var_1_22=0, var_1_23=-63, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=1073741505, var_1_9=1073741822] [L69] signed long int stepLocal_3 = var_1_8; VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, stepLocal_3=1073741505, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=-2147483649, var_1_1=189, var_1_20=1, var_1_21=63, var_1_22=0, var_1_23=-63, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=1073741505, var_1_9=1073741822] [L70] COND FALSE !(var_1_18 == stepLocal_3) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=-2147483649, var_1_1=189, var_1_20=1, var_1_21=63, var_1_22=0, var_1_23=-63, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=1073741505, var_1_9=1073741822] [L77] COND TRUE var_1_8 != ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5))) [L78] var_1_10 = ((((var_1_11) > (var_1_12)) ? (var_1_11) : (var_1_12))) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=-2147483649, var_1_1=189, var_1_20=1, var_1_21=63, var_1_22=0, var_1_23=-63, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=1073741505, var_1_9=1073741822] [L84] COND TRUE (var_1_12 / var_1_16) >= var_1_10 [L85] var_1_15 = (var_1_17 + 255.5) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=0, var_1_18=2, var_1_19=-2147483649, var_1_1=189, var_1_20=1, var_1_21=63, var_1_22=0, var_1_23=-63, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=1073741505, var_1_9=1073741822] [L142] RET step() [L143] CALL, EXPR property() [L132-L133] return (((((((last_1_var_1_1 > (var_1_18 * var_1_18)) ? (var_1_1 == ((unsigned char) (var_1_5 - (var_1_6 + var_1_7)))) : (var_1_1 == ((unsigned char) ((((var_1_7) < ((((((16) < 0 ) ? -(16) : (16))) + var_1_6))) ? (var_1_7) : ((((((16) < 0 ) ? -(16) : (16))) + var_1_6))))))) && (((- var_1_18) > var_1_6) ? (var_1_8 == ((signed long int) ((var_1_9 - var_1_21) - var_1_5))) : 1)) && ((var_1_8 != ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5)))) ? (var_1_10 == ((float) ((((var_1_11) > (var_1_12)) ? (var_1_11) : (var_1_12))))) : ((var_1_13 || var_1_14) ? (var_1_10 == ((float) var_1_11)) : 1))) && (((var_1_12 / var_1_16) >= var_1_10) ? (var_1_15 == ((double) (var_1_17 + 255.5))) : 1)) && ((last_1_var_1_1 > last_1_var_1_18) ? (var_1_18 == ((unsigned long int) ((((var_1_9) < ((var_1_19 - var_1_6))) ? (var_1_9) : ((var_1_19 - var_1_6)))))) : ((var_1_20 || (var_1_9 >= last_1_var_1_22)) ? (var_1_18 == ((unsigned long int) var_1_6)) : (var_1_18 == ((unsigned long int) var_1_7))))) && (var_1_21 == ((signed short int) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))))) && ((var_1_18 == var_1_8) ? ((! var_1_20) ? (var_1_22 == ((signed char) ((((var_1_6) > ((5 - var_1_7))) ? (var_1_6) : ((5 - var_1_7)))))) : (var_1_22 == ((signed char) (var_1_7 + var_1_23)))) : 1) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=0, var_1_18=2, var_1_19=-2147483649, var_1_1=189, var_1_20=1, var_1_21=63, var_1_22=0, var_1_23=-63, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=1073741505, var_1_9=1073741822] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=0, var_1_18=2, var_1_19=-2147483649, var_1_1=189, var_1_20=1, var_1_21=63, var_1_22=0, var_1_23=-63, var_1_5=254, var_1_6=-1790, var_1_7=-193, var_1_8=1073741505, var_1_9=1073741822] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 116 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 367 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 193 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78 IncrementalHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 174 mSDtfsCounter, 78 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=2, InterpolantAutomatonStates: 7, 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, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 707 NumberOfCodeBlocks, 707 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 420 ConstructedInterpolants, 0 QuantifiedInterpolants, 924 SizeOfPredicates, 0 NumberOfNonLiveVariables, 334 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2992/3036 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-17 03:46:57,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_loopvsstraightlinecode_50-1loop_file-12.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 43ef9dd1eebc45a3917d5e3d4342b9d2cd1c6c3fdb5b8922c30fd1b1edca8c87 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:46:59,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:46:59,192 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:46:59,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:46:59,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:46:59,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:46:59,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:46:59,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:46:59,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:46:59,227 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:46:59,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:46:59,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:46:59,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:46:59,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:46:59,228 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:46:59,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:46:59,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:46:59,228 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:46:59,228 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:46:59,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:46:59,228 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:46:59,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:46:59,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:46:59,229 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:46:59,229 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:46:59,229 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:46:59,229 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:46:59,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:46:59,230 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:46:59,230 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:46:59,230 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:46:59,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:46:59,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:46:59,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:46:59,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:46:59,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:46:59,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:46:59,230 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:46:59,230 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:46:59,230 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:46:59,230 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:46:59,230 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:46:59,230 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:46:59,230 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:46:59,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:46:59,231 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 -> 43ef9dd1eebc45a3917d5e3d4342b9d2cd1c6c3fdb5b8922c30fd1b1edca8c87 [2025-03-17 03:46:59,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:46:59,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:46:59,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:46:59,492 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:46:59,492 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:46:59,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-12.i [2025-03-17 03:47:00,713 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe51d50c5/93ad4c49428c444281b2f59d556958d1/FLAG70baefffe [2025-03-17 03:47:00,928 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:47:00,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-12.i [2025-03-17 03:47:00,937 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe51d50c5/93ad4c49428c444281b2f59d556958d1/FLAG70baefffe [2025-03-17 03:47:00,953 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe51d50c5/93ad4c49428c444281b2f59d556958d1 [2025-03-17 03:47:00,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:47:00,958 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:47:00,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:47:00,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:47:00,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:47:00,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:47:00" (1/1) ... [2025-03-17 03:47:00,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b44defa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:00, skipping insertion in model container [2025-03-17 03:47:00,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:47:00" (1/1) ... [2025-03-17 03:47:00,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:47:01,091 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-12.i[915,928] [2025-03-17 03:47:01,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:47:01,157 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:47:01,165 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-12.i[915,928] [2025-03-17 03:47:01,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:47:01,203 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:47:01,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:01 WrapperNode [2025-03-17 03:47:01,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:47:01,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:47:01,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:47:01,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:47:01,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:01" (1/1) ... [2025-03-17 03:47:01,222 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:01" (1/1) ... [2025-03-17 03:47:01,245 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2025-03-17 03:47:01,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:47:01,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:47:01,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:47:01,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:47:01,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:01" (1/1) ... [2025-03-17 03:47:01,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:01" (1/1) ... [2025-03-17 03:47:01,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:01" (1/1) ... [2025-03-17 03:47:01,285 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-17 03:47:01,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:01" (1/1) ... [2025-03-17 03:47:01,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:01" (1/1) ... [2025-03-17 03:47:01,296 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:01" (1/1) ... [2025-03-17 03:47:01,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:01" (1/1) ... [2025-03-17 03:47:01,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:01" (1/1) ... [2025-03-17 03:47:01,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:01" (1/1) ... [2025-03-17 03:47:01,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:47:01,309 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:47:01,309 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:47:01,309 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:47:01,313 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:01" (1/1) ... [2025-03-17 03:47:01,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:47:01,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:47:01,342 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-17 03:47:01,345 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-17 03:47:01,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:47:01,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:47:01,365 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:47:01,365 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:47:01,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:47:01,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:47:01,428 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:47:01,430 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:47:05,491 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 03:47:05,492 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:47:05,511 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:47:05,511 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:47:05,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:47:05 BoogieIcfgContainer [2025-03-17 03:47:05,512 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:47:05,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:47:05,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:47:05,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:47:05,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:47:00" (1/3) ... [2025-03-17 03:47:05,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4455ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:47:05, skipping insertion in model container [2025-03-17 03:47:05,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:01" (2/3) ... [2025-03-17 03:47:05,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4455ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:47:05, skipping insertion in model container [2025-03-17 03:47:05,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:47:05" (3/3) ... [2025-03-17 03:47:05,520 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-12.i [2025-03-17 03:47:05,529 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:47:05,530 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-12.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:47:05,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:47:05,576 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;@419e1131, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:47:05,576 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:47:05,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 03:47:05,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 03:47:05,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:47:05,588 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:47:05,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:47:05,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:47:05,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1994258437, now seen corresponding path program 1 times [2025-03-17 03:47:05,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:47:05,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126449317] [2025-03-17 03:47:05,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:47:05,599 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-17 03:47:05,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:47:05,601 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-17 03:47:05,602 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-17 03:47:05,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 03:47:05,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 03:47:05,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:47:05,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:47:05,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:47:05,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:47:05,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-03-17 03:47:05,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:47:05,991 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:47:05,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126449317] [2025-03-17 03:47:05,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126449317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:47:05,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:47:05,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:47:05,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827230984] [2025-03-17 03:47:05,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:47:05,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:47:05,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:47:06,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:47:06,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:47:06,009 INFO L87 Difference]: Start difference. First operand has 60 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 03:47:06,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:47:06,031 INFO L93 Difference]: Finished difference Result 119 states and 208 transitions. [2025-03-17 03:47:06,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:47:06,033 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 141 [2025-03-17 03:47:06,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:47:06,038 INFO L225 Difference]: With dead ends: 119 [2025-03-17 03:47:06,038 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 03:47:06,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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-17 03:47:06,044 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:47:06,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:47:06,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 03:47:06,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-17 03:47:06,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 03:47:06,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 89 transitions. [2025-03-17 03:47:06,078 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 89 transitions. Word has length 141 [2025-03-17 03:47:06,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:47:06,079 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 89 transitions. [2025-03-17 03:47:06,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 03:47:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 89 transitions. [2025-03-17 03:47:06,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 03:47:06,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:47:06,083 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:47:06,095 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-17 03:47:06,284 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-17 03:47:06,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:47:06,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:47:06,285 INFO L85 PathProgramCache]: Analyzing trace with hash 754113436, now seen corresponding path program 1 times [2025-03-17 03:47:06,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:47:06,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329691219] [2025-03-17 03:47:06,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:47:06,286 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-17 03:47:06,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:47:06,288 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-17 03:47:06,288 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-17 03:47:06,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 03:47:06,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 03:47:06,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:47:06,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:47:06,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 03:47:06,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:47:08,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 03:47:08,323 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:47:08,324 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:47:08,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329691219] [2025-03-17 03:47:08,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [329691219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:47:08,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:47:08,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:47:08,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959170384] [2025-03-17 03:47:08,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:47:08,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:47:08,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:47:08,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:47:08,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:47:08,327 INFO L87 Difference]: Start difference. First operand 58 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 03:47:10,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:47:11,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:47:11,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:47:11,588 INFO L93 Difference]: Finished difference Result 173 states and 266 transitions. [2025-03-17 03:47:11,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:47:11,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 141 [2025-03-17 03:47:11,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:47:11,618 INFO L225 Difference]: With dead ends: 173 [2025-03-17 03:47:11,618 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 03:47:11,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:47:11,619 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 43 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:47:11,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 276 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-17 03:47:11,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 03:47:11,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2025-03-17 03:47:11,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-17 03:47:11,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 153 transitions. [2025-03-17 03:47:11,641 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 153 transitions. Word has length 141 [2025-03-17 03:47:11,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:47:11,641 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 153 transitions. [2025-03-17 03:47:11,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 03:47:11,641 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 153 transitions. [2025-03-17 03:47:11,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 03:47:11,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:47:11,647 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:47:11,657 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-17 03:47:11,847 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-17 03:47:11,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:47:11,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:47:11,848 INFO L85 PathProgramCache]: Analyzing trace with hash 215215843, now seen corresponding path program 1 times [2025-03-17 03:47:11,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:47:11,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324186964] [2025-03-17 03:47:11,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:47:11,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:47:11,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:47:11,852 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-17 03:47:11,853 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-17 03:47:11,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 03:47:12,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 03:47:12,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:47:12,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:47:12,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 03:47:12,174 INFO L279 TraceCheckSpWp]: Computing forward predicates...