./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.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 cc702294ab762f82a4156ec02c3796a72ec39b54f7f827a72f56934681f39759 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:08:40,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:08:40,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:08:40,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:08:40,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:08:40,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:08:40,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:08:40,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:08:40,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:08:40,655 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:08:40,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:08:40,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:08:40,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:08:40,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:08:40,657 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:08:40,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:08:40,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:08:40,657 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:08:40,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:08:40,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:08:40,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:08:40,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:08:40,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:08:40,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:08:40,658 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:08:40,658 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:08:40,658 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:08:40,658 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:08:40,658 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:08:40,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:08:40,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:08:40,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:08:40,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:08:40,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:08:40,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:08:40,659 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:08:40,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:08:40,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:08:40,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:08:40,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:08:40,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:08:40,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:08:40,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:08:40,659 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 -> cc702294ab762f82a4156ec02c3796a72ec39b54f7f827a72f56934681f39759 [2025-03-08 11:08:40,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:08:40,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:08:40,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:08:40,882 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:08:40,882 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:08:40,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2025-03-08 11:08:41,986 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eed7af0e/2e51eb5585e242e5b3fc2e0a82d36df9/FLAGbac6681fc [2025-03-08 11:08:42,227 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:08:42,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2025-03-08 11:08:42,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eed7af0e/2e51eb5585e242e5b3fc2e0a82d36df9/FLAGbac6681fc [2025-03-08 11:08:42,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eed7af0e/2e51eb5585e242e5b3fc2e0a82d36df9 [2025-03-08 11:08:42,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:08:42,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:08:42,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:08:42,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:08:42,555 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:08:42,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:08:42" (1/1) ... [2025-03-08 11:08:42,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0174ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:42, skipping insertion in model container [2025-03-08 11:08:42,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:08:42" (1/1) ... [2025-03-08 11:08:42,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:08:42,653 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_fillercodesize_ps-cn-25_file-4.i[914,927] [2025-03-08 11:08:42,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:08:42,713 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:08:42,723 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_fillercodesize_ps-cn-25_file-4.i[914,927] [2025-03-08 11:08:42,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:08:42,767 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:08:42,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:42 WrapperNode [2025-03-08 11:08:42,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:08:42,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:08:42,768 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:08:42,768 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:08:42,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:42" (1/1) ... [2025-03-08 11:08:42,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:42" (1/1) ... [2025-03-08 11:08:42,805 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2025-03-08 11:08:42,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:08:42,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:08:42,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:08:42,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:08:42,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:42" (1/1) ... [2025-03-08 11:08:42,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:42" (1/1) ... [2025-03-08 11:08:42,819 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:42" (1/1) ... [2025-03-08 11:08:42,832 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:08:42,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:42" (1/1) ... [2025-03-08 11:08:42,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:42" (1/1) ... [2025-03-08 11:08:42,842 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:42" (1/1) ... [2025-03-08 11:08:42,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:42" (1/1) ... [2025-03-08 11:08:42,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:42" (1/1) ... [2025-03-08 11:08:42,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:42" (1/1) ... [2025-03-08 11:08:42,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:08:42,852 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:08:42,852 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:08:42,852 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:08:42,853 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:42" (1/1) ... [2025-03-08 11:08:42,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:08:42,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:08:42,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:08:42,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:08:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:08:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:08:42,894 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:08:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:08:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:08:42,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:08:42,960 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:08:42,961 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:08:43,256 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 11:08:43,256 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:08:43,268 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:08:43,268 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:08:43,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:08:43 BoogieIcfgContainer [2025-03-08 11:08:43,268 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:08:43,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:08:43,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:08:43,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:08:43,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:08:42" (1/3) ... [2025-03-08 11:08:43,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@312e0e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:08:43, skipping insertion in model container [2025-03-08 11:08:43,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:42" (2/3) ... [2025-03-08 11:08:43,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@312e0e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:08:43, skipping insertion in model container [2025-03-08 11:08:43,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:08:43" (3/3) ... [2025-03-08 11:08:43,276 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2025-03-08 11:08:43,285 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:08:43,286 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-4.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:08:43,329 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:08:43,338 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;@20bd48a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:08:43,339 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:08:43,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 55 states have internal predecessors, (74), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 11:08:43,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-08 11:08:43,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:43,353 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:08:43,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:08:43,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:08:43,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1312259159, now seen corresponding path program 1 times [2025-03-08 11:08:43,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:08:43,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702927463] [2025-03-08 11:08:43,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:43,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:08:43,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 11:08:43,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 11:08:43,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:43,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-08 11:08:43,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:43,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702927463] [2025-03-08 11:08:43,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702927463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:08:43,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787292724] [2025-03-08 11:08:43,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:43,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:08:43,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:08:43,652 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:08:43,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:08:43,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 11:08:43,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 11:08:43,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:43,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:43,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:08:43,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:08:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-08 11:08:43,883 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:08:43,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787292724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:08:43,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:08:43,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:08:43,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51729255] [2025-03-08 11:08:43,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:08:43,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:08:43,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:08:43,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:08:43,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:08:43,901 INFO L87 Difference]: Start difference. First operand has 90 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 55 states have internal predecessors, (74), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) 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, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 11:08:43,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:08:43,922 INFO L93 Difference]: Finished difference Result 174 states and 308 transitions. [2025-03-08 11:08:43,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:08:43,925 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, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 207 [2025-03-08 11:08:43,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:08:43,931 INFO L225 Difference]: With dead ends: 174 [2025-03-08 11:08:43,931 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 11:08:43,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:08:43,938 INFO L435 NwaCegarLoop]: 134 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, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:08:43,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:08:43,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 11:08:43,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-08 11:08:43,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 11:08:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 134 transitions. [2025-03-08 11:08:43,971 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 134 transitions. Word has length 207 [2025-03-08 11:08:43,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:08:43,972 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 134 transitions. [2025-03-08 11:08:43,972 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, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 11:08:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 134 transitions. [2025-03-08 11:08:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 11:08:43,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:43,976 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:08:43,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:08:44,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:08:44,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:08:44,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:08:44,181 INFO L85 PathProgramCache]: Analyzing trace with hash -673406885, now seen corresponding path program 1 times [2025-03-08 11:08:44,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:08:44,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78929125] [2025-03-08 11:08:44,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:44,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:08:44,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 11:08:44,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 11:08:44,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:44,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 11:08:45,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:45,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78929125] [2025-03-08 11:08:45,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78929125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:08:45,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:08:45,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:08:45,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604672313] [2025-03-08 11:08:45,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:08:45,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:08:45,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:08:45,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:08:45,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:08:45,089 INFO L87 Difference]: Start difference. First operand 87 states and 134 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 11:08:45,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:08:45,407 INFO L93 Difference]: Finished difference Result 282 states and 429 transitions. [2025-03-08 11:08:45,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:08:45,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2025-03-08 11:08:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:08:45,411 INFO L225 Difference]: With dead ends: 282 [2025-03-08 11:08:45,412 INFO L226 Difference]: Without dead ends: 198 [2025-03-08 11:08:45,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:08:45,413 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 163 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:08:45,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 685 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:08:45,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-08 11:08:45,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 173. [2025-03-08 11:08:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 11:08:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 268 transitions. [2025-03-08 11:08:45,444 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 268 transitions. Word has length 208 [2025-03-08 11:08:45,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:08:45,444 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 268 transitions. [2025-03-08 11:08:45,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 11:08:45,444 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 268 transitions. [2025-03-08 11:08:45,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 11:08:45,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:45,449 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:08:45,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:08:45,449 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:08:45,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:08:45,450 INFO L85 PathProgramCache]: Analyzing trace with hash -672483364, now seen corresponding path program 1 times [2025-03-08 11:08:45,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:08:45,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789980296] [2025-03-08 11:08:45,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:45,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:08:45,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 11:08:45,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 11:08:45,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:45,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 11:08:46,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:46,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789980296] [2025-03-08 11:08:46,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789980296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:08:46,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:08:46,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:08:46,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452325571] [2025-03-08 11:08:46,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:08:46,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:08:46,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:08:46,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:08:46,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:08:46,105 INFO L87 Difference]: Start difference. First operand 173 states and 268 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2025-03-08 11:08:46,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:08:46,306 INFO L93 Difference]: Finished difference Result 469 states and 726 transitions. [2025-03-08 11:08:46,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:08:46,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 208 [2025-03-08 11:08:46,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:08:46,310 INFO L225 Difference]: With dead ends: 469 [2025-03-08 11:08:46,312 INFO L226 Difference]: Without dead ends: 299 [2025-03-08 11:08:46,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:08:46,314 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 207 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:08:46,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 238 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:08:46,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-08 11:08:46,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2025-03-08 11:08:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 184 states have (on average 1.326086956521739) internal successors, (244), 186 states have internal predecessors, (244), 106 states have call successors, (106), 4 states have call predecessors, (106), 4 states have return successors, (106), 104 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-08 11:08:46,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 456 transitions. [2025-03-08 11:08:46,371 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 456 transitions. Word has length 208 [2025-03-08 11:08:46,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:08:46,371 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 456 transitions. [2025-03-08 11:08:46,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2025-03-08 11:08:46,372 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 456 transitions. [2025-03-08 11:08:46,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 11:08:46,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:46,373 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:08:46,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:08:46,374 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:08:46,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:08:46,374 INFO L85 PathProgramCache]: Analyzing trace with hash 680826333, now seen corresponding path program 1 times [2025-03-08 11:08:46,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:08:46,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422706586] [2025-03-08 11:08:46,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:46,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:08:46,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 11:08:46,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 11:08:46,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:46,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 11:08:50,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:50,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422706586] [2025-03-08 11:08:50,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422706586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:08:50,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:08:50,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 11:08:50,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763255975] [2025-03-08 11:08:50,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:08:50,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 11:08:50,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:08:50,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 11:08:50,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:08:50,496 INFO L87 Difference]: Start difference. First operand 295 states and 456 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 11:08:51,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:08:51,589 INFO L93 Difference]: Finished difference Result 902 states and 1363 transitions. [2025-03-08 11:08:51,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 11:08:51,590 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2025-03-08 11:08:51,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:08:51,596 INFO L225 Difference]: With dead ends: 902 [2025-03-08 11:08:51,596 INFO L226 Difference]: Without dead ends: 610 [2025-03-08 11:08:51,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:08:51,597 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 190 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 11:08:51,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 728 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 11:08:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-03-08 11:08:51,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 428. [2025-03-08 11:08:51,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 282 states have (on average 1.326241134751773) internal successors, (374), 284 states have internal predecessors, (374), 139 states have call successors, (139), 6 states have call predecessors, (139), 6 states have return successors, (139), 137 states have call predecessors, (139), 139 states have call successors, (139) [2025-03-08 11:08:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 652 transitions. [2025-03-08 11:08:51,643 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 652 transitions. Word has length 208 [2025-03-08 11:08:51,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:08:51,644 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 652 transitions. [2025-03-08 11:08:51,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 11:08:51,644 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 652 transitions. [2025-03-08 11:08:51,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 11:08:51,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:51,645 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:08:51,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:08:51,646 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:08:51,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:08:51,647 INFO L85 PathProgramCache]: Analyzing trace with hash 809909052, now seen corresponding path program 1 times [2025-03-08 11:08:51,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:08:51,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106077459] [2025-03-08 11:08:51,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:51,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:08:51,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 11:08:51,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 11:08:51,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:51,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 11:08:51,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:51,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106077459] [2025-03-08 11:08:51,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106077459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:08:51,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:08:51,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:08:51,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121982196] [2025-03-08 11:08:51,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:08:51,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:08:51,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:08:51,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:08:51,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:08:51,845 INFO L87 Difference]: Start difference. First operand 428 states and 652 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 11:08:51,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:08:51,924 INFO L93 Difference]: Finished difference Result 1026 states and 1576 transitions. [2025-03-08 11:08:51,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:08:51,925 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2025-03-08 11:08:51,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:08:51,933 INFO L225 Difference]: With dead ends: 1026 [2025-03-08 11:08:51,933 INFO L226 Difference]: Without dead ends: 720 [2025-03-08 11:08:51,935 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-08 11:08:51,936 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 66 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:08:51,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 264 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:08:51,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-03-08 11:08:52,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 718. [2025-03-08 11:08:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 462 states have (on average 1.3116883116883118) internal successors, (606), 466 states have internal predecessors, (606), 245 states have call successors, (245), 10 states have call predecessors, (245), 10 states have return successors, (245), 241 states have call predecessors, (245), 245 states have call successors, (245) [2025-03-08 11:08:52,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1096 transitions. [2025-03-08 11:08:52,017 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1096 transitions. Word has length 208 [2025-03-08 11:08:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:08:52,019 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1096 transitions. [2025-03-08 11:08:52,019 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 11:08:52,019 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1096 transitions. [2025-03-08 11:08:52,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-08 11:08:52,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:52,022 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:08:52,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:08:52,023 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:08:52,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:08:52,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1048374487, now seen corresponding path program 1 times [2025-03-08 11:08:52,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:08:52,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010289978] [2025-03-08 11:08:52,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:52,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:08:52,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 11:08:52,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 11:08:52,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:52,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-08 11:08:52,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:52,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010289978] [2025-03-08 11:08:52,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010289978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:08:52,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481220785] [2025-03-08 11:08:52,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:52,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:08:52,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:08:52,274 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:08:52,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 11:08:52,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 11:08:52,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 11:08:52,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:52,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:52,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:08:52,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:08:52,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 386 proven. 87 refuted. 0 times theorem prover too weak. 1639 trivial. 0 not checked. [2025-03-08 11:08:52,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:08:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-08 11:08:52,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481220785] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:08:52,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:08:52,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 11:08:52,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283919321] [2025-03-08 11:08:52,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:08:52,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:08:52,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:08:52,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:08:52,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:08:52,887 INFO L87 Difference]: Start difference. First operand 718 states and 1096 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2025-03-08 11:08:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:08:53,081 INFO L93 Difference]: Finished difference Result 1348 states and 2014 transitions. [2025-03-08 11:08:53,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:08:53,082 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 209 [2025-03-08 11:08:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:08:53,087 INFO L225 Difference]: With dead ends: 1348 [2025-03-08 11:08:53,087 INFO L226 Difference]: Without dead ends: 758 [2025-03-08 11:08:53,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 415 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:08:53,090 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 72 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:08:53,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 200 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:08:53,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-03-08 11:08:53,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 692. [2025-03-08 11:08:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 427 states have (on average 1.2060889929742389) internal successors, (515), 431 states have internal predecessors, (515), 245 states have call successors, (245), 19 states have call predecessors, (245), 19 states have return successors, (245), 241 states have call predecessors, (245), 245 states have call successors, (245) [2025-03-08 11:08:53,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1005 transitions. [2025-03-08 11:08:53,165 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1005 transitions. Word has length 209 [2025-03-08 11:08:53,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:08:53,166 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 1005 transitions. [2025-03-08 11:08:53,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2025-03-08 11:08:53,166 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1005 transitions. [2025-03-08 11:08:53,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-08 11:08:53,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:53,167 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:08:53,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 11:08:53,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 11:08:53,368 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:08:53,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:08:53,369 INFO L85 PathProgramCache]: Analyzing trace with hash 777398825, now seen corresponding path program 1 times [2025-03-08 11:08:53,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:08:53,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869716711] [2025-03-08 11:08:53,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:53,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:08:53,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 11:08:53,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 11:08:53,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:53,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:53,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 11:08:53,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:53,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869716711] [2025-03-08 11:08:53,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869716711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:08:53,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:08:53,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:08:53,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971747993] [2025-03-08 11:08:53,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:08:53,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:08:53,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:08:53,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:08:53,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:08:53,533 INFO L87 Difference]: Start difference. First operand 692 states and 1005 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 11:08:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:08:53,760 INFO L93 Difference]: Finished difference Result 1266 states and 1845 transitions. [2025-03-08 11:08:53,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:08:53,761 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2025-03-08 11:08:53,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:08:53,768 INFO L225 Difference]: With dead ends: 1266 [2025-03-08 11:08:53,768 INFO L226 Difference]: Without dead ends: 972 [2025-03-08 11:08:53,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-08 11:08:53,769 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 129 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:08:53,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 498 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:08:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2025-03-08 11:08:53,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 966. [2025-03-08 11:08:53,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 587 states have (on average 1.1942078364565587) internal successors, (701), 593 states have internal predecessors, (701), 351 states have call successors, (351), 27 states have call predecessors, (351), 27 states have return successors, (351), 345 states have call predecessors, (351), 351 states have call successors, (351) [2025-03-08 11:08:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1403 transitions. [2025-03-08 11:08:53,849 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1403 transitions. Word has length 209 [2025-03-08 11:08:53,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:08:53,850 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1403 transitions. [2025-03-08 11:08:53,850 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 11:08:53,850 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1403 transitions. [2025-03-08 11:08:53,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-08 11:08:53,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:53,852 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:08:53,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:08:53,852 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:08:53,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:08:53,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1030055638, now seen corresponding path program 1 times [2025-03-08 11:08:53,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:08:53,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756910360] [2025-03-08 11:08:53,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:53,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:08:53,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 11:08:53,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 11:08:53,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:53,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:54,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 51 proven. 135 refuted. 0 times theorem prover too weak. 1926 trivial. 0 not checked. [2025-03-08 11:08:54,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:54,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756910360] [2025-03-08 11:08:54,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756910360] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:08:54,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143495107] [2025-03-08 11:08:54,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:54,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:08:54,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:08:54,507 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:08:54,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 11:08:54,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 11:08:54,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 11:08:54,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:54,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:54,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 11:08:54,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:08:57,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 828 proven. 402 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-08 11:08:57,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:09:28,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143495107] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:09:28,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:09:28,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19] total 28 [2025-03-08 11:09:28,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602101105] [2025-03-08 11:09:28,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 11:09:28,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 11:09:28,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:09:28,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 11:09:28,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=1228, Unknown=4, NotChecked=0, Total=1640 [2025-03-08 11:09:28,971 INFO L87 Difference]: Start difference. First operand 966 states and 1403 transitions. Second operand has 28 states, 28 states have (on average 3.9285714285714284) internal successors, (110), 26 states have internal predecessors, (110), 9 states have call successors, (66), 7 states have call predecessors, (66), 10 states have return successors, (66), 9 states have call predecessors, (66), 9 states have call successors, (66) [2025-03-08 11:09:32,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:09:32,388 INFO L93 Difference]: Finished difference Result 1720 states and 2280 transitions. [2025-03-08 11:09:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-03-08 11:09:32,392 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.9285714285714284) internal successors, (110), 26 states have internal predecessors, (110), 9 states have call successors, (66), 7 states have call predecessors, (66), 10 states have return successors, (66), 9 states have call predecessors, (66), 9 states have call successors, (66) Word has length 209 [2025-03-08 11:09:32,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:09:32,399 INFO L225 Difference]: With dead ends: 1720 [2025-03-08 11:09:32,399 INFO L226 Difference]: Without dead ends: 1134 [2025-03-08 11:09:32,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4603 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=3355, Invalid=11403, Unknown=4, NotChecked=0, Total=14762 [2025-03-08 11:09:32,405 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 736 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 581 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:09:32,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 788 Invalid, 1811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [581 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 11:09:32,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2025-03-08 11:09:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 735. [2025-03-08 11:09:32,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 479 states have (on average 1.1461377870563674) internal successors, (549), 484 states have internal predecessors, (549), 196 states have call successors, (196), 59 states have call predecessors, (196), 59 states have return successors, (196), 191 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-08 11:09:32,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 941 transitions. [2025-03-08 11:09:32,515 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 941 transitions. Word has length 209 [2025-03-08 11:09:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:09:32,516 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 941 transitions. [2025-03-08 11:09:32,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.9285714285714284) internal successors, (110), 26 states have internal predecessors, (110), 9 states have call successors, (66), 7 states have call predecessors, (66), 10 states have return successors, (66), 9 states have call predecessors, (66), 9 states have call successors, (66) [2025-03-08 11:09:32,516 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 941 transitions. [2025-03-08 11:09:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-08 11:09:32,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:09:32,521 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:09:32,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 11:09:32,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:09:32,723 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:09:32,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:09:32,724 INFO L85 PathProgramCache]: Analyzing trace with hash 720471143, now seen corresponding path program 1 times [2025-03-08 11:09:32,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:09:32,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076623801] [2025-03-08 11:09:32,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:32,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:09:32,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 11:09:32,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 11:09:32,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:32,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:09:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 3 proven. 93 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-08 11:09:32,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:09:32,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076623801] [2025-03-08 11:09:32,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076623801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:09:32,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618200528] [2025-03-08 11:09:32,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:32,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:09:32,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:09:32,960 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:09:32,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 11:09:33,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 11:09:33,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 11:09:33,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:33,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:09:33,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 11:09:33,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:09:33,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 158 proven. 93 refuted. 0 times theorem prover too weak. 1861 trivial. 0 not checked. [2025-03-08 11:09:33,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:09:33,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 3 proven. 93 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-08 11:09:33,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618200528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:09:33,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:09:33,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 11:09:33,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782668206] [2025-03-08 11:09:33,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:09:33,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 11:09:33,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:09:33,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 11:09:33,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:09:33,503 INFO L87 Difference]: Start difference. First operand 735 states and 941 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2025-03-08 11:09:34,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:09:34,135 INFO L93 Difference]: Finished difference Result 1693 states and 2121 transitions. [2025-03-08 11:09:34,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 11:09:34,137 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) Word has length 209 [2025-03-08 11:09:34,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:09:34,141 INFO L225 Difference]: With dead ends: 1693 [2025-03-08 11:09:34,142 INFO L226 Difference]: Without dead ends: 1072 [2025-03-08 11:09:34,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 411 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2025-03-08 11:09:34,143 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 183 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:09:34,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 682 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:09:34,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-03-08 11:09:34,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 725. [2025-03-08 11:09:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 469 states have (on average 1.1321961620469083) internal successors, (531), 472 states have internal predecessors, (531), 192 states have call successors, (192), 63 states have call predecessors, (192), 63 states have return successors, (192), 189 states have call predecessors, (192), 192 states have call successors, (192) [2025-03-08 11:09:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 915 transitions. [2025-03-08 11:09:34,229 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 915 transitions. Word has length 209 [2025-03-08 11:09:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:09:34,230 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 915 transitions. [2025-03-08 11:09:34,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2025-03-08 11:09:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 915 transitions. [2025-03-08 11:09:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-08 11:09:34,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:09:34,231 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:09:34,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 11:09:34,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:09:34,432 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:09:34,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:09:34,432 INFO L85 PathProgramCache]: Analyzing trace with hash 721394664, now seen corresponding path program 1 times [2025-03-08 11:09:34,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:09:34,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841295852] [2025-03-08 11:09:34,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:34,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:09:34,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 11:09:34,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 11:09:34,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:34,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:09:34,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 11:09:34,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:09:34,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841295852] [2025-03-08 11:09:34,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841295852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:09:34,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:09:34,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:09:34,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636225610] [2025-03-08 11:09:34,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:09:34,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:09:34,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:09:34,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:09:34,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:09:34,523 INFO L87 Difference]: Start difference. First operand 725 states and 915 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 11:09:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:09:34,608 INFO L93 Difference]: Finished difference Result 1145 states and 1442 transitions. [2025-03-08 11:09:34,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:09:34,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2025-03-08 11:09:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:09:34,612 INFO L225 Difference]: With dead ends: 1145 [2025-03-08 11:09:34,612 INFO L226 Difference]: Without dead ends: 518 [2025-03-08 11:09:34,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-08 11:09:34,614 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:09:34,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:09:34,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-08 11:09:34,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2025-03-08 11:09:34,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 333 states have (on average 1.12012012012012) internal successors, (373), 335 states have internal predecessors, (373), 139 states have call successors, (139), 45 states have call predecessors, (139), 45 states have return successors, (139), 137 states have call predecessors, (139), 139 states have call successors, (139) [2025-03-08 11:09:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 651 transitions. [2025-03-08 11:09:34,689 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 651 transitions. Word has length 209 [2025-03-08 11:09:34,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:09:34,690 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 651 transitions. [2025-03-08 11:09:34,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 11:09:34,690 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 651 transitions. [2025-03-08 11:09:34,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 11:09:34,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:09:34,692 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:09:34,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:09:34,693 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:09:34,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:09:34,693 INFO L85 PathProgramCache]: Analyzing trace with hash 2035017086, now seen corresponding path program 1 times [2025-03-08 11:09:34,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:09:34,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221133528] [2025-03-08 11:09:34,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:34,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:09:34,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 11:09:34,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 11:09:34,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:34,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:09:34,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1321070131] [2025-03-08 11:09:34,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:34,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:09:34,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:09:34,792 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:09:34,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 11:09:34,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 11:09:34,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 11:09:34,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:34,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:09:34,909 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 11:09:34,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 11:09:34,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 11:09:34,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:34,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:09:35,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 11:09:35,062 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 11:09:35,063 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 11:09:35,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 11:09:35,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 11:09:35,267 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:09:35,367 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 11:09:35,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 11:09:35 BoogieIcfgContainer [2025-03-08 11:09:35,369 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 11:09:35,370 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 11:09:35,370 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 11:09:35,370 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 11:09:35,370 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:08:43" (3/4) ... [2025-03-08 11:09:35,372 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 11:09:35,372 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 11:09:35,373 INFO L158 Benchmark]: Toolchain (without parser) took 52821.16ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 122.1MB in the beginning and 367.5MB in the end (delta: -245.4MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2025-03-08 11:09:35,373 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:09:35,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.09ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 106.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 11:09:35,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.73ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 103.5MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:09:35,373 INFO L158 Benchmark]: Boogie Preprocessor took 45.54ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 100.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:09:35,374 INFO L158 Benchmark]: IcfgBuilder took 415.88ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 74.6MB in the end (delta: 25.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 11:09:35,374 INFO L158 Benchmark]: TraceAbstraction took 52098.02ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 74.1MB in the beginning and 367.7MB in the end (delta: -293.5MB). Peak memory consumption was 193.8MB. Max. memory is 16.1GB. [2025-03-08 11:09:35,374 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 427.8MB. Free memory was 367.7MB in the beginning and 367.5MB in the end (delta: 129.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 11:09:35,375 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.19ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.09ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 106.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.73ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 103.5MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.54ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 100.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 415.88ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 74.6MB in the end (delta: 25.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 52098.02ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 74.1MB in the beginning and 367.7MB in the end (delta: -293.5MB). Peak memory consumption was 193.8MB. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 427.8MB. Free memory was 367.7MB in the beginning and 367.5MB in the end (delta: 129.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 163, overapproximation of someBinaryFLOATComparisonOperation at line 161, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of someBinaryDOUBLEComparisonOperation at line 186, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 110. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 4; [L26] unsigned short int var_1_9 = 4; [L27] unsigned short int var_1_10 = 10; [L28] double var_1_11 = 15.6; [L29] double var_1_12 = 256.4; [L30] double var_1_13 = 49.15; [L31] unsigned long int var_1_14 = 500; [L32] unsigned long int var_1_15 = 2173307753; [L33] unsigned long int var_1_16 = 3362224480; [L34] signed short int var_1_17 = 16; [L35] signed short int var_1_19 = 16; [L36] signed short int var_1_20 = 4; [L37] signed short int var_1_21 = 0; [L38] signed short int var_1_22 = -25; [L39] signed char var_1_23 = 1; [L40] signed char var_1_24 = 2; [L41] signed short int var_1_25 = -500; [L42] signed char var_1_26 = -2; [L43] float var_1_27 = 31.25; [L44] float var_1_28 = 2.95; [L45] signed char var_1_29 = 10; [L46] double var_1_30 = 0.5; [L47] unsigned char var_1_31 = 0; [L48] unsigned short int var_1_32 = 1; [L49] double var_1_33 = 3.2; [L50] unsigned char var_1_34 = 2; [L51] unsigned char var_1_35 = 4; [L52] signed long int var_1_36 = -256; [L53] unsigned short int var_1_37 = 64; [L54] unsigned short int var_1_38 = 16; [L55] unsigned short int last_1_var_1_6 = 4; [L56] unsigned short int last_1_var_1_9 = 4; [L57] unsigned long int last_1_var_1_14 = 500; [L58] signed short int last_1_var_1_17 = 16; VAL [isInitial=0, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L190] isInitial = 1 [L191] FCALL initially() [L192] COND TRUE 1 [L193] CALL updateLastVariables() [L180] last_1_var_1_6 = var_1_6 [L181] last_1_var_1_9 = var_1_9 [L182] last_1_var_1_14 = var_1_14 [L183] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L193] RET updateLastVariables() [L194] CALL updateVariables() [L126] var_1_4 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_5=0, var_1_6=4, var_1_9=4] [L127] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_5=0, var_1_6=4, var_1_9=4] [L128] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L128] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L129] var_1_5 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_6=4, var_1_9=4] [L130] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_6=4, var_1_9=4] [L131] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L131] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L132] var_1_10 = __VERIFIER_nondet_ushort() [L133] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L133] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L134] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L135] var_1_12 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L136] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L137] var_1_13 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L138] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L139] var_1_15 = __VERIFIER_nondet_ulong() [L140] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L140] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L141] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L141] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L142] var_1_16 = __VERIFIER_nondet_ulong() [L143] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L143] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L144] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L144] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L145] var_1_19 = __VERIFIER_nondet_short() [L146] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L146] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L147] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L147] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L148] var_1_20 = __VERIFIER_nondet_short() [L149] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L149] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L150] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L150] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L151] var_1_21 = __VERIFIER_nondet_short() [L152] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L153] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L153] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L154] var_1_22 = __VERIFIER_nondet_short() [L155] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L155] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L156] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L156] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L157] var_1_24 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_24 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L158] RET assume_abort_if_not(var_1_24 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L159] CALL assume_abort_if_not(var_1_24 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L159] RET assume_abort_if_not(var_1_24 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L160] var_1_27 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L161] RET assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L162] var_1_28 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L163] RET assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L164] var_1_29 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_29 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L165] RET assume_abort_if_not(var_1_29 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L166] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L166] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L167] var_1_31 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L168] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L169] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L169] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L170] var_1_32 = __VERIFIER_nondet_ushort() [L171] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L171] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L172] CALL assume_abort_if_not(var_1_32 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L172] RET assume_abort_if_not(var_1_32 <= 65535) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L173] var_1_33 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L174] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L175] var_1_35 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L176] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L177] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=1, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=1, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L177] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=1, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L194] RET updateVariables() [L195] CALL step() [L62] var_1_23 = var_1_24 [L63] var_1_25 = var_1_23 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=1, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L64] COND TRUE (- var_1_27) >= var_1_28 [L65] var_1_26 = ((((var_1_24) > (var_1_29)) ? (var_1_24) : (var_1_29))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=1, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L67] COND FALSE !(\read(var_1_31)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=1, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L72] COND FALSE !(var_1_26 < var_1_24) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=1, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L75] COND TRUE var_1_34 != ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))) [L76] var_1_36 = (((((var_1_34 - var_1_32)) < ((((((var_1_24 + var_1_26)) < (var_1_25)) ? ((var_1_24 + var_1_26)) : (var_1_25))))) ? ((var_1_34 - var_1_32)) : ((((((var_1_24 + var_1_26)) < (var_1_25)) ? ((var_1_24 + var_1_26)) : (var_1_25)))))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L78] var_1_37 = var_1_34 [L79] var_1_38 = var_1_35 [L80] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=2, var_1_38=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L81] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=2, var_1_38=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L86] signed long int stepLocal_3 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_3=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=2, var_1_38=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L87] COND TRUE last_1_var_1_14 >= stepLocal_3 [L88] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=2, var_1_38=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L90] COND TRUE var_1_6 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=2, var_1_38=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L91] COND TRUE (- var_1_14) > var_1_6 [L92] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=2, var_1_38=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L97] unsigned char stepLocal_2 = var_1_4; [L98] unsigned long int stepLocal_1 = var_1_14; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=11811160046, stepLocal_2=0, var_1_10=0, var_1_11=78/5, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=2, var_1_38=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L99] COND FALSE !(stepLocal_2 || var_1_1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=11811160046, var_1_10=0, var_1_11=78/5, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=2, var_1_38=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L102] COND TRUE stepLocal_1 >= var_1_6 [L103] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=2, var_1_38=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L108] unsigned char stepLocal_5 = var_1_1; [L109] unsigned char stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=2, var_1_38=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L110] COND FALSE !(stepLocal_4 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=2, var_1_38=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L117] COND TRUE var_1_14 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=2, var_1_38=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L118] COND TRUE ! var_1_1 [L119] var_1_11 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=2, var_1_38=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L195] RET step() [L196] CALL, EXPR property() [L186-L187] return ((((((var_1_6 <= var_1_14) ? (((- var_1_14) > var_1_6) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((last_1_var_1_14 * (last_1_var_1_6 + last_1_var_1_17)) > last_1_var_1_9) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_14 >= var_1_6) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_14 <= var_1_14) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((last_1_var_1_14 >= last_1_var_1_9) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (last_1_var_1_17 >= ((((var_1_14) > (var_1_6)) ? (var_1_14) : (var_1_6))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=2, var_1_38=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L196] RET, EXPR property() [L196] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=2, var_1_38=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=2, var_1_38=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 173 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 52.0s, OverallIterations: 11, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1900 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1865 mSDsluCounter, 4338 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2775 mSDsCounter, 833 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2897 IncrementalHoareTripleChecker+Invalid, 3730 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 833 mSolverCounterUnsat, 1563 mSDtfsCounter, 2897 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1617 GetRequests, 1438 SyntacticMatches, 4 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4703 ImplicationChecksByTransitivity, 31.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=966occurred in iteration=7, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 1031 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 42.1s InterpolantComputationTime, 3338 NumberOfCodeBlocks, 3338 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3320 ConstructedInterpolants, 0 QuantifiedInterpolants, 17465 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1954 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 32651/33792 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 11:09:35,497 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_fillercodesize_ps-cn-25_file-4.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 cc702294ab762f82a4156ec02c3796a72ec39b54f7f827a72f56934681f39759 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:09:37,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:09:37,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 11:09:37,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:09:37,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:09:37,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:09:37,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:09:37,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:09:37,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:09:37,331 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:09:37,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:09:37,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:09:37,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:09:37,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:09:37,332 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:09:37,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:09:37,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:09:37,333 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:09:37,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:09:37,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:09:37,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:09:37,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:09:37,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:09:37,333 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 11:09:37,334 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 11:09:37,334 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 11:09:37,334 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:09:37,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:09:37,334 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:09:37,334 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:09:37,334 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:09:37,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:09:37,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:09:37,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:09:37,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:09:37,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:09:37,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:09:37,335 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:09:37,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:09:37,335 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 11:09:37,335 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 11:09:37,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:09:37,335 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:09:37,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:09:37,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:09:37,335 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 -> cc702294ab762f82a4156ec02c3796a72ec39b54f7f827a72f56934681f39759 [2025-03-08 11:09:37,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:09:37,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:09:37,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:09:37,633 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:09:37,634 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:09:37,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2025-03-08 11:09:38,785 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2dcb9cff/d33a12d4b7ba4b6b896a1e885f8e7805/FLAGbbd259e6f [2025-03-08 11:09:38,992 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:09:38,992 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2025-03-08 11:09:39,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2dcb9cff/d33a12d4b7ba4b6b896a1e885f8e7805/FLAGbbd259e6f [2025-03-08 11:09:39,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2dcb9cff/d33a12d4b7ba4b6b896a1e885f8e7805 [2025-03-08 11:09:39,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:09:39,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:09:39,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:09:39,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:09:39,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:09:39,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:09:39" (1/1) ... [2025-03-08 11:09:39,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@140e74d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:39, skipping insertion in model container [2025-03-08 11:09:39,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:09:39" (1/1) ... [2025-03-08 11:09:39,048 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:09:39,153 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_fillercodesize_ps-cn-25_file-4.i[914,927] [2025-03-08 11:09:39,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:09:39,234 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:09:39,245 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_fillercodesize_ps-cn-25_file-4.i[914,927] [2025-03-08 11:09:39,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:09:39,300 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:09:39,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:39 WrapperNode [2025-03-08 11:09:39,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:09:39,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:09:39,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:09:39,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:09:39,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:39" (1/1) ... [2025-03-08 11:09:39,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:39" (1/1) ... [2025-03-08 11:09:39,348 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2025-03-08 11:09:39,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:09:39,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:09:39,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:09:39,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:09:39,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:39" (1/1) ... [2025-03-08 11:09:39,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:39" (1/1) ... [2025-03-08 11:09:39,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:39" (1/1) ... [2025-03-08 11:09:39,383 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:09:39,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:39" (1/1) ... [2025-03-08 11:09:39,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:39" (1/1) ... [2025-03-08 11:09:39,399 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:39" (1/1) ... [2025-03-08 11:09:39,400 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:39" (1/1) ... [2025-03-08 11:09:39,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:39" (1/1) ... [2025-03-08 11:09:39,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:39" (1/1) ... [2025-03-08 11:09:39,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:09:39,414 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:09:39,414 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:09:39,414 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:09:39,415 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:39" (1/1) ... [2025-03-08 11:09:39,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:09:39,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:09:39,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:09:39,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:09:39,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:09:39,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 11:09:39,466 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:09:39,466 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:09:39,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:09:39,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:09:39,535 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:09:39,537 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:09:40,191 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 11:09:40,191 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:09:40,201 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:09:40,201 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:09:40,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:09:40 BoogieIcfgContainer [2025-03-08 11:09:40,201 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:09:40,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:09:40,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:09:40,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:09:40,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:09:39" (1/3) ... [2025-03-08 11:09:40,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ec7e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:09:40, skipping insertion in model container [2025-03-08 11:09:40,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:39" (2/3) ... [2025-03-08 11:09:40,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ec7e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:09:40, skipping insertion in model container [2025-03-08 11:09:40,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:09:40" (3/3) ... [2025-03-08 11:09:40,208 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2025-03-08 11:09:40,218 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:09:40,220 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-4.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:09:40,260 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:09:40,270 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;@64952763, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:09:40,270 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:09:40,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 55 states have internal predecessors, (74), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 11:09:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-08 11:09:40,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:09:40,281 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:09:40,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:09:40,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:09:40,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1312259159, now seen corresponding path program 1 times [2025-03-08 11:09:40,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:09:40,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544060779] [2025-03-08 11:09:40,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:40,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:09:40,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:09:40,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:09:40,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 11:09:40,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 11:09:40,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 11:09:40,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:40,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:09:40,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:09:40,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:09:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 688 proven. 0 refuted. 0 times theorem prover too weak. 1424 trivial. 0 not checked. [2025-03-08 11:09:40,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:09:40,636 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:09:40,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544060779] [2025-03-08 11:09:40,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544060779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:09:40,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:09:40,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 11:09:40,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258374823] [2025-03-08 11:09:40,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:09:40,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:09:40,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:09:40,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:09:40,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:09:40,661 INFO L87 Difference]: Start difference. First operand has 90 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 55 states have internal predecessors, (74), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 11:09:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:09:40,687 INFO L93 Difference]: Finished difference Result 174 states and 308 transitions. [2025-03-08 11:09:40,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:09:40,689 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 207 [2025-03-08 11:09:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:09:40,693 INFO L225 Difference]: With dead ends: 174 [2025-03-08 11:09:40,694 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 11:09:40,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:09:40,698 INFO L435 NwaCegarLoop]: 134 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, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:09:40,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:09:40,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 11:09:40,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-08 11:09:40,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 11:09:40,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 134 transitions. [2025-03-08 11:09:40,730 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 134 transitions. Word has length 207 [2025-03-08 11:09:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:09:40,732 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 134 transitions. [2025-03-08 11:09:40,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 11:09:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 134 transitions. [2025-03-08 11:09:40,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 11:09:40,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:09:40,734 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:09:40,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 11:09:40,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:09:40,935 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:09:40,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:09:40,936 INFO L85 PathProgramCache]: Analyzing trace with hash -673406885, now seen corresponding path program 1 times [2025-03-08 11:09:40,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:09:40,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044829079] [2025-03-08 11:09:40,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:40,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:09:40,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:09:40,943 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:09:40,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 11:09:40,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 11:09:41,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 11:09:41,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:41,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:09:41,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 11:09:41,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:09:41,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 11:09:41,238 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:09:41,238 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:09:41,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044829079] [2025-03-08 11:09:41,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044829079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:09:41,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:09:41,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:09:41,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436637515] [2025-03-08 11:09:41,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:09:41,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:09:41,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:09:41,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:09:41,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:09:41,249 INFO L87 Difference]: Start difference. First operand 87 states and 134 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 11:09:41,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:09:41,291 INFO L93 Difference]: Finished difference Result 248 states and 383 transitions. [2025-03-08 11:09:41,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:09:41,292 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2025-03-08 11:09:41,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:09:41,294 INFO L225 Difference]: With dead ends: 248 [2025-03-08 11:09:41,294 INFO L226 Difference]: Without dead ends: 164 [2025-03-08 11:09:41,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 206 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-08 11:09:41,295 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 116 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:09:41,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 343 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:09:41,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-08 11:09:41,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2025-03-08 11:09:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 95 states have internal predecessors, (121), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 11:09:41,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 249 transitions. [2025-03-08 11:09:41,316 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 249 transitions. Word has length 208 [2025-03-08 11:09:41,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:09:41,317 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 249 transitions. [2025-03-08 11:09:41,317 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 11:09:41,317 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 249 transitions. [2025-03-08 11:09:41,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 11:09:41,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:09:41,319 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:09:41,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-08 11:09:41,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:09:41,519 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:09:41,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:09:41,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1183941062, now seen corresponding path program 1 times [2025-03-08 11:09:41,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:09:41,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168517542] [2025-03-08 11:09:41,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:41,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:09:41,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:09:41,523 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:09:41,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 11:09:41,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 11:09:41,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 11:09:41,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:41,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:09:41,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 11:09:41,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:09:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 309 proven. 177 refuted. 0 times theorem prover too weak. 1626 trivial. 0 not checked. [2025-03-08 11:09:42,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:09:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 180 refuted. 0 times theorem prover too weak. 1923 trivial. 0 not checked. [2025-03-08 11:09:43,066 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:09:43,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168517542] [2025-03-08 11:09:43,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168517542] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:09:43,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:09:43,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2025-03-08 11:09:43,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030056874] [2025-03-08 11:09:43,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 11:09:43,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 11:09:43,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:09:43,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 11:09:43,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-08 11:09:43,070 INFO L87 Difference]: Start difference. First operand 161 states and 249 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2025-03-08 11:09:44,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:09:44,343 INFO L93 Difference]: Finished difference Result 369 states and 544 transitions. [2025-03-08 11:09:44,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 11:09:44,344 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) Word has length 208 [2025-03-08 11:09:44,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:09:44,348 INFO L225 Difference]: With dead ends: 369 [2025-03-08 11:09:44,348 INFO L226 Difference]: Without dead ends: 211 [2025-03-08 11:09:44,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 401 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2025-03-08 11:09:44,354 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 106 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:09:44,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 416 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 11:09:44,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-08 11:09:44,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 185. [2025-03-08 11:09:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 114 states have (on average 1.1666666666666667) internal successors, (133), 115 states have internal predecessors, (133), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 11:09:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 261 transitions. [2025-03-08 11:09:44,378 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 261 transitions. Word has length 208 [2025-03-08 11:09:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:09:44,379 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 261 transitions. [2025-03-08 11:09:44,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2025-03-08 11:09:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 261 transitions. [2025-03-08 11:09:44,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-08 11:09:44,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:09:44,382 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:09:44,392 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-08 11:09:44,582 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-08 11:09:44,582 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:09:44,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:09:44,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1167186421, now seen corresponding path program 1 times [2025-03-08 11:09:44,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:09:44,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106295250] [2025-03-08 11:09:44,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:44,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:09:44,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:09:44,585 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-08 11:09:44,586 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-08 11:09:44,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 11:09:44,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 11:09:44,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:44,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:09:44,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 11:09:44,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:09:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 11:09:45,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:09:45,146 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:09:45,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106295250] [2025-03-08 11:09:45,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106295250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:09:45,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:09:45,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:09:45,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631302277] [2025-03-08 11:09:45,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:09:45,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:09:45,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:09:45,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:09:45,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:09:45,150 INFO L87 Difference]: Start difference. First operand 185 states and 261 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 11:09:45,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:09:45,872 INFO L93 Difference]: Finished difference Result 535 states and 757 transitions. [2025-03-08 11:09:45,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:09:45,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2025-03-08 11:09:45,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:09:45,875 INFO L225 Difference]: With dead ends: 535 [2025-03-08 11:09:45,875 INFO L226 Difference]: Without dead ends: 353 [2025-03-08 11:09:45,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:09:45,878 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 154 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 11:09:45,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 359 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 11:09:45,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-08 11:09:45,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2025-03-08 11:09:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 210 states have (on average 1.1333333333333333) internal successors, (238), 212 states have internal predecessors, (238), 128 states have call successors, (128), 12 states have call predecessors, (128), 12 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-08 11:09:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 494 transitions. [2025-03-08 11:09:45,933 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 494 transitions. Word has length 209 [2025-03-08 11:09:45,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:09:45,933 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 494 transitions. [2025-03-08 11:09:45,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 11:09:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 494 transitions. [2025-03-08 11:09:45,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-08 11:09:45,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:09:45,936 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:09:45,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-03-08 11:09:46,136 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-08 11:09:46,137 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:09:46,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:09:46,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1320326412, now seen corresponding path program 1 times [2025-03-08 11:09:46,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:09:46,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398394570] [2025-03-08 11:09:46,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:46,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:09:46,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:09:46,141 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-08 11:09:46,141 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-08 11:09:46,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 11:09:46,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 11:09:46,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:46,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:09:46,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 11:09:46,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:09:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 816 proven. 72 refuted. 0 times theorem prover too weak. 1224 trivial. 0 not checked. [2025-03-08 11:09:47,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:09:47,588 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:09:47,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398394570] [2025-03-08 11:09:47,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398394570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:09:47,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1793300159] [2025-03-08 11:09:47,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:47,588 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 11:09:47,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 11:09:47,592 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 11:09:47,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-08 11:09:47,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 11:09:48,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 11:09:48,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:48,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:09:48,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 11:09:48,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:09:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 932 proven. 135 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2025-03-08 11:09:49,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:09:49,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1793300159] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:09:49,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:09:49,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2025-03-08 11:09:49,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999755836] [2025-03-08 11:09:49,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 11:09:49,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 11:09:49,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:09:49,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 11:09:49,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-03-08 11:09:49,854 INFO L87 Difference]: Start difference. First operand 351 states and 494 transitions. Second operand has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 16 states have internal predecessors, (101), 5 states have call successors, (66), 5 states have call predecessors, (66), 8 states have return successors, (66), 5 states have call predecessors, (66), 5 states have call successors, (66) [2025-03-08 11:09:53,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:09:53,253 INFO L93 Difference]: Finished difference Result 953 states and 1299 transitions. [2025-03-08 11:09:53,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 11:09:53,254 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 16 states have internal predecessors, (101), 5 states have call successors, (66), 5 states have call predecessors, (66), 8 states have return successors, (66), 5 states have call predecessors, (66), 5 states have call successors, (66) Word has length 209 [2025-03-08 11:09:53,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:09:53,258 INFO L225 Difference]: With dead ends: 953 [2025-03-08 11:09:53,258 INFO L226 Difference]: Without dead ends: 605 [2025-03-08 11:09:53,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=444, Invalid=1196, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 11:09:53,259 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 402 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:09:53,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 484 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 11:09:53,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-08 11:09:53,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 567. [2025-03-08 11:09:53,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 344 states have (on average 1.1133720930232558) internal successors, (383), 347 states have internal predecessors, (383), 192 states have call successors, (192), 30 states have call predecessors, (192), 30 states have return successors, (192), 189 states have call predecessors, (192), 192 states have call successors, (192) [2025-03-08 11:09:53,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 767 transitions. [2025-03-08 11:09:53,319 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 767 transitions. Word has length 209 [2025-03-08 11:09:53,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:09:53,319 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 767 transitions. [2025-03-08 11:09:53,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 16 states have internal predecessors, (101), 5 states have call successors, (66), 5 states have call predecessors, (66), 8 states have return successors, (66), 5 states have call predecessors, (66), 5 states have call successors, (66) [2025-03-08 11:09:53,320 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 767 transitions. [2025-03-08 11:09:53,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-08 11:09:53,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:09:53,321 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:09:53,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2025-03-08 11:09:53,529 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-08 11:09:53,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-08 11:09:53,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:09:53,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:09:53,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1026923405, now seen corresponding path program 1 times [2025-03-08 11:09:53,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:09:53,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176435859] [2025-03-08 11:09:53,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:53,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:09:53,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:09:53,725 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:09:53,726 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 (8)] Waiting until timeout for monitored process [2025-03-08 11:09:53,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 11:09:53,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 11:09:53,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:53,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:09:53,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:09:53,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:09:54,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 11:09:54,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:09:54,428 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:09:54,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176435859] [2025-03-08 11:09:54,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176435859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:09:54,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:09:54,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:09:54,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565780567] [2025-03-08 11:09:54,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:09:54,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:09:54,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:09:54,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:09:54,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:09:54,430 INFO L87 Difference]: Start difference. First operand 567 states and 767 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 11:09:55,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:09:55,116 INFO L93 Difference]: Finished difference Result 871 states and 1173 transitions. [2025-03-08 11:09:55,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:09:55,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2025-03-08 11:09:55,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:09:55,132 INFO L225 Difference]: With dead ends: 871 [2025-03-08 11:09:55,132 INFO L226 Difference]: Without dead ends: 307 [2025-03-08 11:09:55,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:09:55,134 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 63 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:09:55,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 396 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:09:55,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-08 11:09:55,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 277. [2025-03-08 11:09:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 164 states have (on average 1.0975609756097562) internal successors, (180), 165 states have internal predecessors, (180), 97 states have call successors, (97), 15 states have call predecessors, (97), 15 states have return successors, (97), 96 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-08 11:09:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 374 transitions. [2025-03-08 11:09:55,177 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 374 transitions. Word has length 209 [2025-03-08 11:09:55,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:09:55,178 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 374 transitions. [2025-03-08 11:09:55,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 11:09:55,178 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 374 transitions. [2025-03-08 11:09:55,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 11:09:55,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:09:55,179 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:09:55,190 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 (8)] Ended with exit code 0 [2025-03-08 11:09:55,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:09:55,380 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:09:55,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:09:55,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1882416604, now seen corresponding path program 1 times [2025-03-08 11:09:55,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:09:55,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63848365] [2025-03-08 11:09:55,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:55,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:09:55,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:09:55,384 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-08 11:09:55,385 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-08 11:09:55,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 11:09:55,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 11:09:55,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:55,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:09:55,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 11:09:55,601 INFO L279 TraceCheckSpWp]: Computing forward predicates...