./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.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 dba54f3464e88b90946abdccde2d7a055f54d4b2bf456cd41e3bbaa9f8dc4f14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:43:00,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:43:00,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:43:00,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:43:00,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:43:00,365 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:43:00,366 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:43:00,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:43:00,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:43:00,366 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:43:00,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:43:00,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:43:00,367 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:43:00,367 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:43:00,367 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:43:00,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:43:00,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:43:00,367 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:43:00,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:43:00,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:43:00,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:43:00,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:43:00,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:43:00,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:43:00,368 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:43:00,368 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:43:00,368 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:43:00,368 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:43:00,368 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:43:00,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:43:00,368 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:43:00,368 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:43:00,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:43:00,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:43:00,368 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:43:00,368 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:43:00,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:43:00,369 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:43:00,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:43:00,369 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:43:00,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:43:00,369 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:43:00,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:43:00,370 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 -> dba54f3464e88b90946abdccde2d7a055f54d4b2bf456cd41e3bbaa9f8dc4f14 [2025-03-03 21:43:00,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:43:00,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:43:00,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:43:00,588 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:43:00,588 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:43:00,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i [2025-03-03 21:43:01,753 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ac7ff6d/4310d6a9c9634047a462cd4af81e0f8e/FLAG268b1812f [2025-03-03 21:43:02,031 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:43:02,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i [2025-03-03 21:43:02,040 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ac7ff6d/4310d6a9c9634047a462cd4af81e0f8e/FLAG268b1812f [2025-03-03 21:43:02,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ac7ff6d/4310d6a9c9634047a462cd4af81e0f8e [2025-03-03 21:43:02,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:43:02,330 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:43:02,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:43:02,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:43:02,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:43:02,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:43:02" (1/1) ... [2025-03-03 21:43:02,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f39a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:02, skipping insertion in model container [2025-03-03 21:43:02,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:43:02" (1/1) ... [2025-03-03 21:43:02,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:43:02,460 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i[919,932] [2025-03-03 21:43:02,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:43:02,567 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:43:02,577 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i[919,932] [2025-03-03 21:43:02,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:43:02,637 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:43:02,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:02 WrapperNode [2025-03-03 21:43:02,639 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:43:02,640 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:43:02,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:43:02,640 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:43:02,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:02" (1/1) ... [2025-03-03 21:43:02,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:02" (1/1) ... [2025-03-03 21:43:02,692 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 217 [2025-03-03 21:43:02,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:43:02,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:43:02,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:43:02,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:43:02,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:02" (1/1) ... [2025-03-03 21:43:02,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:02" (1/1) ... [2025-03-03 21:43:02,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:02" (1/1) ... [2025-03-03 21:43:02,738 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-03 21:43:02,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:02" (1/1) ... [2025-03-03 21:43:02,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:02" (1/1) ... [2025-03-03 21:43:02,754 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:02" (1/1) ... [2025-03-03 21:43:02,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:02" (1/1) ... [2025-03-03 21:43:02,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:02" (1/1) ... [2025-03-03 21:43:02,766 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:02" (1/1) ... [2025-03-03 21:43:02,772 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:43:02,773 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:43:02,773 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:43:02,773 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:43:02,774 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:02" (1/1) ... [2025-03-03 21:43:02,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:43:02,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:43:02,825 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-03 21:43:02,833 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-03 21:43:02,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:43:02,848 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:43:02,848 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:43:02,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:43:02,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:43:02,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:43:02,929 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:43:02,931 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:43:03,254 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 21:43:03,254 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:43:03,272 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:43:03,272 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:43:03,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:03 BoogieIcfgContainer [2025-03-03 21:43:03,273 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:43:03,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:43:03,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:43:03,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:43:03,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:43:02" (1/3) ... [2025-03-03 21:43:03,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c96d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:43:03, skipping insertion in model container [2025-03-03 21:43:03,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:02" (2/3) ... [2025-03-03 21:43:03,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c96d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:43:03, skipping insertion in model container [2025-03-03 21:43:03,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:03" (3/3) ... [2025-03-03 21:43:03,280 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i [2025-03-03 21:43:03,291 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:43:03,294 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:43:03,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:43:03,348 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;@fffab92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:43:03,349 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:43:03,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 21:43:03,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 21:43:03,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:03,368 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:43:03,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:03,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:03,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1063098520, now seen corresponding path program 1 times [2025-03-03 21:43:03,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:43:03,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618758348] [2025-03-03 21:43:03,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:03,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:43:03,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 21:43:03,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 21:43:03,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:03,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:43:04,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:43:04,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618758348] [2025-03-03 21:43:04,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618758348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:04,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:04,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:43:04,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600869065] [2025-03-03 21:43:04,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:04,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:43:04,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:43:04,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:43:04,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:43:04,094 INFO L87 Difference]: Start difference. First operand has 89 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:43:04,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:04,163 INFO L93 Difference]: Finished difference Result 255 states and 460 transitions. [2025-03-03 21:43:04,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:43:04,166 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2025-03-03 21:43:04,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:04,174 INFO L225 Difference]: With dead ends: 255 [2025-03-03 21:43:04,175 INFO L226 Difference]: Without dead ends: 169 [2025-03-03 21:43:04,179 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-03 21:43:04,181 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 65 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:04,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 256 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:43:04,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-03 21:43:04,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2025-03-03 21:43:04,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 108 states have internal predecessors, (148), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-03 21:43:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 260 transitions. [2025-03-03 21:43:04,241 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 260 transitions. Word has length 183 [2025-03-03 21:43:04,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:04,242 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 260 transitions. [2025-03-03 21:43:04,242 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:43:04,243 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 260 transitions. [2025-03-03 21:43:04,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-03 21:43:04,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:04,247 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:43:04,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 21:43:04,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:04,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:04,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2049584356, now seen corresponding path program 1 times [2025-03-03 21:43:04,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:43:04,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2249431] [2025-03-03 21:43:04,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:04,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:43:04,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 21:43:04,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 21:43:04,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:04,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:04,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:43:04,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:43:04,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2249431] [2025-03-03 21:43:04,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2249431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:04,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:04,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:43:04,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613192387] [2025-03-03 21:43:04,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:04,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:43:04,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:43:04,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:43:04,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:43:04,681 INFO L87 Difference]: Start difference. First operand 167 states and 260 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:43:04,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:04,952 INFO L93 Difference]: Finished difference Result 347 states and 538 transitions. [2025-03-03 21:43:04,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:43:04,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 184 [2025-03-03 21:43:04,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:04,958 INFO L225 Difference]: With dead ends: 347 [2025-03-03 21:43:04,960 INFO L226 Difference]: Without dead ends: 183 [2025-03-03 21:43:04,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:43:04,963 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 125 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:04,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 451 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:43:04,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-03 21:43:04,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 167. [2025-03-03 21:43:04,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 108 states have (on average 1.3611111111111112) internal successors, (147), 108 states have internal predecessors, (147), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-03 21:43:04,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 259 transitions. [2025-03-03 21:43:04,991 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 259 transitions. Word has length 184 [2025-03-03 21:43:04,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:04,992 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 259 transitions. [2025-03-03 21:43:04,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:43:04,993 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 259 transitions. [2025-03-03 21:43:04,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-03 21:43:04,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:04,996 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:43:04,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:43:04,997 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:04,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:04,997 INFO L85 PathProgramCache]: Analyzing trace with hash 597968746, now seen corresponding path program 1 times [2025-03-03 21:43:04,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:43:04,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655100663] [2025-03-03 21:43:04,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:04,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:43:05,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-03 21:43:05,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-03 21:43:05,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:05,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:05,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:43:05,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:43:05,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655100663] [2025-03-03 21:43:05,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655100663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:05,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:05,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:43:05,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677939953] [2025-03-03 21:43:05,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:05,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:43:05,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:43:05,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:43:05,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:43:05,191 INFO L87 Difference]: Start difference. First operand 167 states and 259 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:43:05,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:05,222 INFO L93 Difference]: Finished difference Result 341 states and 533 transitions. [2025-03-03 21:43:05,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:43:05,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2025-03-03 21:43:05,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:05,226 INFO L225 Difference]: With dead ends: 341 [2025-03-03 21:43:05,226 INFO L226 Difference]: Without dead ends: 177 [2025-03-03 21:43:05,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:43:05,229 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 18 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:05,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 269 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:43:05,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-03 21:43:05,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 167. [2025-03-03 21:43:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 108 states have (on average 1.3425925925925926) internal successors, (145), 108 states have internal predecessors, (145), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-03 21:43:05,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 257 transitions. [2025-03-03 21:43:05,260 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 257 transitions. Word has length 185 [2025-03-03 21:43:05,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:05,261 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 257 transitions. [2025-03-03 21:43:05,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:43:05,262 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 257 transitions. [2025-03-03 21:43:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-03 21:43:05,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:05,266 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:43:05,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:43:05,266 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:05,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:05,266 INFO L85 PathProgramCache]: Analyzing trace with hash 727051465, now seen corresponding path program 1 times [2025-03-03 21:43:05,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:43:05,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773425253] [2025-03-03 21:43:05,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:05,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:43:05,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-03 21:43:05,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-03 21:43:05,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:05,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:05,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:43:05,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:43:05,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773425253] [2025-03-03 21:43:05,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773425253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:05,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:05,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:43:05,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162389892] [2025-03-03 21:43:05,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:05,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:43:05,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:43:05,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:43:05,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:43:05,715 INFO L87 Difference]: Start difference. First operand 167 states and 257 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:43:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:05,948 INFO L93 Difference]: Finished difference Result 400 states and 618 transitions. [2025-03-03 21:43:05,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:43:05,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2025-03-03 21:43:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:05,950 INFO L225 Difference]: With dead ends: 400 [2025-03-03 21:43:05,951 INFO L226 Difference]: Without dead ends: 236 [2025-03-03 21:43:05,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-03 21:43:05,952 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 52 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:05,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 269 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:43:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-03 21:43:05,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 227. [2025-03-03 21:43:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 139 states have (on average 1.3021582733812949) internal successors, (181), 139 states have internal predecessors, (181), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 21:43:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 349 transitions. [2025-03-03 21:43:05,984 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 349 transitions. Word has length 185 [2025-03-03 21:43:05,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:05,985 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 349 transitions. [2025-03-03 21:43:05,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:43:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 349 transitions. [2025-03-03 21:43:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-03 21:43:05,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:05,986 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:43:05,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:43:05,987 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:05,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:05,987 INFO L85 PathProgramCache]: Analyzing trace with hash -2042235556, now seen corresponding path program 1 times [2025-03-03 21:43:05,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:43:05,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894876599] [2025-03-03 21:43:05,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:05,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:43:06,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 21:43:06,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 21:43:06,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:06,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:43:06,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:43:06,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894876599] [2025-03-03 21:43:06,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894876599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:06,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:06,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:43:06,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073933805] [2025-03-03 21:43:06,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:06,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:43:06,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:43:06,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:43:06,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:43:06,098 INFO L87 Difference]: Start difference. First operand 227 states and 349 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:43:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:06,159 INFO L93 Difference]: Finished difference Result 519 states and 800 transitions. [2025-03-03 21:43:06,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:43:06,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2025-03-03 21:43:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:06,162 INFO L225 Difference]: With dead ends: 519 [2025-03-03 21:43:06,164 INFO L226 Difference]: Without dead ends: 355 [2025-03-03 21:43:06,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:43:06,165 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 90 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:06,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 301 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:43:06,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-03 21:43:06,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2025-03-03 21:43:06,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 223 states have (on average 1.3183856502242153) internal successors, (294), 225 states have internal predecessors, (294), 122 states have call successors, (122), 5 states have call predecessors, (122), 5 states have return successors, (122), 120 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-03 21:43:06,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 538 transitions. [2025-03-03 21:43:06,194 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 538 transitions. Word has length 186 [2025-03-03 21:43:06,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:06,195 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 538 transitions. [2025-03-03 21:43:06,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:43:06,195 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 538 transitions. [2025-03-03 21:43:06,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-03 21:43:06,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:06,196 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:43:06,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:43:06,197 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:06,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:06,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1742197563, now seen corresponding path program 1 times [2025-03-03 21:43:06,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:43:06,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566781993] [2025-03-03 21:43:06,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:06,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:43:06,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 21:43:06,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 21:43:06,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:06,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:43:06,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:43:06,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566781993] [2025-03-03 21:43:06,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566781993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:06,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:06,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:43:06,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339387972] [2025-03-03 21:43:06,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:06,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:43:06,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:43:06,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:43:06,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:43:06,409 INFO L87 Difference]: Start difference. First operand 351 states and 538 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:43:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:06,462 INFO L93 Difference]: Finished difference Result 651 states and 987 transitions. [2025-03-03 21:43:06,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:43:06,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2025-03-03 21:43:06,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:06,466 INFO L225 Difference]: With dead ends: 651 [2025-03-03 21:43:06,466 INFO L226 Difference]: Without dead ends: 367 [2025-03-03 21:43:06,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-03 21:43:06,468 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 32 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:06,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 234 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:43:06,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-03 21:43:06,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2025-03-03 21:43:06,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 235 states have (on average 1.2851063829787235) internal successors, (302), 237 states have internal predecessors, (302), 122 states have call successors, (122), 9 states have call predecessors, (122), 9 states have return successors, (122), 120 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-03 21:43:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 546 transitions. [2025-03-03 21:43:06,514 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 546 transitions. Word has length 186 [2025-03-03 21:43:06,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:06,516 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 546 transitions. [2025-03-03 21:43:06,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:43:06,516 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 546 transitions. [2025-03-03 21:43:06,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-03 21:43:06,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:06,518 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:43:06,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:43:06,518 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:06,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:06,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1806868968, now seen corresponding path program 1 times [2025-03-03 21:43:06,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:43:06,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193932181] [2025-03-03 21:43:06,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:06,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:43:06,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 21:43:06,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 21:43:06,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:06,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:06,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 42 proven. 39 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 21:43:06,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:43:06,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193932181] [2025-03-03 21:43:06,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193932181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:43:06,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596574973] [2025-03-03 21:43:06,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:06,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:43:06,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:43:06,940 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-03 21:43:06,942 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-03 21:43:07,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 21:43:07,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 21:43:07,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:07,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:07,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 21:43:07,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:43:07,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 783 proven. 39 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2025-03-03 21:43:07,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:43:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 42 proven. 39 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 21:43:08,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596574973] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:43:08,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:43:08,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 17 [2025-03-03 21:43:08,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198443646] [2025-03-03 21:43:08,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:43:08,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 21:43:08,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:43:08,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 21:43:08,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:43:08,067 INFO L87 Difference]: Start difference. First operand 367 states and 546 transitions. Second operand has 17 states, 17 states have (on average 7.647058823529412) internal successors, (130), 17 states have internal predecessors, (130), 5 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (70), 5 states have call predecessors, (70), 5 states have call successors, (70) [2025-03-03 21:43:08,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:08,436 INFO L93 Difference]: Finished difference Result 566 states and 815 transitions. [2025-03-03 21:43:08,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 21:43:08,436 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.647058823529412) internal successors, (130), 17 states have internal predecessors, (130), 5 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (70), 5 states have call predecessors, (70), 5 states have call successors, (70) Word has length 187 [2025-03-03 21:43:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:08,439 INFO L225 Difference]: With dead ends: 566 [2025-03-03 21:43:08,439 INFO L226 Difference]: Without dead ends: 415 [2025-03-03 21:43:08,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2025-03-03 21:43:08,440 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 192 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:08,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 324 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:43:08,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-03 21:43:08,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 230. [2025-03-03 21:43:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 146 states have (on average 1.2328767123287672) internal successors, (180), 147 states have internal predecessors, (180), 75 states have call successors, (75), 8 states have call predecessors, (75), 8 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-03 21:43:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 330 transitions. [2025-03-03 21:43:08,465 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 330 transitions. Word has length 187 [2025-03-03 21:43:08,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:08,466 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 330 transitions. [2025-03-03 21:43:08,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.647058823529412) internal successors, (130), 17 states have internal predecessors, (130), 5 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (70), 5 states have call predecessors, (70), 5 states have call successors, (70) [2025-03-03 21:43:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 330 transitions. [2025-03-03 21:43:08,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-03 21:43:08,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:08,467 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:43:08,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 21:43:08,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:43:08,672 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:08,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:08,673 INFO L85 PathProgramCache]: Analyzing trace with hash -211179318, now seen corresponding path program 1 times [2025-03-03 21:43:08,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:43:08,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878489421] [2025-03-03 21:43:08,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:08,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:43:08,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 21:43:08,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 21:43:08,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:08,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:43:08,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1039878762] [2025-03-03 21:43:08,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:08,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:43:08,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:43:08,780 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-03 21:43:08,782 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-03 21:43:08,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 21:43:08,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 21:43:08,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:08,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:43:08,917 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:43:08,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 21:43:08,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 21:43:08,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:08,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:43:09,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:43:09,068 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:43:09,069 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:43:09,078 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-03 21:43:09,271 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,SelfDestructingSolverStorable7 [2025-03-03 21:43:09,273 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:43:09,397 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:43:09,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:43:09 BoogieIcfgContainer [2025-03-03 21:43:09,401 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:43:09,402 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:43:09,402 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:43:09,402 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:43:09,403 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:03" (3/4) ... [2025-03-03 21:43:09,404 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:43:09,405 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:43:09,406 INFO L158 Benchmark]: Toolchain (without parser) took 7075.59ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 111.9MB in the beginning and 166.6MB in the end (delta: -54.7MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2025-03-03 21:43:09,406 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:43:09,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.52ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 95.4MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:43:09,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.91ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 90.2MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:43:09,406 INFO L158 Benchmark]: Boogie Preprocessor took 78.46ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 81.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:43:09,407 INFO L158 Benchmark]: IcfgBuilder took 500.29ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 51.7MB in the end (delta: 30.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 21:43:09,407 INFO L158 Benchmark]: TraceAbstraction took 6127.19ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 51.3MB in the beginning and 166.6MB in the end (delta: -115.4MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2025-03-03 21:43:09,407 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 218.1MB. Free memory was 166.6MB in the beginning and 166.6MB in the end (delta: 42.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:43:09,408 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.52ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 95.4MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.91ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 90.2MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.46ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 81.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 500.29ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 51.7MB in the end (delta: 30.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6127.19ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 51.3MB in the beginning and 166.6MB in the end (delta: -115.4MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 218.1MB. Free memory was 166.6MB in the beginning and 166.6MB in the end (delta: 42.1kB). 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 69, overapproximation of someBinaryFLOATComparisonOperation at line 192, overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 150, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 152, overapproximation of someBinaryDOUBLEComparisonOperation at line 156, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 162, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 154, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 192. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_7 = 50; [L26] unsigned char var_1_8 = 0; [L27] double var_1_9 = 127.625; [L28] double var_1_10 = 256.8; [L29] double var_1_11 = 0.30000000000000004; [L30] signed long int var_1_12 = -2; [L31] double var_1_13 = 2.475; [L32] double var_1_14 = 25.2; [L33] double var_1_15 = 500.125; [L34] double var_1_16 = 10.75; [L35] double var_1_17 = 255.4; [L36] unsigned char var_1_18 = 1; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 100; [L39] unsigned char var_1_21 = 128; [L40] unsigned char var_1_22 = 0; [L41] unsigned char var_1_23 = 1; [L42] unsigned char var_1_24 = 8; [L43] unsigned char var_1_25 = 10; [L44] float var_1_26 = 16.8; [L45] unsigned long int var_1_27 = 64; [L46] unsigned long int var_1_28 = 256; [L47] double var_1_32 = 255.5; [L48] signed long int var_1_36 = 4; [L49] double var_1_38 = 63.6; [L50] double var_1_40 = 0.0; [L51] signed short int var_1_42 = 128; [L52] unsigned char var_1_45 = 0; [L53] unsigned char var_1_48 = 0; [L54] float var_1_49 = 256.5; [L55] unsigned long int var_1_50 = 100; [L56] double var_1_51 = 63.5; [L57] unsigned char var_1_52 = 50; [L58] unsigned char last_1_var_1_18 = 1; [L59] unsigned char last_1_var_1_20 = 100; VAL [isInitial=0, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L196] isInitial = 1 [L197] FCALL initially() [L198] COND TRUE 1 [L199] CALL updateLastVariables() [L188] last_1_var_1_18 = var_1_18 [L189] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L199] RET updateLastVariables() [L200] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L144] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L145] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L145] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L146] var_1_8 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_9=1021/8] [L147] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_9=1021/8] [L148] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L148] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L149] var_1_10 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L150] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L151] var_1_11 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L152] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L153] var_1_13 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L154] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L155] var_1_14 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L156] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L157] var_1_15 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L158] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L159] var_1_16 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L160] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L161] var_1_17 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L162] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L163] var_1_19 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L164] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L165] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L165] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L166] var_1_21 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L167] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L168] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L168] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L169] var_1_22 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L170] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L171] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L171] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L172] var_1_23 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L173] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L174] CALL assume_abort_if_not(var_1_23 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L174] RET assume_abort_if_not(var_1_23 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L175] var_1_24 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L176] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L177] CALL assume_abort_if_not(var_1_24 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L177] RET assume_abort_if_not(var_1_24 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L178] var_1_25 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L179] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L180] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L180] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L181] var_1_40 = __VERIFIER_nondet_double() [L182] CALL assume_abort_if_not((var_1_40 >= 4611686.018427382800e+12F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L182] RET assume_abort_if_not((var_1_40 >= 4611686.018427382800e+12F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L183] var_1_48 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_48 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L184] RET assume_abort_if_not(var_1_48 >= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L185] CALL assume_abort_if_not(var_1_48 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L185] RET assume_abort_if_not(var_1_48 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L200] RET updateVariables() [L201] CALL step() [L63] COND TRUE (var_1_21 - var_1_22) <= var_1_25 [L64] var_1_28 = var_1_22 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=-255, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L66] var_1_32 = ((((((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16)))) > (var_1_10)) ? (((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16)))) : (var_1_10))) [L67] var_1_36 = (((((var_1_7) > (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) ? (var_1_7) : (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8)))))) + var_1_7) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=-255, var_1_32=3, var_1_36=100, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L68] EXPR -10 >> var_1_23 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=-255, var_1_32=3, var_1_36=100, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L68] COND TRUE 256 > (-10 >> var_1_23) [L69] var_1_38 = (var_1_16 - (((((var_1_40 - 128.375)) < (var_1_16)) ? ((var_1_40 - 128.375)) : (var_1_16)))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=-255, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L73] COND TRUE ! (var_1_17 >= (var_1_16 - var_1_40)) [L74] var_1_42 = (((((var_1_7 - 256)) < (var_1_20)) ? ((var_1_7 - 256)) : (var_1_20))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=-255, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L76] EXPR (var_1_8 * var_1_23) | var_1_7 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=-255, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L76] COND TRUE ((var_1_8 * var_1_23) | var_1_7) <= (var_1_20 + 8u) [L77] COND FALSE !(((((16u) < (var_1_20)) ? (16u) : (var_1_20))) < var_1_23) [L80] var_1_45 = ((var_1_23 != (var_1_20 % var_1_21)) || var_1_48) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=-255, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L83] COND FALSE !(0.83f > var_1_11) [L88] var_1_49 = var_1_11 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=-255, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L90] var_1_50 = var_1_7 [L91] var_1_51 = var_1_16 [L92] var_1_52 = var_1_8 [L93] signed long int stepLocal_1 = last_1_var_1_20; [L94] unsigned char stepLocal_0 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_0=1, stepLocal_1=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=-255, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L95] COND TRUE stepLocal_0 && last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_1=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=-255, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L96] COND FALSE !(((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > stepLocal_1) [L99] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=-255, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L104] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=-255, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L109] var_1_26 = var_1_16 [L110] var_1_27 = 10u [L111] unsigned long int stepLocal_2 = var_1_27; VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_2=10, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=-255, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=1021/8] [L112] COND TRUE stepLocal_2 != (var_1_8 + var_1_7) [L113] var_1_9 = ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=-255, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=4] [L117] COND TRUE var_1_8 >= var_1_7 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=-255, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=4] [L118] COND TRUE var_1_15 >= var_1_26 [L119] var_1_20 = (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=127, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=-255, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=4] [L126] COND TRUE \read(var_1_18) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=127, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=-255, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=4] [L127] COND FALSE !(! var_1_18) [L130] var_1_1 = (var_1_20 - var_1_20) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=127, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=-255, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=4] [L135] COND TRUE (var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17)) [L136] var_1_12 = (var_1_20 + var_1_20) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=254, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=127, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=-255, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=4] [L201] RET step() [L202] CALL, EXPR property() [L192-L193] return (((((((var_1_18 ? ((! var_1_18) ? (var_1_1 == ((signed short int) (var_1_7 + 5))) : (var_1_1 == ((signed short int) (var_1_20 - var_1_20)))) : (var_1_1 == ((signed short int) var_1_20))) && ((last_1_var_1_18 && last_1_var_1_18) ? ((((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > last_1_var_1_20) ? (var_1_7 == ((unsigned char) var_1_8)) : (var_1_7 == ((unsigned char) var_1_8))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((var_1_27 != (var_1_8 + var_1_7)) ? (var_1_9 == ((double) ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))))) : (var_1_9 == ((double) ((((var_1_11) < (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) ? (var_1_11) : (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))))))))) && (((var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17))) ? (var_1_12 == ((signed long int) (var_1_20 + var_1_20))) : 1)) && (var_1_3 ? (var_1_2 ? (var_1_18 == ((unsigned char) (! var_1_19))) : 1) : 1)) && ((var_1_8 >= var_1_7) ? ((var_1_15 >= var_1_26) ? (var_1_20 == ((unsigned char) (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))))) : (var_1_20 == ((unsigned char) var_1_24))) : (var_1_20 == ((unsigned char) var_1_22)))) && (var_1_26 == ((float) var_1_16))) && (var_1_27 == ((unsigned long int) 10u)) ; VAL [\result=0, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=254, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=127, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=-255, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=4] [L202] RET, EXPR property() [L202] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=254, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=127, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=-255, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=254, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=127, var_1_21=-384, var_1_22=-129, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=-255, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=50, var_1_7=50, var_1_8=50, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 574 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 574 mSDsluCounter, 2104 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1161 mSDsCounter, 246 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 596 IncrementalHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 246 mSolverCounterUnsat, 943 mSDtfsCounter, 596 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 383 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=6, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 226 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1857 NumberOfCodeBlocks, 1857 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1661 ConstructedInterpolants, 0 QuantifiedInterpolants, 4218 SizeOfPredicates, 4 NumberOfNonLiveVariables, 454 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 13491/13608 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-03 21:43:09,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.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 dba54f3464e88b90946abdccde2d7a055f54d4b2bf456cd41e3bbaa9f8dc4f14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:43:11,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:43:11,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:43:11,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:43:11,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:43:11,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:43:11,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:43:11,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:43:11,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:43:11,377 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:43:11,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:43:11,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:43:11,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:43:11,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:43:11,378 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:43:11,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:43:11,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:43:11,379 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:43:11,379 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:43:11,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:43:11,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:43:11,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:43:11,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:43:11,379 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:43:11,379 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:43:11,379 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:43:11,379 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:43:11,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:43:11,380 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:43:11,380 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:43:11,380 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:43:11,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:43:11,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:43:11,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:43:11,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:43:11,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:43:11,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:43:11,381 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:43:11,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:43:11,381 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:43:11,381 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:43:11,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:43:11,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:43:11,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:43:11,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:43:11,382 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 -> dba54f3464e88b90946abdccde2d7a055f54d4b2bf456cd41e3bbaa9f8dc4f14 [2025-03-03 21:43:11,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:43:11,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:43:11,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:43:11,594 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:43:11,594 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:43:11,596 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i [2025-03-03 21:43:12,791 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95da427d8/f5d7f45152cd4277a4855af0af8ab838/FLAGddb2fc7b9 [2025-03-03 21:43:13,008 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:43:13,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i [2025-03-03 21:43:13,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95da427d8/f5d7f45152cd4277a4855af0af8ab838/FLAGddb2fc7b9 [2025-03-03 21:43:13,034 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95da427d8/f5d7f45152cd4277a4855af0af8ab838 [2025-03-03 21:43:13,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:43:13,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:43:13,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:43:13,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:43:13,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:43:13,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:43:13" (1/1) ... [2025-03-03 21:43:13,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f72f36b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:13, skipping insertion in model container [2025-03-03 21:43:13,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:43:13" (1/1) ... [2025-03-03 21:43:13,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:43:13,165 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i[919,932] [2025-03-03 21:43:13,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:43:13,247 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:43:13,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i[919,932] [2025-03-03 21:43:13,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:43:13,320 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:43:13,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:13 WrapperNode [2025-03-03 21:43:13,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:43:13,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:43:13,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:43:13,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:43:13,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:13" (1/1) ... [2025-03-03 21:43:13,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:13" (1/1) ... [2025-03-03 21:43:13,367 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2025-03-03 21:43:13,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:43:13,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:43:13,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:43:13,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:43:13,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:13" (1/1) ... [2025-03-03 21:43:13,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:13" (1/1) ... [2025-03-03 21:43:13,383 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:13" (1/1) ... [2025-03-03 21:43:13,398 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-03 21:43:13,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:13" (1/1) ... [2025-03-03 21:43:13,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:13" (1/1) ... [2025-03-03 21:43:13,415 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:13" (1/1) ... [2025-03-03 21:43:13,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:13" (1/1) ... [2025-03-03 21:43:13,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:13" (1/1) ... [2025-03-03 21:43:13,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:13" (1/1) ... [2025-03-03 21:43:13,427 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:43:13,428 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:43:13,430 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:43:13,430 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:43:13,431 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:13" (1/1) ... [2025-03-03 21:43:13,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:43:13,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:43:13,456 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-03 21:43:13,458 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-03 21:43:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:43:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:43:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:43:13,476 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:43:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:43:13,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:43:13,556 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:43:13,557 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:43:24,137 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 21:43:24,138 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:43:24,149 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:43:24,150 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:43:24,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:24 BoogieIcfgContainer [2025-03-03 21:43:24,150 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:43:24,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:43:24,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:43:24,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:43:24,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:43:13" (1/3) ... [2025-03-03 21:43:24,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36582845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:43:24, skipping insertion in model container [2025-03-03 21:43:24,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:13" (2/3) ... [2025-03-03 21:43:24,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36582845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:43:24, skipping insertion in model container [2025-03-03 21:43:24,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:24" (3/3) ... [2025-03-03 21:43:24,158 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i [2025-03-03 21:43:24,168 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:43:24,170 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:43:24,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:43:24,219 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;@6b1a3a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:43:24,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:43:24,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 21:43:24,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 21:43:24,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:24,234 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:43:24,235 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:24,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:24,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1980502459, now seen corresponding path program 1 times [2025-03-03 21:43:24,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:43:24,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740919947] [2025-03-03 21:43:24,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:24,249 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-03 21:43:24,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:43:24,251 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-03 21:43:24,253 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-03 21:43:24,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 21:43:24,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 21:43:24,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:24,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:24,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:43:24,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:43:24,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 758 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2025-03-03 21:43:24,928 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:43:24,929 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:43:24,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740919947] [2025-03-03 21:43:24,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740919947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:24,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:24,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:43:24,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79494110] [2025-03-03 21:43:24,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:24,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:43:24,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:43:24,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:43:24,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:43:24,949 INFO L87 Difference]: Start difference. First operand has 84 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 21:43:24,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:24,975 INFO L93 Difference]: Finished difference Result 162 states and 283 transitions. [2025-03-03 21:43:24,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:43:24,978 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2025-03-03 21:43:24,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:24,983 INFO L225 Difference]: With dead ends: 162 [2025-03-03 21:43:24,983 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 21:43:24,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 180 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-03 21:43:24,987 INFO L435 NwaCegarLoop]: 124 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, 124 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-03 21:43:24,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:43:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 21:43:25,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-03 21:43:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 21:43:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2025-03-03 21:43:25,017 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 181 [2025-03-03 21:43:25,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:25,018 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2025-03-03 21:43:25,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 21:43:25,018 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2025-03-03 21:43:25,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 21:43:25,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:25,020 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:43:25,039 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-03 21:43:25,224 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-03 21:43:25,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:25,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:25,225 INFO L85 PathProgramCache]: Analyzing trace with hash -441744637, now seen corresponding path program 1 times [2025-03-03 21:43:25,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:43:25,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583524368] [2025-03-03 21:43:25,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:25,226 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-03 21:43:25,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:43:25,228 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-03 21:43:25,230 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-03 21:43:25,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 21:43:25,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 21:43:25,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:25,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:25,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 21:43:25,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:43:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:43:27,101 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:43:27,101 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:43:27,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583524368] [2025-03-03 21:43:27,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583524368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:27,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:27,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:43:27,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509428858] [2025-03-03 21:43:27,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:27,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:43:27,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:43:27,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:43:27,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:43:27,108 INFO L87 Difference]: Start difference. First operand 81 states and 124 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:43:31,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:43:36,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:43:36,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:36,346 INFO L93 Difference]: Finished difference Result 251 states and 386 transitions. [2025-03-03 21:43:36,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:43:36,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2025-03-03 21:43:36,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:36,382 INFO L225 Difference]: With dead ends: 251 [2025-03-03 21:43:36,382 INFO L226 Difference]: Without dead ends: 173 [2025-03-03 21:43:36,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:43:36,383 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 106 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 59 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:36,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 423 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 80 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2025-03-03 21:43:36,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-03 21:43:36,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 157. [2025-03-03 21:43:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-03 21:43:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 241 transitions. [2025-03-03 21:43:36,411 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 241 transitions. Word has length 181 [2025-03-03 21:43:36,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:36,411 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 241 transitions. [2025-03-03 21:43:36,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:43:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 241 transitions. [2025-03-03 21:43:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 21:43:36,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:36,413 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:43:36,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 21:43:36,617 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-03 21:43:36,617 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:36,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:36,618 INFO L85 PathProgramCache]: Analyzing trace with hash 718596165, now seen corresponding path program 1 times [2025-03-03 21:43:36,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:43:36,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184272502] [2025-03-03 21:43:36,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:36,619 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-03 21:43:36,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:43:36,621 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-03 21:43:36,622 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-03 21:43:36,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 21:43:37,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 21:43:37,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:37,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:37,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 21:43:37,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:43:38,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:43:38,313 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:43:38,313 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:43:38,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184272502] [2025-03-03 21:43:38,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184272502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:38,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:38,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:43:38,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296887838] [2025-03-03 21:43:38,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:38,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:43:38,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:43:38,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:43:38,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:43:38,314 INFO L87 Difference]: Start difference. First operand 157 states and 241 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:43:42,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:43:46,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:43:49,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:43:49,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:49,558 INFO L93 Difference]: Finished difference Result 402 states and 617 transitions. [2025-03-03 21:43:49,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:43:49,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2025-03-03 21:43:49,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:49,593 INFO L225 Difference]: With dead ends: 402 [2025-03-03 21:43:49,593 INFO L226 Difference]: Without dead ends: 248 [2025-03-03 21:43:49,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:43:49,599 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 82 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 57 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:49,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 397 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 93 Invalid, 1 Unknown, 0 Unchecked, 11.2s Time] [2025-03-03 21:43:49,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-03 21:43:49,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 220. [2025-03-03 21:43:49,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 132 states have internal predecessors, (169), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 21:43:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 337 transitions. [2025-03-03 21:43:49,641 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 337 transitions. Word has length 183 [2025-03-03 21:43:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:49,642 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 337 transitions. [2025-03-03 21:43:49,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:43:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 337 transitions. [2025-03-03 21:43:49,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 21:43:49,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:49,646 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:43:49,666 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-03 21:43:49,847 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-03 21:43:49,847 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:49,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:49,848 INFO L85 PathProgramCache]: Analyzing trace with hash 847678884, now seen corresponding path program 1 times [2025-03-03 21:43:49,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:43:49,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683024682] [2025-03-03 21:43:49,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:49,848 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-03 21:43:49,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:43:49,850 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-03 21:43:49,851 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-03 21:43:49,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 21:43:50,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 21:43:50,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:50,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:50,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 21:43:50,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:43:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:43:50,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:43:50,407 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:43:50,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683024682] [2025-03-03 21:43:50,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683024682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:50,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:50,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:43:50,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096699422] [2025-03-03 21:43:50,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:50,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:43:50,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:43:50,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:43:50,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:43:50,408 INFO L87 Difference]: Start difference. First operand 220 states and 337 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:43:54,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:43:54,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:54,789 INFO L93 Difference]: Finished difference Result 382 states and 581 transitions. [2025-03-03 21:43:54,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:43:54,789 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2025-03-03 21:43:54,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:54,791 INFO L225 Difference]: With dead ends: 382 [2025-03-03 21:43:54,791 INFO L226 Difference]: Without dead ends: 228 [2025-03-03 21:43:54,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 181 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-03 21:43:54,795 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 32 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:54,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 222 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-03 21:43:54,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-03 21:43:54,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2025-03-03 21:43:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 138 states have (on average 1.2536231884057971) internal successors, (173), 138 states have internal predecessors, (173), 84 states have call successors, (84), 5 states have call predecessors, (84), 5 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 21:43:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 341 transitions. [2025-03-03 21:43:54,828 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 341 transitions. Word has length 183 [2025-03-03 21:43:54,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:54,830 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 341 transitions. [2025-03-03 21:43:54,830 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:43:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 341 transitions. [2025-03-03 21:43:54,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-03 21:43:54,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:54,833 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:43:54,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-03 21:43:55,033 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-03 21:43:55,033 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:55,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:55,034 INFO L85 PathProgramCache]: Analyzing trace with hash -153406305, now seen corresponding path program 1 times [2025-03-03 21:43:55,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:43:55,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603625693] [2025-03-03 21:43:55,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:55,034 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-03 21:43:55,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:43:55,036 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-03 21:43:55,037 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-03 21:43:55,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 21:43:55,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 21:43:55,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:55,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:55,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 21:43:55,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:43:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 783 proven. 39 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2025-03-03 21:43:56,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:43:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 42 proven. 39 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 21:43:56,742 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:43:56,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603625693] [2025-03-03 21:43:56,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [603625693] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:43:56,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:43:56,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-03 21:43:56,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207934450] [2025-03-03 21:43:56,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:43:56,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:43:56,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:43:56,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:43:56,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:43:56,744 INFO L87 Difference]: Start difference. First operand 228 states and 341 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 21:44:01,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:44:04,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:44:04,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:04,057 INFO L93 Difference]: Finished difference Result 338 states and 489 transitions. [2025-03-03 21:44:04,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 21:44:04,088 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 184 [2025-03-03 21:44:04,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:04,090 INFO L225 Difference]: With dead ends: 338 [2025-03-03 21:44:04,090 INFO L226 Difference]: Without dead ends: 256 [2025-03-03 21:44:04,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 359 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:44:04,091 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 262 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 198 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:04,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 197 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 156 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2025-03-03 21:44:04,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-03 21:44:04,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 240. [2025-03-03 21:44:04,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 147 states have (on average 1.2244897959183674) internal successors, (180), 147 states have internal predecessors, (180), 84 states have call successors, (84), 8 states have call predecessors, (84), 8 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 21:44:04,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 348 transitions. [2025-03-03 21:44:04,112 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 348 transitions. Word has length 184 [2025-03-03 21:44:04,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:04,112 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 348 transitions. [2025-03-03 21:44:04,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 21:44:04,113 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 348 transitions. [2025-03-03 21:44:04,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-03 21:44:04,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:04,114 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:44:04,133 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 (6)] Forceful destruction successful, exit code 0 [2025-03-03 21:44:04,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:44:04,315 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:04,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:04,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2123512705, now seen corresponding path program 1 times [2025-03-03 21:44:04,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:44:04,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858325445] [2025-03-03 21:44:04,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:04,316 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-03 21:44:04,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:44:04,318 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:44:04,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-03 21:44:04,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 21:44:04,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 21:44:04,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:04,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:04,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 21:44:04,821 INFO L279 TraceCheckSpWp]: Computing forward predicates...