./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-85.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-pe-ci_file-85.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 35524620b4392269b8ac69f6a77765367543a28524c63c5b4259d7a5961c7edf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:34:35,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:34:35,808 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:34:35,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:34:35,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:34:35,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:34:35,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:34:35,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:34:35,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:34:35,838 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:34:35,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:34:35,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:34:35,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:34:35,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:34:35,839 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:34:35,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:34:35,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:34:35,839 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:34:35,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:34:35,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:34:35,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:34:35,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:34:35,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:34:35,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:34:35,839 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:34:35,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:34:35,839 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:34:35,839 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:34:35,840 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:34:35,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:34:35,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:34:35,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:34:35,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:34:35,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:34:35,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:34:35,840 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:34:35,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:34:35,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:34:35,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:34:35,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:34:35,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:34:35,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:34:35,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:34:35,840 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 -> 35524620b4392269b8ac69f6a77765367543a28524c63c5b4259d7a5961c7edf [2025-03-03 20:34:36,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:34:36,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:34:36,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:34:36,082 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:34:36,083 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:34:36,084 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-pe-ci_file-85.i [2025-03-03 20:34:37,249 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68ddbb1b6/01a0485bd7bc4d00ac673c920edd79ea/FLAGda6e71a2b [2025-03-03 20:34:37,492 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:34:37,492 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-85.i [2025-03-03 20:34:37,507 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68ddbb1b6/01a0485bd7bc4d00ac673c920edd79ea/FLAGda6e71a2b [2025-03-03 20:34:37,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68ddbb1b6/01a0485bd7bc4d00ac673c920edd79ea [2025-03-03 20:34:37,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:34:37,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:34:37,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:34:37,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:34:37,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:34:37,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:34:37" (1/1) ... [2025-03-03 20:34:37,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191d48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:37, skipping insertion in model container [2025-03-03 20:34:37,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:34:37" (1/1) ... [2025-03-03 20:34:37,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:34:37,933 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-pe-ci_file-85.i[919,932] [2025-03-03 20:34:38,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:34:38,014 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:34:38,023 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-pe-ci_file-85.i[919,932] [2025-03-03 20:34:38,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:34:38,074 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:34:38,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:38 WrapperNode [2025-03-03 20:34:38,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:34:38,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:34:38,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:34:38,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:34:38,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:38" (1/1) ... [2025-03-03 20:34:38,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:38" (1/1) ... [2025-03-03 20:34:38,115 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2025-03-03 20:34:38,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:34:38,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:34:38,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:34:38,116 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:34:38,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:38" (1/1) ... [2025-03-03 20:34:38,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:38" (1/1) ... [2025-03-03 20:34:38,124 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:38" (1/1) ... [2025-03-03 20:34:38,136 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 20:34:38,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:38" (1/1) ... [2025-03-03 20:34:38,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:38" (1/1) ... [2025-03-03 20:34:38,141 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:38" (1/1) ... [2025-03-03 20:34:38,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:38" (1/1) ... [2025-03-03 20:34:38,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:38" (1/1) ... [2025-03-03 20:34:38,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:38" (1/1) ... [2025-03-03 20:34:38,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:34:38,145 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:34:38,146 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:34:38,146 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:34:38,146 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:38" (1/1) ... [2025-03-03 20:34:38,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:34:38,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:34:38,172 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 20:34:38,176 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 20:34:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:34:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:34:38,191 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:34:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:34:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:34:38,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:34:38,252 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:34:38,254 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:34:38,629 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 20:34:38,630 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:34:38,642 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:34:38,643 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:34:38,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:34:38 BoogieIcfgContainer [2025-03-03 20:34:38,643 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:34:38,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:34:38,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:34:38,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:34:38,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:34:37" (1/3) ... [2025-03-03 20:34:38,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b9b1ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:34:38, skipping insertion in model container [2025-03-03 20:34:38,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:38" (2/3) ... [2025-03-03 20:34:38,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b9b1ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:34:38, skipping insertion in model container [2025-03-03 20:34:38,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:34:38" (3/3) ... [2025-03-03 20:34:38,652 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-85.i [2025-03-03 20:34:38,661 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:34:38,664 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-85.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:34:38,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:34:38,706 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;@e37ed15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:34:38,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:34:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 53 states have internal predecessors, (75), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 20:34:38,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 20:34:38,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:34:38,719 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:34:38,719 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:34:38,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:34:38,722 INFO L85 PathProgramCache]: Analyzing trace with hash 322670496, now seen corresponding path program 1 times [2025-03-03 20:34:38,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:34:38,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122814287] [2025-03-03 20:34:38,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:34:38,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:34:38,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 20:34:38,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 20:34:38,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:34:38,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:34:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 20:34:38,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:34:38,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122814287] [2025-03-03 20:34:38,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122814287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:34:38,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486257707] [2025-03-03 20:34:38,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:34:38,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:34:38,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:34:38,986 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 20:34:38,987 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 20:34:39,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 20:34:39,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 20:34:39,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:34:39,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:34:39,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:34:39,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:34:39,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 20:34:39,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:34:39,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486257707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:34:39,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:34:39,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:34:39,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574036168] [2025-03-03 20:34:39,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:34:39,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:34:39,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:34:39,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:34:39,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:34:39,181 INFO L87 Difference]: Start difference. First operand has 80 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 53 states have internal predecessors, (75), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 20:34:39,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:34:39,204 INFO L93 Difference]: Finished difference Result 154 states and 270 transitions. [2025-03-03 20:34:39,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:34:39,206 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2025-03-03 20:34:39,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:34:39,210 INFO L225 Difference]: With dead ends: 154 [2025-03-03 20:34:39,210 INFO L226 Difference]: Without dead ends: 77 [2025-03-03 20:34:39,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 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 20:34:39,215 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:34:39,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:34:39,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-03 20:34:39,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-03 20:34:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 20:34:39,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 120 transitions. [2025-03-03 20:34:39,242 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 120 transitions. Word has length 161 [2025-03-03 20:34:39,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:34:39,243 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 120 transitions. [2025-03-03 20:34:39,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 20:34:39,243 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 120 transitions. [2025-03-03 20:34:39,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 20:34:39,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:34:39,247 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:34:39,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:34:39,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:34:39,448 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:34:39,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:34:39,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1321183771, now seen corresponding path program 1 times [2025-03-03 20:34:39,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:34:39,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97999643] [2025-03-03 20:34:39,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:34:39,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:34:39,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 20:34:39,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 20:34:39,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:34:39,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:34:39,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 20:34:39,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:34:39,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97999643] [2025-03-03 20:34:39,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97999643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:34:39,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:34:39,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:34:39,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224202581] [2025-03-03 20:34:39,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:34:39,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:34:39,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:34:39,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:34:39,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:34:39,685 INFO L87 Difference]: Start difference. First operand 77 states and 120 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 20:34:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:34:39,750 INFO L93 Difference]: Finished difference Result 220 states and 346 transitions. [2025-03-03 20:34:39,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:34:39,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 161 [2025-03-03 20:34:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:34:39,755 INFO L225 Difference]: With dead ends: 220 [2025-03-03 20:34:39,755 INFO L226 Difference]: Without dead ends: 146 [2025-03-03 20:34:39,755 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 20:34:39,756 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 106 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:34:39,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 240 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:34:39,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-03 20:34:39,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 84. [2025-03-03 20:34:39,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 57 states have internal predecessors, (81), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 20:34:39,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 131 transitions. [2025-03-03 20:34:39,771 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 131 transitions. Word has length 161 [2025-03-03 20:34:39,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:34:39,773 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 131 transitions. [2025-03-03 20:34:39,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 20:34:39,773 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 131 transitions. [2025-03-03 20:34:39,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 20:34:39,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:34:39,776 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:34:39,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:34:39,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:34:39,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:34:39,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1192101052, now seen corresponding path program 1 times [2025-03-03 20:34:39,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:34:39,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692196905] [2025-03-03 20:34:39,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:34:39,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:34:39,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 20:34:39,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 20:34:39,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:34:39,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:34:40,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 20:34:40,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:34:40,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692196905] [2025-03-03 20:34:40,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692196905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:34:40,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:34:40,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:34:40,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834409730] [2025-03-03 20:34:40,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:34:40,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:34:40,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:34:40,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:34:40,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:34:40,227 INFO L87 Difference]: Start difference. First operand 84 states and 131 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 20:34:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:34:40,475 INFO L93 Difference]: Finished difference Result 277 states and 435 transitions. [2025-03-03 20:34:40,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:34:40,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 161 [2025-03-03 20:34:40,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:34:40,477 INFO L225 Difference]: With dead ends: 277 [2025-03-03 20:34:40,478 INFO L226 Difference]: Without dead ends: 196 [2025-03-03 20:34:40,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:34:40,479 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 234 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:34:40,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 455 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:34:40,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-03 20:34:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 161. [2025-03-03 20:34:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 20:34:40,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 252 transitions. [2025-03-03 20:34:40,505 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 252 transitions. Word has length 161 [2025-03-03 20:34:40,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:34:40,506 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 252 transitions. [2025-03-03 20:34:40,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 20:34:40,506 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 252 transitions. [2025-03-03 20:34:40,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 20:34:40,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:34:40,507 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:34:40,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:34:40,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:34:40,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:34:40,509 INFO L85 PathProgramCache]: Analyzing trace with hash -681566875, now seen corresponding path program 1 times [2025-03-03 20:34:40,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:34:40,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639090435] [2025-03-03 20:34:40,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:34:40,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:34:40,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 20:34:40,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 20:34:40,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:34:40,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:34:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 20:34:41,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:34:41,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639090435] [2025-03-03 20:34:41,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639090435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:34:41,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:34:41,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:34:41,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248177231] [2025-03-03 20:34:41,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:34:41,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:34:41,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:34:41,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:34:41,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:34:41,094 INFO L87 Difference]: Start difference. First operand 161 states and 252 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 20:34:41,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:34:41,427 INFO L93 Difference]: Finished difference Result 324 states and 508 transitions. [2025-03-03 20:34:41,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:34:41,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 161 [2025-03-03 20:34:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:34:41,430 INFO L225 Difference]: With dead ends: 324 [2025-03-03 20:34:41,431 INFO L226 Difference]: Without dead ends: 166 [2025-03-03 20:34:41,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:34:41,432 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 81 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:34:41,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 377 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:34:41,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-03 20:34:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 133. [2025-03-03 20:34:41,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 20:34:41,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 206 transitions. [2025-03-03 20:34:41,460 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 206 transitions. Word has length 161 [2025-03-03 20:34:41,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:34:41,461 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 206 transitions. [2025-03-03 20:34:41,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 20:34:41,461 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 206 transitions. [2025-03-03 20:34:41,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 20:34:41,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:34:41,463 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:34:41,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:34:41,463 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:34:41,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:34:41,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1749377074, now seen corresponding path program 1 times [2025-03-03 20:34:41,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:34:41,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671361849] [2025-03-03 20:34:41,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:34:41,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:34:41,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 20:34:41,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 20:34:41,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:34:41,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:34:41,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 3 proven. 69 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 20:34:41,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:34:41,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671361849] [2025-03-03 20:34:41,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671361849] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:34:41,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58340305] [2025-03-03 20:34:41,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:34:41,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:34:41,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:34:41,735 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 20:34:41,735 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 20:34:41,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 20:34:41,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 20:34:41,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:34:41,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:34:41,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 20:34:41,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:34:42,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 624 proven. 36 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-03-03 20:34:42,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:34:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 20:34:42,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58340305] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:34:42,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:34:42,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 14 [2025-03-03 20:34:42,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038005234] [2025-03-03 20:34:42,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:34:42,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 20:34:42,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:34:42,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 20:34:42,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:34:42,318 INFO L87 Difference]: Start difference. First operand 133 states and 206 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 3 states have call successors, (60), 2 states have call predecessors, (60), 4 states have return successors, (62), 3 states have call predecessors, (62), 3 states have call successors, (62) [2025-03-03 20:34:43,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:34:43,421 INFO L93 Difference]: Finished difference Result 460 states and 670 transitions. [2025-03-03 20:34:43,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-03 20:34:43,421 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 3 states have call successors, (60), 2 states have call predecessors, (60), 4 states have return successors, (62), 3 states have call predecessors, (62), 3 states have call successors, (62) Word has length 162 [2025-03-03 20:34:43,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:34:43,424 INFO L225 Difference]: With dead ends: 460 [2025-03-03 20:34:43,424 INFO L226 Difference]: Without dead ends: 379 [2025-03-03 20:34:43,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 318 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=692, Invalid=2500, Unknown=0, NotChecked=0, Total=3192 [2025-03-03 20:34:43,426 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 635 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:34:43,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 449 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:34:43,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-03 20:34:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 198. [2025-03-03 20:34:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 128 states have (on average 1.2890625) internal successors, (165), 129 states have internal predecessors, (165), 61 states have call successors, (61), 8 states have call predecessors, (61), 8 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-03 20:34:43,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 287 transitions. [2025-03-03 20:34:43,459 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 287 transitions. Word has length 162 [2025-03-03 20:34:43,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:34:43,459 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 287 transitions. [2025-03-03 20:34:43,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 3 states have call successors, (60), 2 states have call predecessors, (60), 4 states have return successors, (62), 3 states have call predecessors, (62), 3 states have call successors, (62) [2025-03-03 20:34:43,459 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 287 transitions. [2025-03-03 20:34:43,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 20:34:43,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:34:43,461 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:34:43,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 20:34:43,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:34:43,661 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:34:43,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:34:43,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1970164869, now seen corresponding path program 1 times [2025-03-03 20:34:43,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:34:43,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666095456] [2025-03-03 20:34:43,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:34:43,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:34:43,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 20:34:43,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 20:34:43,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:34:43,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:34:43,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083997320] [2025-03-03 20:34:43,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:34:43,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:34:43,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:34:43,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:34:43,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 20:34:43,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 20:34:43,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 20:34:43,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:34:43,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:34:43,869 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 20:34:43,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 20:34:43,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 20:34:43,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:34:43,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:34:43,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 20:34:43,986 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 20:34:43,987 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 20:34:43,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 20:34:44,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:34:44,191 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-03 20:34:44,281 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 20:34:44,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 08:34:44 BoogieIcfgContainer [2025-03-03 20:34:44,289 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 20:34:44,289 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 20:34:44,289 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 20:34:44,290 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 20:34:44,290 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:34:38" (3/4) ... [2025-03-03 20:34:44,291 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 20:34:44,292 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 20:34:44,293 INFO L158 Benchmark]: Toolchain (without parser) took 6476.57ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 104.5MB in the beginning and 130.9MB in the end (delta: -26.4MB). Peak memory consumption was 138.3MB. Max. memory is 16.1GB. [2025-03-03 20:34:44,293 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:34:44,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.90ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 88.9MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 20:34:44,294 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.10ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 85.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:34:44,295 INFO L158 Benchmark]: Boogie Preprocessor took 29.24ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 80.5MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 20:34:44,295 INFO L158 Benchmark]: IcfgBuilder took 497.39ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 55.1MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 20:34:44,295 INFO L158 Benchmark]: TraceAbstraction took 5642.31ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 55.1MB in the beginning and 131.0MB in the end (delta: -75.9MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. [2025-03-03 20:34:44,295 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 302.0MB. Free memory was 131.0MB in the beginning and 130.9MB in the end (delta: 87.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 20:34:44,296 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.90ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 88.9MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.10ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 85.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.24ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 80.5MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 497.39ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 55.1MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5642.31ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 55.1MB in the beginning and 131.0MB in the end (delta: -75.9MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 302.0MB. Free memory was 131.0MB in the beginning and 130.9MB in the end (delta: 87.7kB). 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 someBinaryFLOATComparisonOperation at line 141, overapproximation of someBinaryFLOATComparisonOperation at line 176, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 151, overapproximation of someBinaryDOUBLEComparisonOperation at line 176. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1000; [L23] unsigned char var_1_5 = 1; [L24] unsigned char var_1_6 = 0; [L25] float var_1_7 = 0.6; [L26] unsigned long int var_1_8 = 32; [L27] unsigned long int var_1_9 = 32; [L28] float var_1_11 = 5.5; [L29] unsigned long int var_1_12 = 128; [L30] unsigned char var_1_13 = 16; [L31] unsigned char var_1_14 = 0; [L32] unsigned long int var_1_15 = 8; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] double var_1_18 = 1.8; [L36] double var_1_19 = 4.5; [L37] double var_1_20 = 15.5; [L38] signed char var_1_21 = -5; [L39] signed char var_1_27 = 4; [L40] float var_1_28 = 8.95; [L41] signed short int var_1_30 = -256; [L42] unsigned char var_1_31 = 0; [L43] unsigned char var_1_35 = 1; [L44] unsigned char var_1_36 = 0; [L45] unsigned char var_1_37 = 0; [L46] unsigned char var_1_38 = 1; [L47] unsigned short int var_1_39 = 4; [L48] unsigned char var_1_41 = 10; [L49] unsigned long int last_1_var_1_1 = 1000; [L50] unsigned char last_1_var_1_5 = 1; [L51] unsigned long int last_1_var_1_12 = 128; [L52] unsigned char last_1_var_1_13 = 16; [L53] unsigned long int last_1_var_1_15 = 8; VAL [isInitial=0, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L180] isInitial = 1 [L181] FCALL initially() [L182] COND TRUE 1 [L183] CALL updateLastVariables() [L169] last_1_var_1_1 = var_1_1 [L170] last_1_var_1_5 = var_1_5 [L171] last_1_var_1_12 = var_1_12 [L172] last_1_var_1_13 = var_1_13 [L173] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L183] RET updateLastVariables() [L184] CALL updateVariables() [L129] var_1_6 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L130] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L131] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L131] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L132] var_1_8 = __VERIFIER_nondet_ulong() [L133] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L133] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L134] CALL assume_abort_if_not(var_1_8 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L134] RET assume_abort_if_not(var_1_8 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L135] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=32] [L135] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=32] [L136] var_1_9 = __VERIFIER_nondet_ulong() [L137] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L137] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L138] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L138] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L139] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L139] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L140] var_1_11 = __VERIFIER_nondet_float() [L141] 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_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L141] 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_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L142] var_1_14 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L143] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L144] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L145] var_1_17 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L146] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L147] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L148] var_1_19 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L149] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L150] var_1_20 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L151] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L152] var_1_27 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L153] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L154] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L154] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L155] var_1_35 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_35 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L156] RET assume_abort_if_not(var_1_35 >= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L157] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L158] var_1_36 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_36 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L159] RET assume_abort_if_not(var_1_36 >= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L160] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L161] var_1_39 = __VERIFIER_nondet_ushort() [L162] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L162] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_39 <= 15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L163] RET assume_abort_if_not(var_1_39 <= 15) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L164] var_1_41 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_41 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L165] RET assume_abort_if_not(var_1_41 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_41 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L166] RET assume_abort_if_not(var_1_41 <= 63) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L184] RET updateVariables() [L185] CALL step() [L57] signed long int stepLocal_1 = last_1_var_1_13; [L58] signed long int stepLocal_0 = last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_1=16, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L59] COND TRUE stepLocal_1 < ((- last_1_var_1_12) * 64) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L60] COND TRUE \read(last_1_var_1_5) [L61] var_1_1 = ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L70] unsigned long int stepLocal_2 = last_1_var_1_15 + last_1_var_1_1; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_2=1008, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L71] COND TRUE last_1_var_1_13 <= stepLocal_2 [L72] var_1_5 = ((last_1_var_1_15 == last_1_var_1_13) && var_1_6) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L76] unsigned char stepLocal_3 = var_1_5; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_3=0, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L77] COND FALSE !(stepLocal_3 || var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L80] var_1_13 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) [L81] var_1_16 = (var_1_6 && var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L82] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L85] COND FALSE !((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) [L90] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L92] COND TRUE var_1_7 <= (- (32.8f + var_1_7)) [L93] var_1_12 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L95] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L100] var_1_28 = var_1_19 [L101] var_1_30 = ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=3, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_30=254, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L102] COND FALSE !((((((var_1_20 - var_1_20)) < (var_1_11)) ? ((var_1_20 - var_1_20)) : (var_1_11))) > (var_1_19 * 31.3)) [L107] var_1_31 = (var_1_35 && ((var_1_13 > var_1_13) && (! var_1_36))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=3, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_30=254, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L109] COND TRUE (var_1_7 / 25.4f) >= ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) [L110] var_1_37 = (! (var_1_36 || var_1_35)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=3, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_30=254, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L112] COND TRUE ! var_1_6 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=3, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_30=254, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L113] EXPR (var_1_13 + var_1_14) << ((((5) < (var_1_39)) ? (5) : (var_1_39))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=3, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_30=254, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L113] COND FALSE !((var_1_9 + var_1_13) >= ((var_1_13 + var_1_14) << ((((5) < (var_1_39)) ? (5) : (var_1_39))))) [L120] COND FALSE !(! (var_1_14 >= var_1_41)) [L123] var_1_38 = 0 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=3, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_30=254, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L185] RET step() [L186] CALL, EXPR property() [L176-L177] return ((((((((last_1_var_1_13 < ((- last_1_var_1_12) * 64)) ? (last_1_var_1_5 ? (var_1_1 == ((unsigned long int) ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))))) : ((-10000000 < last_1_var_1_13) ? (var_1_1 == ((unsigned long int) (((((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) < 0 ) ? -((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) : ((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))))))) : (var_1_1 == ((unsigned long int) 50u)))) : 1) && ((last_1_var_1_13 <= (last_1_var_1_15 + last_1_var_1_1)) ? (var_1_5 == ((unsigned char) ((last_1_var_1_15 == last_1_var_1_13) && var_1_6))) : (var_1_5 == ((unsigned char) var_1_6)))) && (((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) ? ((1.25f < var_1_18) ? (var_1_7 == ((float) 1000000.1f)) : 1) : (var_1_7 == ((float) var_1_11)))) && ((var_1_7 <= (- (32.8f + var_1_7))) ? (var_1_12 == ((unsigned long int) last_1_var_1_12)) : 1)) && (var_1_13 == ((unsigned char) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) && (var_1_5 ? (var_1_15 == ((unsigned long int) ((((var_1_1) > ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) ? (var_1_1) : ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))))))) : 1)) && (var_1_16 == ((unsigned char) (var_1_6 && var_1_17)))) && ((var_1_5 || var_1_17) ? (var_1_18 == ((double) ((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) + var_1_20) - 63.6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=3, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_30=254, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L186] RET, EXPR property() [L186] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=3, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_30=254, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=3, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_30=254, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 6, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1060 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1056 mSDsluCounter, 1640 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1060 mSDsCounter, 690 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 667 IncrementalHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 690 mSolverCounterUnsat, 580 mSDtfsCounter, 667 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 558 GetRequests, 489 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 964 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=5, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 311 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1459 NumberOfCodeBlocks, 1459 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1283 ConstructedInterpolants, 0 QuantifiedInterpolants, 2914 SizeOfPredicates, 7 NumberOfNonLiveVariables, 784 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 9411/9600 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 20:34:44,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-85.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 35524620b4392269b8ac69f6a77765367543a28524c63c5b4259d7a5961c7edf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:34:46,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:34:46,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 20:34:46,245 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:34:46,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:34:46,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:34:46,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:34:46,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:34:46,266 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:34:46,266 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:34:46,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:34:46,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:34:46,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:34:46,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:34:46,267 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:34:46,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:34:46,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:34:46,268 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:34:46,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:34:46,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:34:46,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:34:46,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:34:46,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:34:46,268 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 20:34:46,268 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 20:34:46,268 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 20:34:46,268 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:34:46,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:34:46,268 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:34:46,268 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:34:46,268 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:34:46,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:34:46,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:34:46,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:34:46,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:34:46,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:34:46,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:34:46,269 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:34:46,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:34:46,269 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 20:34:46,269 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 20:34:46,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:34:46,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:34:46,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:34:46,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:34:46,269 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 -> 35524620b4392269b8ac69f6a77765367543a28524c63c5b4259d7a5961c7edf [2025-03-03 20:34:46,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:34:46,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:34:46,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:34:46,487 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:34:46,488 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:34:46,489 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-pe-ci_file-85.i [2025-03-03 20:34:47,744 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a71b7b1/ab3689faff984137aad2c1a1b3a864f3/FLAG914f8a579 [2025-03-03 20:34:47,950 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:34:47,951 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-85.i [2025-03-03 20:34:47,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a71b7b1/ab3689faff984137aad2c1a1b3a864f3/FLAG914f8a579 [2025-03-03 20:34:48,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a71b7b1/ab3689faff984137aad2c1a1b3a864f3 [2025-03-03 20:34:48,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:34:48,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:34:48,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:34:48,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:34:48,307 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:34:48,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:34:48" (1/1) ... [2025-03-03 20:34:48,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43dc1453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:48, skipping insertion in model container [2025-03-03 20:34:48,308 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:34:48" (1/1) ... [2025-03-03 20:34:48,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:34:48,414 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-pe-ci_file-85.i[919,932] [2025-03-03 20:34:48,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:34:48,469 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:34:48,477 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-pe-ci_file-85.i[919,932] [2025-03-03 20:34:48,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:34:48,516 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:34:48,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:48 WrapperNode [2025-03-03 20:34:48,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:34:48,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:34:48,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:34:48,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:34:48,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:48" (1/1) ... [2025-03-03 20:34:48,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:48" (1/1) ... [2025-03-03 20:34:48,547 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2025-03-03 20:34:48,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:34:48,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:34:48,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:34:48,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:34:48,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:48" (1/1) ... [2025-03-03 20:34:48,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:48" (1/1) ... [2025-03-03 20:34:48,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:48" (1/1) ... [2025-03-03 20:34:48,569 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 20:34:48,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:48" (1/1) ... [2025-03-03 20:34:48,569 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:48" (1/1) ... [2025-03-03 20:34:48,575 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:48" (1/1) ... [2025-03-03 20:34:48,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:48" (1/1) ... [2025-03-03 20:34:48,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:48" (1/1) ... [2025-03-03 20:34:48,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:48" (1/1) ... [2025-03-03 20:34:48,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:34:48,589 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:34:48,590 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:34:48,590 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:34:48,592 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:48" (1/1) ... [2025-03-03 20:34:48,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:34:48,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:34:48,615 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 20:34:48,619 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 20:34:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:34:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 20:34:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:34:48,639 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:34:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:34:48,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:34:48,706 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:34:48,708 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:34:54,986 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 20:34:54,987 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:34:54,993 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:34:54,993 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:34:54,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:34:54 BoogieIcfgContainer [2025-03-03 20:34:54,994 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:34:54,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:34:54,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:34:54,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:34:54,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:34:48" (1/3) ... [2025-03-03 20:34:55,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186d7277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:34:55, skipping insertion in model container [2025-03-03 20:34:55,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:48" (2/3) ... [2025-03-03 20:34:55,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186d7277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:34:55, skipping insertion in model container [2025-03-03 20:34:55,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:34:54" (3/3) ... [2025-03-03 20:34:55,001 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-85.i [2025-03-03 20:34:55,011 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:34:55,012 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-85.i that has 2 procedures, 78 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:34:55,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:34:55,057 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;@174452ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:34:55,057 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:34:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 50 states have (on average 1.44) internal successors, (72), 51 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 20:34:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 20:34:55,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:34:55,074 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:34:55,074 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:34:55,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:34:55,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1744120796, now seen corresponding path program 1 times [2025-03-03 20:34:55,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:34:55,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932417724] [2025-03-03 20:34:55,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:34:55,086 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 20:34:55,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:34:55,090 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 20:34:55,090 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 20:34:55,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 20:34:55,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 20:34:55,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:34:55,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:34:55,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:34:55,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:34:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2025-03-03 20:34:55,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:34:55,870 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:34:55,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932417724] [2025-03-03 20:34:55,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932417724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:34:55,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:34:55,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 20:34:55,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084231260] [2025-03-03 20:34:55,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:34:55,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:34:55,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:34:55,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:34:55,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:34:55,888 INFO L87 Difference]: Start difference. First operand has 78 states, 50 states have (on average 1.44) internal successors, (72), 51 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 20:34:55,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:34:55,909 INFO L93 Difference]: Finished difference Result 150 states and 264 transitions. [2025-03-03 20:34:55,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:34:55,911 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2025-03-03 20:34:55,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:34:55,919 INFO L225 Difference]: With dead ends: 150 [2025-03-03 20:34:55,919 INFO L226 Difference]: Without dead ends: 75 [2025-03-03 20:34:55,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 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 20:34:55,925 INFO L435 NwaCegarLoop]: 117 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, 117 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 20:34:55,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:34:55,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-03 20:34:55,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-03 20:34:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 20:34:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 117 transitions. [2025-03-03 20:34:55,953 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 117 transitions. Word has length 161 [2025-03-03 20:34:55,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:34:55,953 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 117 transitions. [2025-03-03 20:34:55,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 20:34:55,956 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 117 transitions. [2025-03-03 20:34:55,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 20:34:55,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:34:55,961 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:34:55,985 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 20:34:56,161 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 20:34:56,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:34:56,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:34:56,163 INFO L85 PathProgramCache]: Analyzing trace with hash 100266529, now seen corresponding path program 1 times [2025-03-03 20:34:56,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:34:56,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101366849] [2025-03-03 20:34:56,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:34:56,164 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 20:34:56,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:34:56,166 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 20:34:56,168 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 20:34:56,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 20:34:56,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 20:34:56,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:34:56,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:34:56,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 20:34:56,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:34:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 20:34:58,147 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:34:58,147 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:34:58,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101366849] [2025-03-03 20:34:58,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101366849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:34:58,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:34:58,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:34:58,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986266949] [2025-03-03 20:34:58,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:34:58,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:34:58,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:34:58,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:34:58,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:34:58,151 INFO L87 Difference]: Start difference. First operand 75 states and 117 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 20:35:00,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:35:00,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:35:00,871 INFO L93 Difference]: Finished difference Result 147 states and 231 transitions. [2025-03-03 20:35:00,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:35:00,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 161 [2025-03-03 20:35:00,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:35:00,894 INFO L225 Difference]: With dead ends: 147 [2025-03-03 20:35:00,894 INFO L226 Difference]: Without dead ends: 75 [2025-03-03 20:35:00,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 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 20:35:00,896 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 109 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:35:00,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 168 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 20:35:00,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-03 20:35:00,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-03 20:35:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 20:35:00,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 116 transitions. [2025-03-03 20:35:00,906 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 116 transitions. Word has length 161 [2025-03-03 20:35:00,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:35:00,907 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 116 transitions. [2025-03-03 20:35:00,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 20:35:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 116 transitions. [2025-03-03 20:35:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 20:35:00,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:35:00,908 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:35:00,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-03 20:35:01,109 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 20:35:01,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:35:01,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:35:01,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1390666866, now seen corresponding path program 1 times [2025-03-03 20:35:01,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:35:01,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408324196] [2025-03-03 20:35:01,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:35:01,110 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 20:35:01,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:35:01,113 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 20:35:01,114 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 20:35:01,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 20:35:01,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 20:35:01,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:35:01,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:35:01,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 20:35:01,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:35:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 624 proven. 36 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-03-03 20:35:04,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:35:05,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 20:35:05,194 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:35:05,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408324196] [2025-03-03 20:35:05,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408324196] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:35:05,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 20:35:05,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2025-03-03 20:35:05,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324591942] [2025-03-03 20:35:05,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 20:35:05,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 20:35:05,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:35:05,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 20:35:05,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:35:05,196 INFO L87 Difference]: Start difference. First operand 75 states and 116 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) [2025-03-03 20:35:11,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:35:13,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:35:14,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:35:17,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:35:18,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:35:18,062 INFO L93 Difference]: Finished difference Result 291 states and 447 transitions. [2025-03-03 20:35:18,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 20:35:18,063 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) Word has length 162 [2025-03-03 20:35:18,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:35:18,065 INFO L225 Difference]: With dead ends: 291 [2025-03-03 20:35:18,065 INFO L226 Difference]: Without dead ends: 219 [2025-03-03 20:35:18,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2025-03-03 20:35:18,066 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 355 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:35:18,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 514 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2025-03-03 20:35:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-03 20:35:18,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 185. [2025-03-03 20:35:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 119 states have (on average 1.3529411764705883) internal successors, (161), 120 states have internal predecessors, (161), 61 states have call successors, (61), 4 states have call predecessors, (61), 4 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-03 20:35:18,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 283 transitions. [2025-03-03 20:35:18,092 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 283 transitions. Word has length 162 [2025-03-03 20:35:18,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:35:18,092 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 283 transitions. [2025-03-03 20:35:18,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) [2025-03-03 20:35:18,093 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 283 transitions. [2025-03-03 20:35:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 20:35:18,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:35:18,096 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:35:18,118 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 20:35:18,296 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 20:35:18,297 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:35:18,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:35:18,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1014190960, now seen corresponding path program 1 times [2025-03-03 20:35:18,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:35:18,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138026646] [2025-03-03 20:35:18,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:35:18,299 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 20:35:18,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:35:18,301 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 20:35:18,302 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 20:35:18,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 20:35:18,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 20:35:18,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:35:18,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:35:18,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 20:35:18,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:35:19,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 118 proven. 69 refuted. 0 times theorem prover too weak. 1013 trivial. 0 not checked. [2025-03-03 20:35:19,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:35:19,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 3 proven. 69 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 20:35:19,926 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:35:19,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138026646] [2025-03-03 20:35:19,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138026646] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:35:19,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 20:35:19,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-03 20:35:19,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474962999] [2025-03-03 20:35:19,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 20:35:19,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:35:19,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:35:19,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:35:19,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:35:19,927 INFO L87 Difference]: Start difference. First operand 185 states and 283 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-03 20:35:22,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:35:22,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:35:22,090 INFO L93 Difference]: Finished difference Result 308 states and 455 transitions. [2025-03-03 20:35:22,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:35:22,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 162 [2025-03-03 20:35:22,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:35:22,116 INFO L225 Difference]: With dead ends: 308 [2025-03-03 20:35:22,116 INFO L226 Difference]: Without dead ends: 211 [2025-03-03 20:35:22,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 316 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:35:22,117 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 67 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:35:22,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 199 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 20:35:22,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-03 20:35:22,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 197. [2025-03-03 20:35:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 128 states have (on average 1.3046875) internal successors, (167), 129 states have internal predecessors, (167), 61 states have call successors, (61), 7 states have call predecessors, (61), 7 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-03 20:35:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 289 transitions. [2025-03-03 20:35:22,138 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 289 transitions. Word has length 162 [2025-03-03 20:35:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:35:22,139 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 289 transitions. [2025-03-03 20:35:22,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-03 20:35:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 289 transitions. [2025-03-03 20:35:22,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 20:35:22,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:35:22,140 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:35:22,162 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 20:35:22,340 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 20:35:22,341 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:35:22,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:35:22,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1060605204, now seen corresponding path program 1 times [2025-03-03 20:35:22,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:35:22,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540521855] [2025-03-03 20:35:22,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:35:22,342 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 20:35:22,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:35:22,345 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 20:35:22,346 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 20:35:22,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 20:35:23,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 20:35:23,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:35:23,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:35:23,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 20:35:23,071 INFO L279 TraceCheckSpWp]: Computing forward predicates...