./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_100-1loop_file-42.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 aeac736475d2e9b0ab566775f61df15337d707594a1ca30cedb7f4179e279e85 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:57:47,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:57:47,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:57:47,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:57:47,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:57:47,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:57:47,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:57:47,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:57:47,134 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:57:47,134 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:57:47,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:57:47,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:57:47,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:57:47,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:57:47,135 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:57:47,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:57:47,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:57:47,136 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:57:47,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:57:47,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:57:47,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:57:47,136 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:57:47,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:57:47,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:57:47,136 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:57:47,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:57:47,136 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:57:47,136 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:57:47,136 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:57:47,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:57:47,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:57:47,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:57:47,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:57:47,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:57:47,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:57:47,137 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:57:47,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:57:47,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:57:47,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:57:47,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:57:47,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:57:47,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:57:47,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:57:47,137 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 -> aeac736475d2e9b0ab566775f61df15337d707594a1ca30cedb7f4179e279e85 [2025-03-08 13:57:47,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:57:47,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:57:47,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:57:47,377 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:57:47,377 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:57:47,378 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-42.i [2025-03-08 13:57:48,502 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54bb7b090/5174b31f25324f529b6e005bb670d6af/FLAGd4bbbcbeb [2025-03-08 13:57:48,727 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:57:48,727 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-42.i [2025-03-08 13:57:48,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54bb7b090/5174b31f25324f529b6e005bb670d6af/FLAGd4bbbcbeb [2025-03-08 13:57:49,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54bb7b090/5174b31f25324f529b6e005bb670d6af [2025-03-08 13:57:49,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:57:49,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:57:49,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:57:49,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:57:49,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:57:49,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:57:49" (1/1) ... [2025-03-08 13:57:49,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71cf4d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:49, skipping insertion in model container [2025-03-08 13:57:49,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:57:49" (1/1) ... [2025-03-08 13:57:49,093 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:57:49,202 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_100-1loop_file-42.i[916,929] [2025-03-08 13:57:49,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:57:49,298 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:57:49,305 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_100-1loop_file-42.i[916,929] [2025-03-08 13:57:49,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:57:49,363 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:57:49,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:49 WrapperNode [2025-03-08 13:57:49,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:57:49,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:57:49,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:57:49,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:57:49,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:49" (1/1) ... [2025-03-08 13:57:49,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:49" (1/1) ... [2025-03-08 13:57:49,423 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2025-03-08 13:57:49,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:57:49,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:57:49,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:57:49,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:57:49,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:49" (1/1) ... [2025-03-08 13:57:49,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:49" (1/1) ... [2025-03-08 13:57:49,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:49" (1/1) ... [2025-03-08 13:57:49,465 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-08 13:57:49,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:49" (1/1) ... [2025-03-08 13:57:49,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:49" (1/1) ... [2025-03-08 13:57:49,474 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:49" (1/1) ... [2025-03-08 13:57:49,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:49" (1/1) ... [2025-03-08 13:57:49,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:49" (1/1) ... [2025-03-08 13:57:49,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:49" (1/1) ... [2025-03-08 13:57:49,491 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:57:49,492 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:57:49,492 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:57:49,492 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:57:49,493 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:49" (1/1) ... [2025-03-08 13:57:49,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:57:49,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:57:49,517 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-08 13:57:49,520 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-08 13:57:49,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:57:49,538 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:57:49,538 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:57:49,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:57:49,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:57:49,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:57:49,601 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:57:49,603 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:57:49,893 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L177: havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2025-03-08 13:57:49,919 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-08 13:57:49,920 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:57:49,936 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:57:49,937 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:57:49,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:57:49 BoogieIcfgContainer [2025-03-08 13:57:49,938 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:57:49,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:57:49,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:57:49,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:57:49,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:57:49" (1/3) ... [2025-03-08 13:57:49,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed69022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:57:49, skipping insertion in model container [2025-03-08 13:57:49,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:49" (2/3) ... [2025-03-08 13:57:49,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed69022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:57:49, skipping insertion in model container [2025-03-08 13:57:49,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:57:49" (3/3) ... [2025-03-08 13:57:49,946 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-42.i [2025-03-08 13:57:49,957 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:57:49,959 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-42.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:57:50,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:57:50,016 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;@5259fd28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:57:50,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:57:50,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:57:50,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 13:57:50,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:50,030 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:57:50,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:50,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:50,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1684401144, now seen corresponding path program 1 times [2025-03-08 13:57:50,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:50,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367022491] [2025-03-08 13:57:50,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:50,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:50,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 13:57:50,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 13:57:50,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:50,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 13:57:50,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:50,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367022491] [2025-03-08 13:57:50,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367022491] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:57:50,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121564520] [2025-03-08 13:57:50,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:50,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:50,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:57:50,306 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-08 13:57:50,307 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-08 13:57:50,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 13:57:50,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 13:57:50,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:50,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:50,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:57:50,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:57:50,454 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 13:57:50,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:57:50,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121564520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:57:50,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:57:50,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:57:50,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831443936] [2025-03-08 13:57:50,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:57:50,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:57:50,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:50,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:57:50,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:57:50,479 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 13:57:50,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:50,507 INFO L93 Difference]: Finished difference Result 157 states and 259 transitions. [2025-03-08 13:57:50,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:57:50,509 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 141 [2025-03-08 13:57:50,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:50,514 INFO L225 Difference]: With dead ends: 157 [2025-03-08 13:57:50,514 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 13:57:50,517 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-08 13:57:50,519 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:50,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:57:50,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 13:57:50,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-08 13:57:50,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 55 states have internal predecessors, (76), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:57:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 116 transitions. [2025-03-08 13:57:50,556 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 116 transitions. Word has length 141 [2025-03-08 13:57:50,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:50,557 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 116 transitions. [2025-03-08 13:57:50,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 13:57:50,558 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 116 transitions. [2025-03-08 13:57:50,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 13:57:50,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:50,563 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:57:50,570 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-08 13:57:50,764 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-08 13:57:50,764 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:50,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:50,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2043897800, now seen corresponding path program 1 times [2025-03-08 13:57:50,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:50,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403242175] [2025-03-08 13:57:50,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:50,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:50,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 13:57:50,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 13:57:50,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:50,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 13:57:51,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:51,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403242175] [2025-03-08 13:57:51,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403242175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:57:51,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:57:51,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 13:57:51,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478232197] [2025-03-08 13:57:51,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:57:51,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 13:57:51,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:51,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 13:57:51,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 13:57:51,475 INFO L87 Difference]: Start difference. First operand 77 states and 116 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 13:57:51,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:51,771 INFO L93 Difference]: Finished difference Result 226 states and 343 transitions. [2025-03-08 13:57:51,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 13:57:51,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-03-08 13:57:51,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:51,775 INFO L225 Difference]: With dead ends: 226 [2025-03-08 13:57:51,775 INFO L226 Difference]: Without dead ends: 152 [2025-03-08 13:57:51,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:57:51,776 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 93 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:51,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 414 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:57:51,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-08 13:57:51,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 121. [2025-03-08 13:57:51,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 13:57:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 181 transitions. [2025-03-08 13:57:51,812 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 181 transitions. Word has length 141 [2025-03-08 13:57:51,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:51,813 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 181 transitions. [2025-03-08 13:57:51,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 13:57:51,813 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 181 transitions. [2025-03-08 13:57:51,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 13:57:51,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:51,816 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:57:51,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:57:51,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:51,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:51,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1685142391, now seen corresponding path program 1 times [2025-03-08 13:57:51,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:51,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701350147] [2025-03-08 13:57:51,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:51,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:51,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 13:57:51,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 13:57:51,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:51,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 27 proven. 81 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2025-03-08 13:57:52,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:52,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701350147] [2025-03-08 13:57:52,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701350147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:57:52,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733170446] [2025-03-08 13:57:52,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:52,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:52,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:57:52,495 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-08 13:57:52,496 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-08 13:57:52,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 13:57:52,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 13:57:52,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:52,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:52,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 13:57:52,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:57:53,186 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 338 proven. 81 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2025-03-08 13:57:53,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:57:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 27 proven. 84 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-03-08 13:57:53,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733170446] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:57:53,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 13:57:53,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 17 [2025-03-08 13:57:53,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491942559] [2025-03-08 13:57:53,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 13:57:53,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 13:57:53,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:53,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 13:57:53,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2025-03-08 13:57:53,644 INFO L87 Difference]: Start difference. First operand 121 states and 181 transitions. Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 3 states have call successors, (35), 3 states have call predecessors, (35), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2025-03-08 13:57:54,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:54,021 INFO L93 Difference]: Finished difference Result 230 states and 322 transitions. [2025-03-08 13:57:54,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 13:57:54,022 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 3 states have call successors, (35), 3 states have call predecessors, (35), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) Word has length 142 [2025-03-08 13:57:54,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:54,023 INFO L225 Difference]: With dead ends: 230 [2025-03-08 13:57:54,023 INFO L226 Difference]: Without dead ends: 156 [2025-03-08 13:57:54,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 274 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=459, Unknown=0, NotChecked=0, Total=650 [2025-03-08 13:57:54,025 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 104 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:54,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 407 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:57:54,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-08 13:57:54,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2025-03-08 13:57:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.2105263157894737) internal successors, (115), 95 states have internal predecessors, (115), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 13:57:54,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 195 transitions. [2025-03-08 13:57:54,068 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 195 transitions. Word has length 142 [2025-03-08 13:57:54,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:54,069 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 195 transitions. [2025-03-08 13:57:54,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 3 states have call successors, (35), 3 states have call predecessors, (35), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2025-03-08 13:57:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 195 transitions. [2025-03-08 13:57:54,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 13:57:54,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:54,073 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:57:54,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 13:57:54,274 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-08 13:57:54,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:54,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:54,275 INFO L85 PathProgramCache]: Analyzing trace with hash -111808968, now seen corresponding path program 1 times [2025-03-08 13:57:54,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:54,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278480694] [2025-03-08 13:57:54,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:54,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:54,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 13:57:54,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 13:57:54,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:54,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 13:57:54,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1210825979] [2025-03-08 13:57:54,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:54,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:54,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:57:54,364 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:57:54,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 13:57:54,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 13:57:54,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 13:57:54,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:54,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:54,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 13:57:54,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:57:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 469 proven. 48 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-03-08 13:57:54,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:57:55,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:55,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278480694] [2025-03-08 13:57:55,246 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 13:57:55,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210825979] [2025-03-08 13:57:55,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210825979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:57:55,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:57:55,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-08 13:57:55,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552855142] [2025-03-08 13:57:55,247 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 13:57:55,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 13:57:55,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:55,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 13:57:55,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-03-08 13:57:55,248 INFO L87 Difference]: Start difference. First operand 144 states and 195 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 13:57:55,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:55,528 INFO L93 Difference]: Finished difference Result 275 states and 371 transitions. [2025-03-08 13:57:55,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 13:57:55,528 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 142 [2025-03-08 13:57:55,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:55,530 INFO L225 Difference]: With dead ends: 275 [2025-03-08 13:57:55,530 INFO L226 Difference]: Without dead ends: 190 [2025-03-08 13:57:55,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=426, Unknown=0, NotChecked=0, Total=650 [2025-03-08 13:57:55,531 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 169 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:55,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 372 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:57:55,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-08 13:57:55,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 160. [2025-03-08 13:57:55,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 109 states have (on average 1.2293577981651376) internal successors, (134), 109 states have internal predecessors, (134), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 13:57:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 214 transitions. [2025-03-08 13:57:55,555 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 214 transitions. Word has length 142 [2025-03-08 13:57:55,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:55,555 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 214 transitions. [2025-03-08 13:57:55,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 13:57:55,557 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 214 transitions. [2025-03-08 13:57:55,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 13:57:55,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:55,560 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:57:55,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 13:57:55,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:55,761 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:55,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:55,762 INFO L85 PathProgramCache]: Analyzing trace with hash -617367593, now seen corresponding path program 1 times [2025-03-08 13:57:55,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:55,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860680858] [2025-03-08 13:57:55,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:55,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:55,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 13:57:55,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 13:57:55,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:55,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 13:57:55,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [514187142] [2025-03-08 13:57:55,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:55,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:55,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:57:55,825 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:57:55,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 13:57:55,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 13:57:55,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 13:57:55,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:55,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:57:55,943 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:57:55,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 13:57:55,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 13:57:55,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:55,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:57:56,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:57:56,046 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:57:56,047 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:57:56,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 13:57:56,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:56,252 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 13:57:56,332 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:57:56,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:57:56 BoogieIcfgContainer [2025-03-08 13:57:56,337 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:57:56,338 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:57:56,338 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:57:56,338 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:57:56,338 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:57:49" (3/4) ... [2025-03-08 13:57:56,340 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:57:56,340 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:57:56,341 INFO L158 Benchmark]: Toolchain (without parser) took 7268.17ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 112.9MB in the beginning and 381.0MB in the end (delta: -268.1MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2025-03-08 13:57:56,341 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:57:56,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.02ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 96.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:57:56,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.47ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 91.2MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:57:56,341 INFO L158 Benchmark]: Boogie Preprocessor took 67.78ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 84.6MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:57:56,341 INFO L158 Benchmark]: IcfgBuilder took 445.83ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 54.0MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 13:57:56,341 INFO L158 Benchmark]: TraceAbstraction took 6398.02ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 53.5MB in the beginning and 381.0MB in the end (delta: -327.5MB). Peak memory consumption was 192.1MB. Max. memory is 16.1GB. [2025-03-08 13:57:56,342 INFO L158 Benchmark]: Witness Printer took 2.36ms. Allocated memory is still 427.8MB. Free memory is still 381.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:57:56,343 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.02ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 96.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.47ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 91.2MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 67.78ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 84.6MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 445.83ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 54.0MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6398.02ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 53.5MB in the beginning and 381.0MB in the end (delta: -327.5MB). Peak memory consumption was 192.1MB. Max. memory is 16.1GB. * Witness Printer took 2.36ms. Allocated memory is still 427.8MB. Free memory is still 381.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 82, overapproximation of someBinaryArithmeticDOUBLEoperation at line 74, overapproximation of someBinaryArithmeticDOUBLEoperation at line 63, overapproximation of someBinaryArithmeticDOUBLEoperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someBinaryFLOATComparisonOperation at line 167, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 177, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 177, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 140, overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 50.75; [L23] double var_1_3 = 8.5; [L24] double var_1_4 = 64.5; [L25] double var_1_5 = 9.3; [L26] unsigned char var_1_6 = 1; [L27] unsigned char var_1_8 = 0; [L28] unsigned char var_1_9 = 0; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 2; [L31] double var_1_12 = 127.6; [L32] unsigned char var_1_13 = 0; [L33] signed long int var_1_14 = 1; [L34] unsigned char var_1_15 = 128; [L35] unsigned char var_1_16 = 128; [L36] unsigned char var_1_17 = 1; [L37] unsigned char var_1_18 = 16; [L38] unsigned char var_1_19 = 0; [L39] signed char var_1_21 = -32; [L40] signed char var_1_22 = 2; [L41] double var_1_23 = 15.5; [L42] float var_1_24 = 2.625; [L43] double var_1_25 = 4.375; [L44] double var_1_26 = 2.35; [L45] double var_1_27 = 64.25; [L46] signed short int var_1_28 = -5; [L47] float var_1_29 = 0.0; [L48] unsigned char var_1_30 = 2; [L49] unsigned long int var_1_31 = 2; [L50] double last_1_var_1_1 = 50.75; [L51] unsigned char last_1_var_1_13 = 0; [L52] signed long int last_1_var_1_14 = 1; [L53] unsigned char last_1_var_1_15 = 128; [L54] unsigned char last_1_var_1_30 = 2; VAL [isInitial=0, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_3=17/2, var_1_4=129/2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L181] isInitial = 1 [L182] FCALL initially() [L183] int k_loop; [L184] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_3=17/2, var_1_4=129/2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L184] COND TRUE k_loop < 1 [L185] CALL updateLastVariables() [L170] last_1_var_1_1 = var_1_1 [L171] last_1_var_1_13 = var_1_13 [L172] last_1_var_1_14 = var_1_14 [L173] last_1_var_1_15 = var_1_15 [L174] last_1_var_1_30 = var_1_30 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_3=17/2, var_1_4=129/2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L185] RET updateLastVariables() [L186] CALL updateVariables() [L135] var_1_3 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_3 >= -230584.3009213691390e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 2305843.009213691390e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_4=129/2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_4=129/2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L136] RET assume_abort_if_not((var_1_3 >= -230584.3009213691390e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 2305843.009213691390e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_4=129/2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L137] var_1_4 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_4 >= -230584.3009213691390e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 2305843.009213691390e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L138] RET assume_abort_if_not((var_1_4 >= -230584.3009213691390e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 2305843.009213691390e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L139] var_1_5 = __VERIFIER_nondet_double() [L140] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L140] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L141] var_1_8 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_9=0] [L142] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_9=0] [L143] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L143] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L144] var_1_9 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0] [L145] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0] [L146] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L146] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L147] var_1_11 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L148] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L149] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L149] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L150] var_1_16 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_16 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L151] RET assume_abort_if_not(var_1_16 >= 127) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L152] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L152] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L153] var_1_17 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L154] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L155] CALL assume_abort_if_not(var_1_17 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L155] RET assume_abort_if_not(var_1_17 <= 127) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L156] var_1_18 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L157] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L158] CALL assume_abort_if_not(var_1_18 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L158] RET assume_abort_if_not(var_1_18 <= 127) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L159] var_1_22 = __VERIFIER_nondet_char() [L160] CALL assume_abort_if_not(var_1_22 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L160] RET assume_abort_if_not(var_1_22 >= -127) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L161] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L161] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L162] var_1_26 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L163] RET assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L164] var_1_27 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L165] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L166] var_1_29 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_29 >= 4611686.018427387900e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L167] RET assume_abort_if_not((var_1_29 >= 4611686.018427387900e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L186] RET updateVariables() [L187] CALL step() [L58] EXPR last_1_var_1_30 | ((((var_1_17) < (var_1_11)) ? (var_1_17) : (var_1_11))) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L58] signed long int stepLocal_1 = last_1_var_1_30 | ((((var_1_17) < (var_1_11)) ? (var_1_17) : (var_1_11))); [L59] COND FALSE !(last_1_var_1_14 > stepLocal_1) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L62] COND TRUE 99.3f <= var_1_3 [L63] var_1_25 = (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L68] COND TRUE var_1_25 <= var_1_4 [L69] var_1_15 = (var_1_16 - var_1_17) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L73] COND TRUE last_1_var_1_1 <= 2.25 [L74] var_1_1 = ((((2.5) < (((var_1_3 + var_1_4) + ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) ? (2.5) : (((var_1_3 + var_1_4) + ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L78] var_1_10 = var_1_11 [L79] var_1_12 = (var_1_3 + ((((1000000.75) < (var_1_5)) ? (1000000.75) : (var_1_5)))) [L80] var_1_23 = var_1_5 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=0, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=-32, var_1_22=5, var_1_23=2, var_1_24=21/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L81] COND TRUE 7.75 > (- var_1_12) [L82] var_1_24 = (var_1_3 + var_1_5) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=0, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=-32, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L86] var_1_30 = var_1_11 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=0, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=-32, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L87] COND TRUE ((((var_1_23) < (24.4f)) ? (var_1_23) : (24.4f))) != var_1_5 [L88] var_1_21 = ((((var_1_22) < (5)) ? (var_1_22) : (5))) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=0, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L90] COND FALSE !(var_1_17 == ((last_1_var_1_15 * var_1_16) + var_1_18)) [L93] var_1_19 = (var_1_8 && var_1_9) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=0, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L95] COND FALSE !(var_1_24 > var_1_25) [L106] var_1_13 = var_1_11 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L108] unsigned char stepLocal_0 = var_1_19 && var_1_8; VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, stepLocal_0=0, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L109] COND FALSE !(var_1_9 || stepLocal_0) [L112] var_1_14 = last_1_var_1_14 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L114] COND TRUE var_1_5 != (- var_1_4) [L115] var_1_6 = (var_1_19 && var_1_8) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=0, var_1_8=0, var_1_9=0] [L119] COND TRUE ((var_1_29 - 7.25f) - var_1_27) > var_1_23 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=0, var_1_8=0, var_1_9=0] [L120] COND TRUE var_1_26 != (var_1_23 * ((((var_1_29) < 0 ) ? -(var_1_29) : (var_1_29)))) [L121] var_1_28 = (var_1_14 + (((((var_1_16) > (var_1_13)) ? (var_1_16) : (var_1_13))) - (var_1_14 + var_1_11))) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=0, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=0, var_1_8=0, var_1_9=0] [L132] var_1_31 = var_1_14 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=0, var_1_30=127, var_1_31=1, var_1_5=2, var_1_6=0, var_1_8=0, var_1_9=0] [L187] RET step() [L188] CALL, EXPR property() [L177] EXPR ((((((((((((last_1_var_1_1 <= 2.25) ? (var_1_1 == ((double) ((((2.5) < (((var_1_3 + var_1_4) + ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) ? (2.5) : (((var_1_3 + var_1_4) + ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))))) : (var_1_1 == ((double) ((((((((7.6) > (var_1_3)) ? (7.6) : (var_1_3)))) > (var_1_4)) ? (((((7.6) > (var_1_3)) ? (7.6) : (var_1_3)))) : (var_1_4)))))) && ((var_1_5 != (- var_1_4)) ? (var_1_6 == ((unsigned char) (var_1_19 && var_1_8))) : (var_1_6 == ((unsigned char) var_1_9)))) && (var_1_10 == ((unsigned char) var_1_11))) && (var_1_12 == ((double) (var_1_3 + ((((1000000.75) < (var_1_5)) ? (1000000.75) : (var_1_5))))))) && ((var_1_24 > var_1_25) ? ((var_1_19 && var_1_9) ? ((var_1_11 > last_1_var_1_13) ? (var_1_13 == ((unsigned char) var_1_11)) : (var_1_13 == ((unsigned char) var_1_11))) : (var_1_13 == ((unsigned char) var_1_11))) : (var_1_13 == ((unsigned char) var_1_11)))) && ((var_1_9 || (var_1_19 && var_1_8)) ? (var_1_14 == ((signed long int) ((((((((var_1_11) > (var_1_13)) ? (var_1_11) : (var_1_13)))) < (last_1_var_1_14)) ? (((((var_1_11) > (var_1_13)) ? (var_1_11) : (var_1_13)))) : (last_1_var_1_14))))) : (var_1_14 == ((signed long int) last_1_var_1_14)))) && ((var_1_25 <= var_1_4) ? (var_1_15 == ((unsigned char) (var_1_16 - var_1_17))) : (var_1_15 == ((unsigned char) (var_1_17 + var_1_18))))) && ((var_1_17 == ((last_1_var_1_15 * var_1_16) + var_1_18)) ? (var_1_19 == ((unsigned char) (var_1_8 || var_1_9))) : (var_1_19 == ((unsigned char) (var_1_8 && var_1_9))))) && ((((((var_1_23) < (24.4f)) ? (var_1_23) : (24.4f))) != var_1_5) ? (var_1_21 == ((signed char) ((((var_1_22) < (5)) ? (var_1_22) : (5))))) : 1)) && (var_1_23 == ((double) var_1_5))) && ((7.75 > (- var_1_12)) ? (var_1_24 == ((float) (var_1_3 + var_1_5))) : (var_1_24 == ((float) ((((9999.2f) < ((var_1_5 + var_1_4))) ? (9999.2f) : ((var_1_5 + var_1_4)))))))) && ((last_1_var_1_14 > (last_1_var_1_30 | ((((var_1_17) < (var_1_11)) ? (var_1_17) : (var_1_11))))) ? (var_1_25 == ((double) ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) < (var_1_3)) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : (var_1_3))))) : ((99.3f <= var_1_3) ? (var_1_25 == ((double) (var_1_4 + var_1_5))) : (var_1_25 == ((double) (((((var_1_3 + (var_1_26 - var_1_27))) > (var_1_4)) ? ((var_1_3 + (var_1_26 - var_1_27))) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=0, var_1_30=127, var_1_31=1, var_1_5=2, var_1_6=0, var_1_8=0, var_1_9=0] [L177-L178] return (((((((((((((((last_1_var_1_1 <= 2.25) ? (var_1_1 == ((double) ((((2.5) < (((var_1_3 + var_1_4) + ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) ? (2.5) : (((var_1_3 + var_1_4) + ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))))) : (var_1_1 == ((double) ((((((((7.6) > (var_1_3)) ? (7.6) : (var_1_3)))) > (var_1_4)) ? (((((7.6) > (var_1_3)) ? (7.6) : (var_1_3)))) : (var_1_4)))))) && ((var_1_5 != (- var_1_4)) ? (var_1_6 == ((unsigned char) (var_1_19 && var_1_8))) : (var_1_6 == ((unsigned char) var_1_9)))) && (var_1_10 == ((unsigned char) var_1_11))) && (var_1_12 == ((double) (var_1_3 + ((((1000000.75) < (var_1_5)) ? (1000000.75) : (var_1_5))))))) && ((var_1_24 > var_1_25) ? ((var_1_19 && var_1_9) ? ((var_1_11 > last_1_var_1_13) ? (var_1_13 == ((unsigned char) var_1_11)) : (var_1_13 == ((unsigned char) var_1_11))) : (var_1_13 == ((unsigned char) var_1_11))) : (var_1_13 == ((unsigned char) var_1_11)))) && ((var_1_9 || (var_1_19 && var_1_8)) ? (var_1_14 == ((signed long int) ((((((((var_1_11) > (var_1_13)) ? (var_1_11) : (var_1_13)))) < (last_1_var_1_14)) ? (((((var_1_11) > (var_1_13)) ? (var_1_11) : (var_1_13)))) : (last_1_var_1_14))))) : (var_1_14 == ((signed long int) last_1_var_1_14)))) && ((var_1_25 <= var_1_4) ? (var_1_15 == ((unsigned char) (var_1_16 - var_1_17))) : (var_1_15 == ((unsigned char) (var_1_17 + var_1_18))))) && ((var_1_17 == ((last_1_var_1_15 * var_1_16) + var_1_18)) ? (var_1_19 == ((unsigned char) (var_1_8 || var_1_9))) : (var_1_19 == ((unsigned char) (var_1_8 && var_1_9))))) && ((((((var_1_23) < (24.4f)) ? (var_1_23) : (24.4f))) != var_1_5) ? (var_1_21 == ((signed char) ((((var_1_22) < (5)) ? (var_1_22) : (5))))) : 1)) && (var_1_23 == ((double) var_1_5))) && ((7.75 > (- var_1_12)) ? (var_1_24 == ((float) (var_1_3 + var_1_5))) : (var_1_24 == ((float) ((((9999.2f) < ((var_1_5 + var_1_4))) ? (9999.2f) : ((var_1_5 + var_1_4)))))))) && ((last_1_var_1_14 > (last_1_var_1_30 | ((((var_1_17) < (var_1_11)) ? (var_1_17) : (var_1_11))))) ? (var_1_25 == ((double) ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) < (var_1_3)) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : (var_1_3))))) : ((99.3f <= var_1_3) ? (var_1_25 == ((double) (var_1_4 + var_1_5))) : (var_1_25 == ((double) (((((var_1_3 + (var_1_26 - var_1_27))) > (var_1_4)) ? ((var_1_3 + (var_1_26 - var_1_27))) : (var_1_4)))))))) && ((((var_1_29 - 7.25f) - var_1_27) > var_1_23) ? ((var_1_26 != (var_1_23 * ((((var_1_29) < 0 ) ? -(var_1_29) : (var_1_29))))) ? (var_1_28 == ((signed short int) (var_1_14 + (((((var_1_16) > (var_1_13)) ? (var_1_16) : (var_1_13))) - (var_1_14 + var_1_11))))) : (var_1_28 == ((signed short int) var_1_18))) : ((var_1_12 <= var_1_23) ? (var_1_28 == ((signed short int) var_1_17)) : (var_1_28 == ((signed short int) var_1_14))))) && (var_1_30 == ((unsigned char) var_1_11))) && (var_1_31 == ((unsigned long int) var_1_14)) ; [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=0, var_1_30=127, var_1_31=1, var_1_5=2, var_1_6=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=0, var_1_30=127, var_1_31=1, var_1_5=2, var_1_6=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 141 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 366 mSDsluCounter, 1310 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 938 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 727 IncrementalHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 372 mSDtfsCounter, 727 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 687 GetRequests, 630 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=4, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 73 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1275 NumberOfCodeBlocks, 1275 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 984 ConstructedInterpolants, 0 QuantifiedInterpolants, 3990 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1078 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 4988/5320 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-08 13:57:56,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-42.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 aeac736475d2e9b0ab566775f61df15337d707594a1ca30cedb7f4179e279e85 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:57:58,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:57:58,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:57:58,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:57:58,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:57:58,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:57:58,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:57:58,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:57:58,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:57:58,293 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:57:58,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:57:58,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:57:58,293 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:57:58,293 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:57:58,293 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:57:58,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:57:58,293 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:57:58,294 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:57:58,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:57:58,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:57:58,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:57:58,294 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:57:58,294 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:57:58,294 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:57:58,294 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:57:58,294 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:57:58,294 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:57:58,294 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:57:58,294 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:57:58,294 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:57:58,294 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:57:58,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:57:58,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:57:58,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:57:58,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:57:58,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:57:58,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:57:58,295 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:57:58,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:57:58,295 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:57:58,295 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:57:58,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:57:58,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:57:58,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:57:58,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:57:58,295 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 -> aeac736475d2e9b0ab566775f61df15337d707594a1ca30cedb7f4179e279e85 [2025-03-08 13:57:58,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:57:58,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:57:58,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:57:58,535 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:57:58,535 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:57:58,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-42.i [2025-03-08 13:57:59,717 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c2230db2/e1f9c043cf1b4bb69b434eea7661dab3/FLAG5214779f1 [2025-03-08 13:57:59,896 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:57:59,897 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-42.i [2025-03-08 13:57:59,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c2230db2/e1f9c043cf1b4bb69b434eea7661dab3/FLAG5214779f1 [2025-03-08 13:57:59,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c2230db2/e1f9c043cf1b4bb69b434eea7661dab3 [2025-03-08 13:57:59,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:57:59,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:57:59,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:57:59,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:57:59,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:57:59,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:57:59" (1/1) ... [2025-03-08 13:57:59,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae1710c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:59, skipping insertion in model container [2025-03-08 13:57:59,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:57:59" (1/1) ... [2025-03-08 13:57:59,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:58:00,034 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_100-1loop_file-42.i[916,929] [2025-03-08 13:58:00,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:58:00,126 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:58:00,135 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_100-1loop_file-42.i[916,929] [2025-03-08 13:58:00,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:58:00,193 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:58:00,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:00 WrapperNode [2025-03-08 13:58:00,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:58:00,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:58:00,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:58:00,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:58:00,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:00" (1/1) ... [2025-03-08 13:58:00,209 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:00" (1/1) ... [2025-03-08 13:58:00,231 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2025-03-08 13:58:00,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:58:00,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:58:00,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:58:00,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:58:00,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:00" (1/1) ... [2025-03-08 13:58:00,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:00" (1/1) ... [2025-03-08 13:58:00,246 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:00" (1/1) ... [2025-03-08 13:58:00,256 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-08 13:58:00,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:00" (1/1) ... [2025-03-08 13:58:00,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:00" (1/1) ... [2025-03-08 13:58:00,263 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:00" (1/1) ... [2025-03-08 13:58:00,264 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:00" (1/1) ... [2025-03-08 13:58:00,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:00" (1/1) ... [2025-03-08 13:58:00,266 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:00" (1/1) ... [2025-03-08 13:58:00,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:58:00,269 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:58:00,269 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:58:00,269 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:58:00,270 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:00" (1/1) ... [2025-03-08 13:58:00,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:58:00,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:58:00,300 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-08 13:58:00,302 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-08 13:58:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:58:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:58:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:58:00,322 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:58:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:58:00,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:58:00,397 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:58:00,398 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:58:16,029 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 13:58:16,029 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:58:16,035 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:58:16,035 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:58:16,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:58:16 BoogieIcfgContainer [2025-03-08 13:58:16,036 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:58:16,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:58:16,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:58:16,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:58:16,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:57:59" (1/3) ... [2025-03-08 13:58:16,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47980bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:58:16, skipping insertion in model container [2025-03-08 13:58:16,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:00" (2/3) ... [2025-03-08 13:58:16,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47980bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:58:16, skipping insertion in model container [2025-03-08 13:58:16,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:58:16" (3/3) ... [2025-03-08 13:58:16,042 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-42.i [2025-03-08 13:58:16,050 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:58:16,051 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-42.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:58:16,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:58:16,089 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;@17f64fc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:58:16,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:58:16,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:58:16,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 13:58:16,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:58:16,102 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:58:16,102 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:58:16,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:58:16,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1974237710, now seen corresponding path program 1 times [2025-03-08 13:58:16,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:58:16,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068949381] [2025-03-08 13:58:16,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:58:16,115 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-08 13:58:16,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:58:16,117 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-08 13:58:16,118 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-08 13:58:16,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 13:58:16,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 13:58:16,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:58:16,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:58:16,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:58:16,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:58:16,847 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2025-03-08 13:58:16,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:58:16,848 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:58:16,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068949381] [2025-03-08 13:58:16,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068949381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:58:16,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:58:16,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:58:16,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167953807] [2025-03-08 13:58:16,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:58:16,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:58:16,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:58:16,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:58:16,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:58:16,874 INFO L87 Difference]: Start difference. First operand has 70 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 13:58:16,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:58:16,892 INFO L93 Difference]: Finished difference Result 137 states and 229 transitions. [2025-03-08 13:58:16,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:58:16,894 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 137 [2025-03-08 13:58:16,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:58:16,898 INFO L225 Difference]: With dead ends: 137 [2025-03-08 13:58:16,898 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 13:58:16,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 136 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-08 13:58:16,902 INFO L435 NwaCegarLoop]: 104 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, 104 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-08 13:58:16,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:58:16,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 13:58:16,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-08 13:58:16,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:58:16,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2025-03-08 13:58:16,936 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 137 [2025-03-08 13:58:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:58:16,936 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2025-03-08 13:58:16,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 13:58:16,936 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2025-03-08 13:58:16,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 13:58:16,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:58:16,938 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:58:16,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 13:58:17,139 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-08 13:58:17,139 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:58:17,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:58:17,140 INFO L85 PathProgramCache]: Analyzing trace with hash 204686926, now seen corresponding path program 1 times [2025-03-08 13:58:17,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:58:17,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276055745] [2025-03-08 13:58:17,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:58:17,141 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-08 13:58:17,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:58:17,143 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-08 13:58:17,145 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-08 13:58:17,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 13:58:17,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 13:58:17,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:58:17,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:58:17,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 13:58:17,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:58:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 13:58:23,320 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:58:23,320 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:58:23,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276055745] [2025-03-08 13:58:23,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276055745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:58:23,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:58:23,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:58:23,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322223087] [2025-03-08 13:58:23,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:58:23,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 13:58:23,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:58:23,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 13:58:23,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:58:23,328 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 13:58:27,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:58:31,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:58:35,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 13:58:39,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:58:43,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:58:47,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 13:58:51,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:58:51,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:58:51,956 INFO L93 Difference]: Finished difference Result 196 states and 298 transitions. [2025-03-08 13:58:52,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 13:58:52,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2025-03-08 13:58:52,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:58:52,064 INFO L225 Difference]: With dead ends: 196 [2025-03-08 13:58:52,064 INFO L226 Difference]: Without dead ends: 132 [2025-03-08 13:58:52,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 13:58:52,065 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 70 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 41 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:58:52,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 330 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 65 Invalid, 6 Unknown, 0 Unchecked, 28.3s Time] [2025-03-08 13:58:52,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-08 13:58:52,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 107. [2025-03-08 13:58:52,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 64 states have (on average 1.25) internal successors, (80), 64 states have internal predecessors, (80), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 13:58:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 160 transitions. [2025-03-08 13:58:52,088 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 160 transitions. Word has length 137 [2025-03-08 13:58:52,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:58:52,089 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 160 transitions. [2025-03-08 13:58:52,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 13:58:52,089 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 160 transitions. [2025-03-08 13:58:52,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 13:58:52,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:58:52,092 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:58:52,120 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-08 13:58:52,293 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-08 13:58:52,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:58:52,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:58:52,294 INFO L85 PathProgramCache]: Analyzing trace with hash -541178790, now seen corresponding path program 1 times [2025-03-08 13:58:52,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:58:52,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028505055] [2025-03-08 13:58:52,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:58:52,294 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-08 13:58:52,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:58:52,297 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-08 13:58:52,298 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-08 13:58:52,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 13:58:52,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 13:58:52,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:58:52,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:58:53,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 13:58:53,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:58:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 13:58:56,147 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:58:56,147 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:58:56,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028505055] [2025-03-08 13:58:56,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028505055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:58:56,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:58:56,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:58:56,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303634996] [2025-03-08 13:58:56,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:58:56,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:58:56,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:58:56,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:58:56,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:58:56,150 INFO L87 Difference]: Start difference. First operand 107 states and 160 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 13:58:59,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:59:01,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:59:05,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:59:06,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:59:11,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:59:15,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:59:20,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:59:22,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:59:26,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []