./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-15.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 044a7cdd6251fe9eb07c20450214da5314c7c35ebd124f60b50f79c201faf819 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:42:11,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:42:11,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:42:11,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:42:11,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:42:11,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:42:11,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:42:11,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:42:11,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:42:11,293 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:42:11,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:42:11,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:42:11,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:42:11,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:42:11,295 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:42:11,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:42:11,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:42:11,295 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:42:11,295 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:42:11,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:42:11,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:42:11,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:42:11,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:42:11,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:42:11,296 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:42:11,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:42:11,296 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:42:11,296 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:42:11,296 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:42:11,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:42:11,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:42:11,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:42:11,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:42:11,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:42:11,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:42:11,297 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:42:11,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:42:11,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:42:11,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:42:11,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:42:11,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:42:11,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:42:11,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:42:11,297 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 -> 044a7cdd6251fe9eb07c20450214da5314c7c35ebd124f60b50f79c201faf819 [2025-03-17 01:42:11,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:42:11,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:42:11,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:42:11,560 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:42:11,560 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:42:11,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i [2025-03-17 01:42:12,808 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/914c32f89/40d7e6897f354e129fee1394491253d7/FLAGf79df74fe [2025-03-17 01:42:13,078 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:42:13,079 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i [2025-03-17 01:42:13,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/914c32f89/40d7e6897f354e129fee1394491253d7/FLAGf79df74fe [2025-03-17 01:42:13,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/914c32f89/40d7e6897f354e129fee1394491253d7 [2025-03-17 01:42:13,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:42:13,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:42:13,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:42:13,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:42:13,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:42:13,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:42:13" (1/1) ... [2025-03-17 01:42:13,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fd05f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:13, skipping insertion in model container [2025-03-17 01:42:13,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:42:13" (1/1) ... [2025-03-17 01:42:13,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:42:13,244 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_fillercode_fillercodestructure_filler-pr-co_file-15.i[919,932] [2025-03-17 01:42:13,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:42:13,301 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:42:13,310 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_fillercode_fillercodestructure_filler-pr-co_file-15.i[919,932] [2025-03-17 01:42:13,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:42:13,368 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:42:13,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:13 WrapperNode [2025-03-17 01:42:13,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:42:13,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:42:13,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:42:13,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:42:13,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:13" (1/1) ... [2025-03-17 01:42:13,380 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:13" (1/1) ... [2025-03-17 01:42:13,404 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 222 [2025-03-17 01:42:13,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:42:13,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:42:13,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:42:13,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:42:13,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:13" (1/1) ... [2025-03-17 01:42:13,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:13" (1/1) ... [2025-03-17 01:42:13,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:13" (1/1) ... [2025-03-17 01:42:13,441 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 01:42:13,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:13" (1/1) ... [2025-03-17 01:42:13,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:13" (1/1) ... [2025-03-17 01:42:13,447 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:13" (1/1) ... [2025-03-17 01:42:13,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:13" (1/1) ... [2025-03-17 01:42:13,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:13" (1/1) ... [2025-03-17 01:42:13,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:13" (1/1) ... [2025-03-17 01:42:13,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:42:13,453 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:42:13,453 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:42:13,453 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:42:13,458 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:13" (1/1) ... [2025-03-17 01:42:13,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:42:13,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:42:13,486 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 01:42:13,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 01:42:13,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:42:13,512 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:42:13,512 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:42:13,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:42:13,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:42:13,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:42:13,593 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:42:13,595 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:42:13,913 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 01:42:13,913 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:42:13,922 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:42:13,925 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:42:13,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:42:13 BoogieIcfgContainer [2025-03-17 01:42:13,925 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:42:13,928 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:42:13,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:42:13,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:42:13,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:42:13" (1/3) ... [2025-03-17 01:42:13,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5201df18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:42:13, skipping insertion in model container [2025-03-17 01:42:13,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:13" (2/3) ... [2025-03-17 01:42:13,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5201df18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:42:13, skipping insertion in model container [2025-03-17 01:42:13,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:42:13" (3/3) ... [2025-03-17 01:42:13,935 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i [2025-03-17 01:42:13,946 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:42:13,948 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:42:13,992 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:42:14,000 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;@5283413d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:42:14,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:42:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 01:42:14,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 01:42:14,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:42:14,016 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:42:14,016 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:42:14,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:42:14,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1199070804, now seen corresponding path program 1 times [2025-03-17 01:42:14,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:42:14,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466254094] [2025-03-17 01:42:14,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:42:14,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:42:14,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 01:42:14,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 01:42:14,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:42:14,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:42:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-03-17 01:42:14,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:42:14,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466254094] [2025-03-17 01:42:14,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466254094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:42:14,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101656045] [2025-03-17 01:42:14,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:42:14,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:42:14,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:42:14,285 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:42:14,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 01:42:14,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 01:42:14,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 01:42:14,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:42:14,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:42:14,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:42:14,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:42:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-03-17 01:42:14,528 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:42:14,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101656045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:42:14,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:42:14,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:42:14,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721378656] [2025-03-17 01:42:14,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:42:14,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:42:14,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:42:14,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:42:14,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:42:14,553 INFO L87 Difference]: Start difference. First operand has 89 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-17 01:42:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:42:14,578 INFO L93 Difference]: Finished difference Result 173 states and 308 transitions. [2025-03-17 01:42:14,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:42:14,579 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 190 [2025-03-17 01:42:14,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:42:14,584 INFO L225 Difference]: With dead ends: 173 [2025-03-17 01:42:14,584 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 01:42:14,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:42:14,589 INFO L435 NwaCegarLoop]: 133 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, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:42:14,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:42:14,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 01:42:14,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 01:42:14,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 01:42:14,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 133 transitions. [2025-03-17 01:42:14,621 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 133 transitions. Word has length 190 [2025-03-17 01:42:14,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:42:14,621 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 133 transitions. [2025-03-17 01:42:14,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-17 01:42:14,622 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 133 transitions. [2025-03-17 01:42:14,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 01:42:14,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:42:14,625 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:42:14,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 01:42:14,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 01:42:14,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:42:14,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:42:14,827 INFO L85 PathProgramCache]: Analyzing trace with hash 960759984, now seen corresponding path program 1 times [2025-03-17 01:42:14,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:42:14,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753617210] [2025-03-17 01:42:14,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:42:14,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:42:14,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 01:42:14,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 01:42:14,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:42:14,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:42:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-17 01:42:15,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:42:15,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753617210] [2025-03-17 01:42:15,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753617210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:42:15,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:42:15,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:42:15,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392410320] [2025-03-17 01:42:15,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:42:15,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:42:15,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:42:15,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:42:15,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:42:15,183 INFO L87 Difference]: Start difference. First operand 85 states and 133 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-17 01:42:15,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:42:15,405 INFO L93 Difference]: Finished difference Result 255 states and 399 transitions. [2025-03-17 01:42:15,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:42:15,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 190 [2025-03-17 01:42:15,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:42:15,407 INFO L225 Difference]: With dead ends: 255 [2025-03-17 01:42:15,407 INFO L226 Difference]: Without dead ends: 171 [2025-03-17 01:42:15,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:42:15,408 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 80 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:42:15,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 371 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:42:15,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-17 01:42:15,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 140. [2025-03-17 01:42:15,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 77 states have internal predecessors, (97), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 01:42:15,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 217 transitions. [2025-03-17 01:42:15,445 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 217 transitions. Word has length 190 [2025-03-17 01:42:15,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:42:15,447 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 217 transitions. [2025-03-17 01:42:15,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-17 01:42:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 217 transitions. [2025-03-17 01:42:15,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 01:42:15,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:42:15,450 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:42:15,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:42:15,451 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:42:15,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:42:15,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1568222287, now seen corresponding path program 1 times [2025-03-17 01:42:15,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:42:15,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561986421] [2025-03-17 01:42:15,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:42:15,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:42:15,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 01:42:15,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 01:42:15,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:42:15,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:42:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-17 01:42:15,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:42:15,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561986421] [2025-03-17 01:42:15,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561986421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:42:15,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:42:15,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:42:15,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579510529] [2025-03-17 01:42:15,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:42:15,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:42:15,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:42:15,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:42:15,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:42:15,831 INFO L87 Difference]: Start difference. First operand 140 states and 217 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-17 01:42:16,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:42:16,005 INFO L93 Difference]: Finished difference Result 324 states and 494 transitions. [2025-03-17 01:42:16,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:42:16,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2025-03-17 01:42:16,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:42:16,010 INFO L225 Difference]: With dead ends: 324 [2025-03-17 01:42:16,011 INFO L226 Difference]: Without dead ends: 240 [2025-03-17 01:42:16,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:42:16,012 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 118 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:42:16,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 354 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:42:16,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-17 01:42:16,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 203. [2025-03-17 01:42:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 124 states have (on average 1.282258064516129) internal successors, (159), 125 states have internal predecessors, (159), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 01:42:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 307 transitions. [2025-03-17 01:42:16,056 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 307 transitions. Word has length 191 [2025-03-17 01:42:16,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:42:16,056 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 307 transitions. [2025-03-17 01:42:16,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-17 01:42:16,057 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 307 transitions. [2025-03-17 01:42:16,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 01:42:16,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:42:16,058 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:42:16,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:42:16,059 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:42:16,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:42:16,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1882273138, now seen corresponding path program 1 times [2025-03-17 01:42:16,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:42:16,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584493588] [2025-03-17 01:42:16,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:42:16,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:42:16,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 01:42:16,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 01:42:16,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:42:16,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:42:16,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-17 01:42:16,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:42:16,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584493588] [2025-03-17 01:42:16,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584493588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:42:16,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:42:16,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:42:16,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908605315] [2025-03-17 01:42:16,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:42:16,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:42:16,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:42:16,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:42:16,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:42:16,336 INFO L87 Difference]: Start difference. First operand 203 states and 307 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-17 01:42:16,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:42:16,419 INFO L93 Difference]: Finished difference Result 436 states and 664 transitions. [2025-03-17 01:42:16,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:42:16,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2025-03-17 01:42:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:42:16,425 INFO L225 Difference]: With dead ends: 436 [2025-03-17 01:42:16,427 INFO L226 Difference]: Without dead ends: 293 [2025-03-17 01:42:16,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:42:16,429 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 63 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:42:16,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 264 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:42:16,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-17 01:42:16,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 288. [2025-03-17 01:42:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 177 states have (on average 1.265536723163842) internal successors, (224), 178 states have internal predecessors, (224), 104 states have call successors, (104), 6 states have call predecessors, (104), 6 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-17 01:42:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 432 transitions. [2025-03-17 01:42:16,479 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 432 transitions. Word has length 191 [2025-03-17 01:42:16,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:42:16,480 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 432 transitions. [2025-03-17 01:42:16,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-17 01:42:16,481 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 432 transitions. [2025-03-17 01:42:16,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 01:42:16,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:42:16,483 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:42:16,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:42:16,483 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:42:16,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:42:16,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1336048617, now seen corresponding path program 1 times [2025-03-17 01:42:16,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:42:16,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85152865] [2025-03-17 01:42:16,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:42:16,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:42:16,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 01:42:16,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 01:42:16,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:42:16,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:42:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 45 proven. 42 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-17 01:42:16,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:42:16,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85152865] [2025-03-17 01:42:16,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85152865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:42:16,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700583689] [2025-03-17 01:42:16,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:42:16,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:42:16,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:42:16,765 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:42:16,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 01:42:16,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 01:42:16,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 01:42:16,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:42:16,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:42:16,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 01:42:16,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:42:17,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 689 proven. 21 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-03-17 01:42:17,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:42:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 66 proven. 21 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-17 01:42:17,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700583689] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:42:17,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:42:17,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 19 [2025-03-17 01:42:17,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882681563] [2025-03-17 01:42:17,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:42:17,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 01:42:17,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:42:17,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 01:42:17,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-17 01:42:17,675 INFO L87 Difference]: Start difference. First operand 288 states and 432 transitions. Second operand has 19 states, 19 states have (on average 6.684210526315789) internal successors, (127), 19 states have internal predecessors, (127), 6 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) [2025-03-17 01:42:19,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:42:19,278 INFO L93 Difference]: Finished difference Result 1141 states and 1671 transitions. [2025-03-17 01:42:19,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-17 01:42:19,280 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.684210526315789) internal successors, (127), 19 states have internal predecessors, (127), 6 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) Word has length 192 [2025-03-17 01:42:19,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:42:19,287 INFO L225 Difference]: With dead ends: 1141 [2025-03-17 01:42:19,287 INFO L226 Difference]: Without dead ends: 878 [2025-03-17 01:42:19,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=690, Invalid=2390, Unknown=0, NotChecked=0, Total=3080 [2025-03-17 01:42:19,289 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 834 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:42:19,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 986 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 1474 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 01:42:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-03-17 01:42:19,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 556. [2025-03-17 01:42:19,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 339 states have (on average 1.168141592920354) internal successors, (396), 343 states have internal predecessors, (396), 192 states have call successors, (192), 24 states have call predecessors, (192), 24 states have return successors, (192), 188 states have call predecessors, (192), 192 states have call successors, (192) [2025-03-17 01:42:19,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 780 transitions. [2025-03-17 01:42:19,379 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 780 transitions. Word has length 192 [2025-03-17 01:42:19,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:42:19,380 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 780 transitions. [2025-03-17 01:42:19,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.684210526315789) internal successors, (127), 19 states have internal predecessors, (127), 6 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) [2025-03-17 01:42:19,380 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 780 transitions. [2025-03-17 01:42:19,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-17 01:42:19,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:42:19,382 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:42:19,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 01:42:19,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:42:19,583 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:42:19,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:42:19,583 INFO L85 PathProgramCache]: Analyzing trace with hash -65122571, now seen corresponding path program 1 times [2025-03-17 01:42:19,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:42:19,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003820726] [2025-03-17 01:42:19,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:42:19,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:42:19,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 01:42:19,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 01:42:19,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:42:19,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:42:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-17 01:42:19,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:42:19,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003820726] [2025-03-17 01:42:19,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003820726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:42:19,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:42:19,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:42:19,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173670139] [2025-03-17 01:42:19,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:42:19,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:42:19,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:42:19,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:42:19,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:42:19,656 INFO L87 Difference]: Start difference. First operand 556 states and 780 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-17 01:42:19,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:42:19,717 INFO L93 Difference]: Finished difference Result 824 states and 1150 transitions. [2025-03-17 01:42:19,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:42:19,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 193 [2025-03-17 01:42:19,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:42:19,721 INFO L225 Difference]: With dead ends: 824 [2025-03-17 01:42:19,722 INFO L226 Difference]: Without dead ends: 495 [2025-03-17 01:42:19,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:42:19,723 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 108 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:42:19,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 127 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:42:19,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-17 01:42:19,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 327. [2025-03-17 01:42:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 196 states have (on average 1.1173469387755102) internal successors, (219), 197 states have internal predecessors, (219), 112 states have call successors, (112), 18 states have call predecessors, (112), 18 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-17 01:42:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 443 transitions. [2025-03-17 01:42:19,782 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 443 transitions. Word has length 193 [2025-03-17 01:42:19,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:42:19,782 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 443 transitions. [2025-03-17 01:42:19,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-17 01:42:19,783 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 443 transitions. [2025-03-17 01:42:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-17 01:42:19,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:42:19,784 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:42:19,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 01:42:19,785 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:42:19,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:42:19,785 INFO L85 PathProgramCache]: Analyzing trace with hash -65092780, now seen corresponding path program 1 times [2025-03-17 01:42:19,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:42:19,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534949997] [2025-03-17 01:42:19,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:42:19,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:42:19,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 01:42:19,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 01:42:19,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:42:19,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:42:19,870 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 01:42:19,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 01:42:19,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 01:42:19,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:42:19,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:42:20,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 01:42:20,004 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 01:42:20,005 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 01:42:20,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 01:42:20,009 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:42:20,128 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 01:42:20,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 01:42:20 BoogieIcfgContainer [2025-03-17 01:42:20,130 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 01:42:20,131 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 01:42:20,131 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 01:42:20,131 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 01:42:20,132 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:42:13" (3/4) ... [2025-03-17 01:42:20,133 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 01:42:20,134 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 01:42:20,135 INFO L158 Benchmark]: Toolchain (without parser) took 7024.28ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 121.6MB in the beginning and 96.3MB in the end (delta: 25.2MB). Peak memory consumption was 79.3MB. Max. memory is 16.1GB. [2025-03-17 01:42:20,136 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:42:20,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.34ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 106.1MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 01:42:20,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.02ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 103.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:42:20,136 INFO L158 Benchmark]: Boogie Preprocessor took 43.93ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 101.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:42:20,137 INFO L158 Benchmark]: IcfgBuilder took 472.42ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 77.8MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 01:42:20,137 INFO L158 Benchmark]: TraceAbstraction took 6202.48ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 77.4MB in the beginning and 96.3MB in the end (delta: -18.9MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2025-03-17 01:42:20,137 INFO L158 Benchmark]: Witness Printer took 2.55ms. Allocated memory is still 226.5MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:42:20,139 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.22ms. Allocated memory is still 201.3MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.34ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 106.1MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.02ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 103.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.93ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 101.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 472.42ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 77.8MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6202.48ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 77.4MB in the beginning and 96.3MB in the end (delta: -18.9MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. * Witness Printer took 2.55ms. Allocated memory is still 226.5MB. Free memory is still 96.3MB. 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 68, overapproximation of someBinaryFLOATComparisonOperation at line 174, overapproximation of someBinaryFLOATComparisonOperation at line 158, overapproximation of someBinaryFLOATComparisonOperation at line 172, overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryFLOATComparisonOperation at line 211, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someUnaryDOUBLEoperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 211, overapproximation of someBinaryDOUBLEComparisonOperation at line 176, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 197, overapproximation of someBinaryDOUBLEComparisonOperation at line 195, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 178. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] float var_1_3 = 32.4; [L24] float var_1_4 = 49.2; [L25] signed short int var_1_7 = 10; [L26] signed short int var_1_8 = 64; [L27] signed short int var_1_9 = 256; [L28] signed char var_1_10 = -5; [L29] signed char var_1_11 = 5; [L30] double var_1_12 = 256.4; [L31] float var_1_13 = 2.6; [L32] float var_1_14 = 128.125; [L33] double var_1_15 = 32.5; [L34] double var_1_16 = 10000000000.25; [L35] signed char var_1_17 = -5; [L36] unsigned char var_1_19 = 0; [L37] unsigned char var_1_20 = 0; [L38] signed long int var_1_21 = 1; [L39] signed short int var_1_22 = 17178; [L40] signed short int var_1_23 = 5; [L41] signed long int var_1_25 = -4; [L42] signed short int var_1_26 = 10; [L43] signed short int var_1_32 = 0; [L44] signed short int var_1_33 = 10; [L45] signed long int var_1_34 = -10; [L46] double var_1_36 = 4.85; [L47] double var_1_37 = 2.5; [L48] double var_1_38 = 15.75; [L49] signed char var_1_39 = -100; [L50] signed char var_1_40 = 1; [L51] signed short int var_1_41 = -32; [L52] signed char var_1_42 = 4; [L53] signed char var_1_43 = -8; [L54] signed short int var_1_44 = -25; [L55] signed char last_1_var_1_10 = -5; [L56] signed long int last_1_var_1_21 = 1; [L57] signed long int last_1_var_1_25 = -4; [L215] isInitial = 1 [L216] FCALL initially() [L217] COND TRUE 1 [L218] CALL updateLastVariables() [L206] last_1_var_1_10 = var_1_10 [L207] last_1_var_1_21 = var_1_21 [L208] last_1_var_1_25 = var_1_25 [L218] RET updateLastVariables() [L219] CALL updateVariables() [L155] var_1_3 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L156] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L157] var_1_4 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L158] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L159] var_1_7 = __VERIFIER_nondet_short() [L160] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L160] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L161] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L161] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L162] var_1_8 = __VERIFIER_nondet_short() [L163] CALL assume_abort_if_not(var_1_8 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=256] [L163] RET assume_abort_if_not(var_1_8 >= -1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=256] [L164] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=256] [L164] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=256] [L165] var_1_9 = __VERIFIER_nondet_short() [L166] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L166] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L167] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L167] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L168] var_1_11 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L169] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L170] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L170] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L171] var_1_13 = __VERIFIER_nondet_float() [L172] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L172] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L173] var_1_14 = __VERIFIER_nondet_float() [L174] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L174] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L175] var_1_15 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L176] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L177] var_1_16 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L178] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L179] var_1_20 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L180] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L181] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L181] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L182] var_1_22 = __VERIFIER_nondet_short() [L183] CALL assume_abort_if_not(var_1_22 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L183] RET assume_abort_if_not(var_1_22 >= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L184] CALL assume_abort_if_not(var_1_22 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L184] RET assume_abort_if_not(var_1_22 <= 32767) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L185] var_1_23 = __VERIFIER_nondet_short() [L186] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L186] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L187] CALL assume_abort_if_not(var_1_23 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L187] RET assume_abort_if_not(var_1_23 <= 16384) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L188] var_1_32 = __VERIFIER_nondet_short() [L189] CALL assume_abort_if_not(var_1_32 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L189] RET assume_abort_if_not(var_1_32 >= -1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L190] CALL assume_abort_if_not(var_1_32 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L190] RET assume_abort_if_not(var_1_32 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L191] var_1_33 = __VERIFIER_nondet_short() [L192] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L192] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L193] CALL assume_abort_if_not(var_1_33 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L193] RET assume_abort_if_not(var_1_33 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L194] var_1_37 = __VERIFIER_nondet_double() [L195] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L195] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L196] var_1_38 = __VERIFIER_nondet_double() [L197] CALL assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 2305843.009213691390e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L197] RET assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 2305843.009213691390e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L198] var_1_40 = __VERIFIER_nondet_char() [L199] CALL assume_abort_if_not(var_1_40 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L199] RET assume_abort_if_not(var_1_40 >= -127) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L200] CALL assume_abort_if_not(var_1_40 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L200] RET assume_abort_if_not(var_1_40 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L201] var_1_43 = __VERIFIER_nondet_char() [L202] CALL assume_abort_if_not(var_1_43 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L202] RET assume_abort_if_not(var_1_43 >= -126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L203] CALL assume_abort_if_not(var_1_43 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L203] RET assume_abort_if_not(var_1_43 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L219] RET updateVariables() [L220] CALL step() [L61] COND TRUE last_1_var_1_10 < last_1_var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L62] COND TRUE var_1_11 <= last_1_var_1_25 [L63] var_1_19 = var_1_20 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L66] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L67] COND TRUE var_1_4 >= (var_1_3 * (var_1_13 + var_1_14)) [L68] var_1_12 = (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=2, var_1_9=0] [L72] COND TRUE (! var_1_19) || var_1_19 [L73] var_1_44 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-4, var_1_7=0, var_1_8=2, var_1_9=0] [L85] unsigned char stepLocal_1 = var_1_19; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-4, var_1_7=0, var_1_8=2, var_1_9=0] [L86] COND FALSE !(var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-4, var_1_7=0, var_1_8=2, var_1_9=0] [L93] var_1_34 = ((((128) < (((((var_1_10) > ((-5 + var_1_17))) ? (var_1_10) : ((-5 + var_1_17)))))) ? (128) : (((((var_1_10) > ((-5 + var_1_17))) ? (var_1_10) : ((-5 + var_1_17))))))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-4, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-4, var_1_7=0, var_1_8=2, var_1_9=0] [L94] COND FALSE !(var_1_33 <= var_1_10) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-4, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-4, var_1_7=0, var_1_8=2, var_1_9=0] [L97] COND FALSE !(\read(var_1_19)) [L100] var_1_25 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-4, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-4, var_1_7=0, var_1_8=2, var_1_9=0] [L102] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-4, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-4, var_1_7=0, var_1_8=2, var_1_9=0] [L103] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-4, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-4, var_1_7=0, var_1_8=2, var_1_9=0] [L106] COND FALSE !(var_1_17 >= 25) [L117] var_1_26 = var_1_17 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-4, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-4, var_1_7=0, var_1_8=2, var_1_9=0] [L121] COND FALSE !(\read(var_1_19)) [L124] var_1_36 = ((((var_1_37) > (var_1_38)) ? (var_1_37) : (var_1_38))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-4, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-4, var_1_7=0, var_1_8=2, var_1_9=0] [L126] var_1_39 = var_1_40 [L127] unsigned char stepLocal_0 = var_1_12 > var_1_12; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_0=1, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-4, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=126, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-4, var_1_7=0, var_1_8=2, var_1_9=0] [L128] COND TRUE var_1_19 || stepLocal_0 [L129] var_1_1 = (var_1_17 + var_1_17) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-4, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=126, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-4, var_1_7=0, var_1_8=2, var_1_9=0] [L133] signed long int stepLocal_3 = var_1_22 + var_1_11; [L134] signed long int stepLocal_2 = (var_1_22 - var_1_23) - var_1_9; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-1, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-4, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=126, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-4, var_1_7=0, var_1_8=2, var_1_9=0] [L135] COND FALSE !(\read(var_1_20)) [L148] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-1, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=0, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-4, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=126, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-4, var_1_7=0, var_1_8=2, var_1_9=0] [L150] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-1, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=0, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-4, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=126, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-4, var_1_7=0, var_1_8=2, var_1_9=0] [L220] RET step() [L221] CALL, EXPR property() [L211-L212] return (((((((var_1_19 || (var_1_12 > var_1_12)) ? (var_1_1 == ((signed short int) (var_1_17 + var_1_17))) : (var_1_1 == ((signed short int) ((((((var_1_7 + 1)) < (var_1_8)) ? ((var_1_7 + 1)) : (var_1_8))) - (24762 - var_1_9))))) && (var_1_10 == ((signed char) var_1_11))) && ((var_1_4 >= (var_1_3 * (var_1_13 + var_1_14))) ? (var_1_12 == ((double) (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))))) : (var_1_12 == ((double) var_1_16)))) && ((var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) ? ((var_1_19 || var_1_19) ? (var_1_17 == ((signed char) var_1_11)) : (var_1_17 == ((signed char) var_1_11))) : 1)) && ((last_1_var_1_10 < last_1_var_1_25) ? ((var_1_11 <= last_1_var_1_25) ? (var_1_19 == ((unsigned char) var_1_20)) : 1) : 1)) && (var_1_20 ? ((var_1_10 < ((var_1_22 - var_1_23) - var_1_9)) ? (var_1_19 ? ((last_1_var_1_21 == (var_1_22 + var_1_11)) ? (var_1_21 == ((signed long int) var_1_1)) : 1) : (var_1_21 == ((signed long int) var_1_10))) : (var_1_21 == ((signed long int) var_1_11))) : (var_1_21 == ((signed long int) var_1_9)))) && (var_1_19 ? (var_1_25 == ((signed long int) (var_1_17 + ((((var_1_17) < (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))) ? (var_1_17) : (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))))))) : (var_1_25 == ((signed long int) var_1_10))) ; [L221] RET, EXPR property() [L221] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=0, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-4, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=126, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-4, var_1_7=0, var_1_8=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=0, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-4, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=126, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-4, var_1_7=0, var_1_8=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 172 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 7, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1221 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1203 mSDsluCounter, 2235 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1439 mSDsCounter, 603 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1655 IncrementalHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 603 mSolverCounterUnsat, 796 mSDtfsCounter, 1655 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 641 GetRequests, 580 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=556occurred in iteration=5, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 563 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1722 NumberOfCodeBlocks, 1722 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1712 ConstructedInterpolants, 0 QuantifiedInterpolants, 4017 SizeOfPredicates, 7 NumberOfNonLiveVariables, 907 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 15518/15660 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 01:42:20,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-15.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 044a7cdd6251fe9eb07c20450214da5314c7c35ebd124f60b50f79c201faf819 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:42:22,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:42:22,197 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 01:42:22,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:42:22,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:42:22,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:42:22,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:42:22,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:42:22,231 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:42:22,231 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:42:22,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:42:22,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:42:22,232 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:42:22,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:42:22,232 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:42:22,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:42:22,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:42:22,233 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:42:22,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:42:22,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:42:22,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:42:22,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:42:22,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:42:22,233 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 01:42:22,234 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 01:42:22,234 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 01:42:22,234 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:42:22,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:42:22,234 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:42:22,234 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:42:22,234 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:42:22,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:42:22,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:42:22,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:42:22,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:42:22,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:42:22,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:42:22,235 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:42:22,235 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:42:22,235 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 01:42:22,236 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 01:42:22,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:42:22,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:42:22,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:42:22,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:42:22,236 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 -> 044a7cdd6251fe9eb07c20450214da5314c7c35ebd124f60b50f79c201faf819 [2025-03-17 01:42:22,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:42:22,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:42:22,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:42:22,530 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:42:22,530 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:42:22,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i [2025-03-17 01:42:23,710 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be0adbc58/b4d97fb7e51e4461be9148dc17ad3a6d/FLAG8b3093cb5 [2025-03-17 01:42:23,861 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:42:23,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i [2025-03-17 01:42:23,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be0adbc58/b4d97fb7e51e4461be9148dc17ad3a6d/FLAG8b3093cb5 [2025-03-17 01:42:23,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be0adbc58/b4d97fb7e51e4461be9148dc17ad3a6d [2025-03-17 01:42:23,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:42:23,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:42:23,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:42:23,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:42:23,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:42:23,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:42:23" (1/1) ... [2025-03-17 01:42:23,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@226c2f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:23, skipping insertion in model container [2025-03-17 01:42:23,884 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:42:23" (1/1) ... [2025-03-17 01:42:23,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:42:23,996 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_fillercode_fillercodestructure_filler-pr-co_file-15.i[919,932] [2025-03-17 01:42:24,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:42:24,062 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:42:24,070 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_fillercode_fillercodestructure_filler-pr-co_file-15.i[919,932] [2025-03-17 01:42:24,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:42:24,115 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:42:24,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:24 WrapperNode [2025-03-17 01:42:24,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:42:24,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:42:24,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:42:24,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:42:24,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:24" (1/1) ... [2025-03-17 01:42:24,133 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:24" (1/1) ... [2025-03-17 01:42:24,164 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2025-03-17 01:42:24,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:42:24,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:42:24,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:42:24,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:42:24,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:24" (1/1) ... [2025-03-17 01:42:24,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:24" (1/1) ... [2025-03-17 01:42:24,180 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:24" (1/1) ... [2025-03-17 01:42:24,196 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 01:42:24,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:24" (1/1) ... [2025-03-17 01:42:24,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:24" (1/1) ... [2025-03-17 01:42:24,207 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:24" (1/1) ... [2025-03-17 01:42:24,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:24" (1/1) ... [2025-03-17 01:42:24,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:24" (1/1) ... [2025-03-17 01:42:24,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:24" (1/1) ... [2025-03-17 01:42:24,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:42:24,224 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:42:24,224 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:42:24,224 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:42:24,225 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:24" (1/1) ... [2025-03-17 01:42:24,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:42:24,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:42:24,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 01:42:24,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 01:42:24,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:42:24,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 01:42:24,263 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:42:24,263 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:42:24,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:42:24,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:42:24,322 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:42:24,324 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:42:30,070 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 01:42:30,070 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:42:30,077 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:42:30,077 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:42:30,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:42:30 BoogieIcfgContainer [2025-03-17 01:42:30,077 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:42:30,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:42:30,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:42:30,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:42:30,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:42:23" (1/3) ... [2025-03-17 01:42:30,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3561d7ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:42:30, skipping insertion in model container [2025-03-17 01:42:30,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:42:24" (2/3) ... [2025-03-17 01:42:30,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3561d7ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:42:30, skipping insertion in model container [2025-03-17 01:42:30,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:42:30" (3/3) ... [2025-03-17 01:42:30,085 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i [2025-03-17 01:42:30,094 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:42:30,095 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:42:30,126 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:42:30,133 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;@9d5abcb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:42:30,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:42:30,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 01:42:30,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 01:42:30,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:42:30,143 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:42:30,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:42:30,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:42:30,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1199070804, now seen corresponding path program 1 times [2025-03-17 01:42:30,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:42:30,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086923712] [2025-03-17 01:42:30,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:42:30,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:42:30,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:42:30,157 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:42:30,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 01:42:30,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 01:42:30,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 01:42:30,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:42:30,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:42:30,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:42:30,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:42:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 818 proven. 0 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2025-03-17 01:42:30,726 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:42:30,727 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:42:30,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086923712] [2025-03-17 01:42:30,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086923712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:42:30,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:42:30,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 01:42:30,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069072897] [2025-03-17 01:42:30,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:42:30,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:42:30,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:42:30,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:42:30,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:42:30,751 INFO L87 Difference]: Start difference. First operand has 89 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-17 01:42:30,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:42:30,773 INFO L93 Difference]: Finished difference Result 173 states and 308 transitions. [2025-03-17 01:42:30,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:42:30,775 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 190 [2025-03-17 01:42:30,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:42:30,780 INFO L225 Difference]: With dead ends: 173 [2025-03-17 01:42:30,780 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 01:42:30,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:42:30,784 INFO L435 NwaCegarLoop]: 133 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, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:42:30,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:42:30,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 01:42:30,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 01:42:30,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 01:42:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 133 transitions. [2025-03-17 01:42:30,813 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 133 transitions. Word has length 190 [2025-03-17 01:42:30,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:42:30,813 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 133 transitions. [2025-03-17 01:42:30,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-17 01:42:30,814 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 133 transitions. [2025-03-17 01:42:30,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 01:42:30,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:42:30,816 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:42:30,831 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-17 01:42:31,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:42:31,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:42:31,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:42:31,018 INFO L85 PathProgramCache]: Analyzing trace with hash 960759984, now seen corresponding path program 1 times [2025-03-17 01:42:31,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:42:31,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013376639] [2025-03-17 01:42:31,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:42:31,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:42:31,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:42:31,020 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:42:31,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 01:42:31,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 01:42:31,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 01:42:31,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:42:31,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:42:31,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 01:42:31,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:42:32,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-17 01:42:32,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:42:32,974 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:42:32,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013376639] [2025-03-17 01:42:32,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013376639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:42:32,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:42:32,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:42:32,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156297158] [2025-03-17 01:42:32,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:42:32,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:42:32,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:42:32,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:42:32,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:42:32,977 INFO L87 Difference]: Start difference. First operand 85 states and 133 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-17 01:42:35,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:42:35,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:42:35,577 INFO L93 Difference]: Finished difference Result 254 states and 398 transitions. [2025-03-17 01:42:35,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:42:35,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 190 [2025-03-17 01:42:35,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:42:35,600 INFO L225 Difference]: With dead ends: 254 [2025-03-17 01:42:35,600 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 01:42:35,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:42:35,602 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 74 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:42:35,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 373 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-17 01:42:35,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 01:42:35,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 140. [2025-03-17 01:42:35,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 77 states have internal predecessors, (97), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 01:42:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 217 transitions. [2025-03-17 01:42:35,649 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 217 transitions. Word has length 190 [2025-03-17 01:42:35,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:42:35,649 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 217 transitions. [2025-03-17 01:42:35,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-17 01:42:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 217 transitions. [2025-03-17 01:42:35,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 01:42:35,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:42:35,652 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:42:35,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 01:42:35,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:42:35,853 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:42:35,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:42:35,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1568222287, now seen corresponding path program 1 times [2025-03-17 01:42:35,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:42:35,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578508908] [2025-03-17 01:42:35,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:42:35,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:42:35,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:42:35,857 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:42:35,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 01:42:35,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 01:42:36,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 01:42:36,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:42:36,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:42:36,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 01:42:36,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:42:38,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-17 01:42:38,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:42:38,123 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:42:38,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578508908] [2025-03-17 01:42:38,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578508908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:42:38,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:42:38,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:42:38,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938809075] [2025-03-17 01:42:38,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:42:38,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:42:38,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:42:38,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:42:38,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:42:38,124 INFO L87 Difference]: Start difference. First operand 140 states and 217 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-17 01:42:41,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:42:43,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 01:42:45,967 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 [0] [2025-03-17 01:42:54,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 01:42:56,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 01:42:56,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:42:56,600 INFO L93 Difference]: Finished difference Result 308 states and 481 transitions. [2025-03-17 01:42:56,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:42:56,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2025-03-17 01:42:56,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:42:56,619 INFO L225 Difference]: With dead ends: 308 [2025-03-17 01:42:56,619 INFO L226 Difference]: Without dead ends: 224 [2025-03-17 01:42:56,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:42:56,621 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 118 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:42:56,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 342 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 17.8s Time] [2025-03-17 01:42:56,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-17 01:42:56,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 143. [2025-03-17 01:42:56,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 80 states have (on average 1.25) internal successors, (100), 80 states have internal predecessors, (100), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 01:42:56,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 220 transitions. [2025-03-17 01:42:56,652 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 220 transitions. Word has length 191 [2025-03-17 01:42:56,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:42:56,654 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 220 transitions. [2025-03-17 01:42:56,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-17 01:42:56,654 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 220 transitions. [2025-03-17 01:42:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 01:42:56,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:42:56,658 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:42:56,676 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 (4)] Ended with exit code 0 [2025-03-17 01:42:56,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:42:56,858 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:42:56,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:42:56,859 INFO L85 PathProgramCache]: Analyzing trace with hash -214912590, now seen corresponding path program 1 times [2025-03-17 01:42:56,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:42:56,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465551807] [2025-03-17 01:42:56,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:42:56,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:42:56,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:42:56,862 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:42:56,863 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 (5)] Waiting until timeout for monitored process [2025-03-17 01:42:56,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 01:42:57,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 01:42:57,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:42:57,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:42:57,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 01:42:57,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:42:59,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 896 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2025-03-17 01:42:59,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:42:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 48 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-17 01:42:59,968 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:42:59,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465551807] [2025-03-17 01:42:59,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465551807] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:42:59,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:42:59,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-17 01:42:59,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378838713] [2025-03-17 01:42:59,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 01:42:59,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 01:42:59,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:42:59,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 01:42:59,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:42:59,970 INFO L87 Difference]: Start difference. First operand 143 states and 220 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2025-03-17 01:43:02,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:43:06,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:43:07,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:43:08,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:43:08,780 INFO L93 Difference]: Finished difference Result 329 states and 498 transitions. [2025-03-17 01:43:08,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 01:43:08,792 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) Word has length 191 [2025-03-17 01:43:08,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:43:08,794 INFO L225 Difference]: With dead ends: 329 [2025-03-17 01:43:08,794 INFO L226 Difference]: Without dead ends: 242 [2025-03-17 01:43:08,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2025-03-17 01:43:08,796 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 348 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:43:08,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 400 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2025-03-17 01:43:08,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-17 01:43:08,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 148. [2025-03-17 01:43:08,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 83 states have (on average 1.2289156626506024) internal successors, (102), 83 states have internal predecessors, (102), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 01:43:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 222 transitions. [2025-03-17 01:43:08,820 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 222 transitions. Word has length 191 [2025-03-17 01:43:08,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:43:08,820 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 222 transitions. [2025-03-17 01:43:08,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2025-03-17 01:43:08,821 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 222 transitions. [2025-03-17 01:43:08,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 01:43:08,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:43:08,822 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:43:08,839 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 (5)] Ended with exit code 0 [2025-03-17 01:43:09,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:43:09,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:43:09,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:43:09,023 INFO L85 PathProgramCache]: Analyzing trace with hash -745286164, now seen corresponding path program 1 times [2025-03-17 01:43:09,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:43:09,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150433066] [2025-03-17 01:43:09,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:43:09,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:43:09,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:43:09,025 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:43:09,026 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 (6)] Waiting until timeout for monitored process [2025-03-17 01:43:09,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 01:43:09,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 01:43:09,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:43:09,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:43:09,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 01:43:09,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:43:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 899 proven. 42 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2025-03-17 01:43:09,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:43:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 45 proven. 42 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-17 01:43:10,247 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:43:10,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150433066] [2025-03-17 01:43:10,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150433066] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:43:10,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:43:10,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2025-03-17 01:43:10,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261293855] [2025-03-17 01:43:10,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 01:43:10,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:43:10,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:43:10,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:43:10,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:43:10,250 INFO L87 Difference]: Start difference. First operand 148 states and 222 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-17 01:43:13,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:43:13,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:43:13,746 INFO L93 Difference]: Finished difference Result 249 states and 364 transitions. [2025-03-17 01:43:13,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 01:43:13,768 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 192 [2025-03-17 01:43:13,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:43:13,770 INFO L225 Difference]: With dead ends: 249 [2025-03-17 01:43:13,770 INFO L226 Difference]: Without dead ends: 161 [2025-03-17 01:43:13,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 375 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-17 01:43:13,771 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 102 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:43:13,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 192 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-17 01:43:13,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-17 01:43:13,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2025-03-17 01:43:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 86 states have internal predecessors, (94), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 01:43:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 214 transitions. [2025-03-17 01:43:13,803 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 214 transitions. Word has length 192 [2025-03-17 01:43:13,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:43:13,803 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 214 transitions. [2025-03-17 01:43:13,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-17 01:43:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 214 transitions. [2025-03-17 01:43:13,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-17 01:43:13,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:43:13,805 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:43:13,824 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 (6)] Ended with exit code 0 [2025-03-17 01:43:14,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:43:14,009 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:43:14,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:43:14,010 INFO L85 PathProgramCache]: Analyzing trace with hash 497563407, now seen corresponding path program 1 times [2025-03-17 01:43:14,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:43:14,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53156149] [2025-03-17 01:43:14,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:43:14,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:43:14,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:43:14,013 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:43:14,013 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 (7)] Waiting until timeout for monitored process [2025-03-17 01:43:14,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 01:43:14,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 01:43:14,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:43:14,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:43:14,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 01:43:14,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:43:15,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 689 proven. 21 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-03-17 01:43:15,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:43:15,595 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:43:15,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53156149] [2025-03-17 01:43:15,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53156149] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:43:15,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1063228030] [2025-03-17 01:43:15,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:43:15,595 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 01:43:15,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 01:43:15,598 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 01:43:15,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-17 01:43:15,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 01:43:15,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 01:43:15,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:43:15,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:43:15,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 01:43:15,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:43:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-17 01:43:16,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:43:16,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1063228030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:43:16,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:43:16,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-03-17 01:43:16,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90584529] [2025-03-17 01:43:16,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:43:16,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:43:16,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:43:16,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:43:16,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-17 01:43:16,096 INFO L87 Difference]: Start difference. First operand 153 states and 214 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-17 01:43:17,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:43:17,221 INFO L93 Difference]: Finished difference Result 245 states and 340 transitions. [2025-03-17 01:43:17,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:43:17,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2025-03-17 01:43:17,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:43:17,244 INFO L225 Difference]: With dead ends: 245 [2025-03-17 01:43:17,244 INFO L226 Difference]: Without dead ends: 153 [2025-03-17 01:43:17,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-17 01:43:17,245 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:43:17,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 332 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 01:43:17,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-17 01:43:17,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-03-17 01:43:17,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 86 states have (on average 1.0813953488372092) internal successors, (93), 86 states have internal predecessors, (93), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 01:43:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 213 transitions. [2025-03-17 01:43:17,266 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 213 transitions. Word has length 194 [2025-03-17 01:43:17,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:43:17,266 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 213 transitions. [2025-03-17 01:43:17,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-17 01:43:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 213 transitions. [2025-03-17 01:43:17,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-17 01:43:17,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:43:17,268 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:43:17,284 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 (7)] Ended with exit code 0 [2025-03-17 01:43:17,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2025-03-17 01:43:17,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 01:43:17,669 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:43:17,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:43:17,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1385067088, now seen corresponding path program 1 times [2025-03-17 01:43:17,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:43:17,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311362421] [2025-03-17 01:43:17,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:43:17,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:43:17,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:43:17,671 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:43:17,672 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 (9)] Waiting until timeout for monitored process [2025-03-17 01:43:17,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 01:43:17,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 01:43:17,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:43:17,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:43:17,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 01:43:17,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:43:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 689 proven. 21 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-03-17 01:43:19,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:43:19,300 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:43:19,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311362421] [2025-03-17 01:43:19,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311362421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:43:19,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [473920179] [2025-03-17 01:43:19,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:43:19,300 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 01:43:19,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 01:43:19,302 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 01:43:19,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-17 01:43:19,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 01:43:20,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 01:43:20,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:43:20,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:43:20,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 01:43:20,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:43:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 689 proven. 21 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-03-17 01:43:21,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:43:21,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [473920179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:43:21,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:43:21,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-03-17 01:43:21,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720841418] [2025-03-17 01:43:21,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 01:43:21,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:43:21,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:43:21,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:43:21,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:43:21,254 INFO L87 Difference]: Start difference. First operand 153 states and 213 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-17 01:43:24,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:43:26,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:43:26,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:43:26,463 INFO L93 Difference]: Finished difference Result 359 states and 477 transitions. [2025-03-17 01:43:26,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 01:43:26,490 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 194 [2025-03-17 01:43:26,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:43:26,493 INFO L225 Difference]: With dead ends: 359 [2025-03-17 01:43:26,493 INFO L226 Difference]: Without dead ends: 270 [2025-03-17 01:43:26,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2025-03-17 01:43:26,494 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 243 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:43:26,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 607 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-17 01:43:26,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-17 01:43:26,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 237. [2025-03-17 01:43:26,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 142 states have (on average 1.0845070422535212) internal successors, (154), 143 states have internal predecessors, (154), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 81 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 01:43:26,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 318 transitions. [2025-03-17 01:43:26,527 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 318 transitions. Word has length 194 [2025-03-17 01:43:26,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:43:26,527 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 318 transitions. [2025-03-17 01:43:26,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-17 01:43:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 318 transitions. [2025-03-17 01:43:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-17 01:43:26,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:43:26,529 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:43:26,542 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 (9)] Ended with exit code 0 [2025-03-17 01:43:26,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-03-17 01:43:26,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 01:43:26,930 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:43:26,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:43:26,930 INFO L85 PathProgramCache]: Analyzing trace with hash 879508463, now seen corresponding path program 1 times [2025-03-17 01:43:26,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:43:26,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745168786] [2025-03-17 01:43:26,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:43:26,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:43:26,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:43:26,932 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:43:26,933 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 (11)] Waiting until timeout for monitored process [2025-03-17 01:43:26,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 01:43:27,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 01:43:27,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:43:27,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:43:27,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 01:43:27,198 INFO L279 TraceCheckSpWp]: Computing forward predicates...