./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.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 dfd4199778f3470f18ddded1b4acee60166184917bf25c1bba255dc5dd2abf98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:16:20,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:16:20,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:16:20,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:16:20,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:16:20,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:16:20,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:16:20,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:16:20,280 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:16:20,280 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:16:20,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:16:20,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:16:20,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:16:20,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:16:20,281 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:16:20,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:16:20,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:16:20,281 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:16:20,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:16:20,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:16:20,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:16:20,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:16:20,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:16:20,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:16:20,283 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:16:20,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:16:20,284 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:16:20,284 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:16:20,284 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:16:20,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:16:20,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:16:20,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:16:20,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:16:20,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:16:20,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:16:20,284 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:16:20,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:16:20,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:16:20,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:16:20,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:16:20,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:16:20,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:16:20,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:16:20,284 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 -> dfd4199778f3470f18ddded1b4acee60166184917bf25c1bba255dc5dd2abf98 [2025-03-17 03:16:20,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:16:20,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:16:20,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:16:20,604 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:16:20,604 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:16:20,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i [2025-03-17 03:16:21,800 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0567dbb08/677cbf19eb75421e935f251ebc33ed60/FLAG0960ac652 [2025-03-17 03:16:22,100 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:16:22,100 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i [2025-03-17 03:16:22,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0567dbb08/677cbf19eb75421e935f251ebc33ed60/FLAG0960ac652 [2025-03-17 03:16:22,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0567dbb08/677cbf19eb75421e935f251ebc33ed60 [2025-03-17 03:16:22,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:16:22,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:16:22,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:16:22,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:16:22,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:16:22,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:16:22" (1/1) ... [2025-03-17 03:16:22,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf0269b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:22, skipping insertion in model container [2025-03-17 03:16:22,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:16:22" (1/1) ... [2025-03-17 03:16:22,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:16:22,529 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i[916,929] [2025-03-17 03:16:22,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:16:22,646 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:16:22,654 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i[916,929] [2025-03-17 03:16:22,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:16:22,717 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:16:22,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:22 WrapperNode [2025-03-17 03:16:22,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:16:22,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:16:22,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:16:22,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:16:22,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:22" (1/1) ... [2025-03-17 03:16:22,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:22" (1/1) ... [2025-03-17 03:16:22,772 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2025-03-17 03:16:22,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:16:22,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:16:22,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:16:22,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:16:22,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:22" (1/1) ... [2025-03-17 03:16:22,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:22" (1/1) ... [2025-03-17 03:16:22,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:22" (1/1) ... [2025-03-17 03:16:22,821 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:16:22,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:22" (1/1) ... [2025-03-17 03:16:22,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:22" (1/1) ... [2025-03-17 03:16:22,833 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:22" (1/1) ... [2025-03-17 03:16:22,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:22" (1/1) ... [2025-03-17 03:16:22,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:22" (1/1) ... [2025-03-17 03:16:22,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:22" (1/1) ... [2025-03-17 03:16:22,852 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:16:22,854 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:16:22,855 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:16:22,855 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:16:22,856 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:22" (1/1) ... [2025-03-17 03:16:22,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:16:22,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:16:22,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:16:22,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:16:22,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:16:22,907 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:16:22,907 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:16:22,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:16:22,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:16:22,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:16:22,978 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:16:22,979 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:16:23,326 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L196: havoc property_#t~bitwise20#1; [2025-03-17 03:16:23,363 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-17 03:16:23,363 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:16:23,380 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:16:23,381 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 03:16:23,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:16:23 BoogieIcfgContainer [2025-03-17 03:16:23,381 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:16:23,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:16:23,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:16:23,387 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:16:23,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:16:22" (1/3) ... [2025-03-17 03:16:23,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b07a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:16:23, skipping insertion in model container [2025-03-17 03:16:23,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:22" (2/3) ... [2025-03-17 03:16:23,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b07a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:16:23, skipping insertion in model container [2025-03-17 03:16:23,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:16:23" (3/3) ... [2025-03-17 03:16:23,390 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-39.i [2025-03-17 03:16:23,403 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:16:23,404 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-39.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:16:23,455 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:16:23,464 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;@846e6a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:16:23,464 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:16:23,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:16:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 03:16:23,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:16:23,484 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:16:23,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:16:23,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:16:23,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2013153963, now seen corresponding path program 1 times [2025-03-17 03:16:23,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:16:23,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496347568] [2025-03-17 03:16:23,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:23,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:16:23,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 03:16:23,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 03:16:23,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:23,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:23,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-17 03:16:23,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:16:23,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496347568] [2025-03-17 03:16:23,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496347568] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:16:23,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086672501] [2025-03-17 03:16:23,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:23,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:16:23,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:16:23,843 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:16:23,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:16:23,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 03:16:24,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 03:16:24,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:24,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:24,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:16:24,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:16:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-17 03:16:24,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:16:24,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086672501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:16:24,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:16:24,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:16:24,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365310156] [2025-03-17 03:16:24,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:16:24,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:16:24,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:16:24,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:16:24,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:16:24,085 INFO L87 Difference]: Start difference. First operand has 85 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 03:16:24,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:16:24,111 INFO L93 Difference]: Finished difference Result 167 states and 286 transitions. [2025-03-17 03:16:24,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:16:24,113 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 163 [2025-03-17 03:16:24,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:16:24,119 INFO L225 Difference]: With dead ends: 167 [2025-03-17 03:16:24,119 INFO L226 Difference]: Without dead ends: 83 [2025-03-17 03:16:24,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:16:24,124 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:16:24,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:16:24,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-17 03:16:24,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-17 03:16:24,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:16:24,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 128 transitions. [2025-03-17 03:16:24,164 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 128 transitions. Word has length 163 [2025-03-17 03:16:24,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:16:24,164 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 128 transitions. [2025-03-17 03:16:24,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 03:16:24,165 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 128 transitions. [2025-03-17 03:16:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 03:16:24,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:16:24,167 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:16:24,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 03:16:24,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:16:24,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:16:24,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:16:24,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1799241221, now seen corresponding path program 1 times [2025-03-17 03:16:24,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:16:24,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218249753] [2025-03-17 03:16:24,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:24,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:16:24,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 03:16:24,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 03:16:24,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:24,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:25,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-17 03:16:25,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:16:25,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218249753] [2025-03-17 03:16:25,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218249753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:16:25,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104856496] [2025-03-17 03:16:25,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:25,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:16:25,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:16:25,082 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:16:25,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 03:16:25,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 03:16:25,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 03:16:25,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:25,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:25,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 03:16:25,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:16:25,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-03-17 03:16:25,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:16:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-17 03:16:25,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104856496] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:16:25,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:16:25,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-17 03:16:25,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594261413] [2025-03-17 03:16:25,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:16:25,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:16:25,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:16:25,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:16:25,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:16:25,647 INFO L87 Difference]: Start difference. First operand 83 states and 128 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-17 03:16:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:16:25,834 INFO L93 Difference]: Finished difference Result 171 states and 260 transitions. [2025-03-17 03:16:25,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:16:25,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 163 [2025-03-17 03:16:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:16:25,836 INFO L225 Difference]: With dead ends: 171 [2025-03-17 03:16:25,837 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 03:16:25,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:16:25,838 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 66 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:16:25,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 240 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:16:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 03:16:25,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2025-03-17 03:16:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:16:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2025-03-17 03:16:25,855 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 163 [2025-03-17 03:16:25,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:16:25,856 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2025-03-17 03:16:25,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-17 03:16:25,857 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2025-03-17 03:16:25,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 03:16:25,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:16:25,860 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:16:25,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 03:16:26,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 03:16:26,061 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:16:26,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:16:26,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1627775204, now seen corresponding path program 1 times [2025-03-17 03:16:26,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:16:26,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324540244] [2025-03-17 03:16:26,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:26,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:16:26,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 03:16:26,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 03:16:26,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:26,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 03:16:26,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:16:26,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324540244] [2025-03-17 03:16:26,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324540244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:16:26,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:16:26,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:16:26,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4905667] [2025-03-17 03:16:26,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:16:26,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:16:26,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:16:26,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:16:26,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:16:26,401 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:16:26,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:16:26,524 INFO L93 Difference]: Finished difference Result 243 states and 354 transitions. [2025-03-17 03:16:26,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:16:26,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2025-03-17 03:16:26,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:16:26,527 INFO L225 Difference]: With dead ends: 243 [2025-03-17 03:16:26,528 INFO L226 Difference]: Without dead ends: 157 [2025-03-17 03:16:26,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:16:26,531 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 210 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:16:26,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 247 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:16:26,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-17 03:16:26,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 102. [2025-03-17 03:16:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.337837837837838) internal successors, (99), 74 states have internal predecessors, (99), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:16:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 147 transitions. [2025-03-17 03:16:26,570 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 147 transitions. Word has length 164 [2025-03-17 03:16:26,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:16:26,571 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 147 transitions. [2025-03-17 03:16:26,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:16:26,571 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 147 transitions. [2025-03-17 03:16:26,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 03:16:26,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:16:26,575 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:16:26,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:16:26,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:16:26,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:16:26,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1159640283, now seen corresponding path program 1 times [2025-03-17 03:16:26,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:16:26,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594790686] [2025-03-17 03:16:26,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:26,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:16:26,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 03:16:26,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 03:16:26,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:26,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:26,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-17 03:16:26,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:16:26,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594790686] [2025-03-17 03:16:26,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594790686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:16:26,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430684864] [2025-03-17 03:16:26,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:26,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:16:26,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:16:27,001 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-17 03:16:27,004 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-17 03:16:27,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 03:16:27,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 03:16:27,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:27,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:27,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 03:16:27,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:16:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2025-03-17 03:16:27,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:16:27,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-17 03:16:27,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430684864] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:16:27,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:16:27,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-17 03:16:27,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286371492] [2025-03-17 03:16:27,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:16:27,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:16:27,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:16:27,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:16:27,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:16:27,477 INFO L87 Difference]: Start difference. First operand 102 states and 147 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-17 03:16:27,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:16:27,760 INFO L93 Difference]: Finished difference Result 211 states and 300 transitions. [2025-03-17 03:16:27,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:16:27,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 164 [2025-03-17 03:16:27,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:16:27,762 INFO L225 Difference]: With dead ends: 211 [2025-03-17 03:16:27,762 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 03:16:27,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 325 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-17 03:16:27,764 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 181 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:16:27,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 231 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:16:27,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 03:16:27,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2025-03-17 03:16:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 66 states have internal predecessors, (85), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:16:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 133 transitions. [2025-03-17 03:16:27,783 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 133 transitions. Word has length 164 [2025-03-17 03:16:27,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:16:27,784 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 133 transitions. [2025-03-17 03:16:27,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-17 03:16:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2025-03-17 03:16:27,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 03:16:27,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:16:27,786 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:16:27,797 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-17 03:16:27,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:16:27,987 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:16:27,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:16:27,988 INFO L85 PathProgramCache]: Analyzing trace with hash -449434139, now seen corresponding path program 1 times [2025-03-17 03:16:27,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:16:27,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956162418] [2025-03-17 03:16:27,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:27,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:16:28,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 03:16:28,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 03:16:28,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:28,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:28,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 3 proven. 186 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2025-03-17 03:16:28,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:16:28,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956162418] [2025-03-17 03:16:28,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956162418] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:16:28,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960293900] [2025-03-17 03:16:28,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:28,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:16:28,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:16:28,969 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:16:28,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 03:16:29,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 03:16:29,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 03:16:29,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:29,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:29,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 03:16:29,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:16:30,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 100 proven. 240 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2025-03-17 03:16:30,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:16:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 126 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2025-03-17 03:16:30,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960293900] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:16:30,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:16:30,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 11] total 27 [2025-03-17 03:16:30,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842668181] [2025-03-17 03:16:30,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:16:30,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 03:16:30,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:16:30,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 03:16:30,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2025-03-17 03:16:30,986 INFO L87 Difference]: Start difference. First operand 95 states and 133 transitions. Second operand has 27 states, 27 states have (on average 4.814814814814815) internal successors, (130), 26 states have internal predecessors, (130), 7 states have call successors, (70), 4 states have call predecessors, (70), 7 states have return successors, (71), 7 states have call predecessors, (71), 7 states have call successors, (71) [2025-03-17 03:16:34,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:16:34,226 INFO L93 Difference]: Finished difference Result 410 states and 544 transitions. [2025-03-17 03:16:34,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-17 03:16:34,227 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.814814814814815) internal successors, (130), 26 states have internal predecessors, (130), 7 states have call successors, (70), 4 states have call predecessors, (70), 7 states have return successors, (71), 7 states have call predecessors, (71), 7 states have call successors, (71) Word has length 164 [2025-03-17 03:16:34,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:16:34,230 INFO L225 Difference]: With dead ends: 410 [2025-03-17 03:16:34,230 INFO L226 Difference]: Without dead ends: 316 [2025-03-17 03:16:34,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1205 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1032, Invalid=3798, Unknown=0, NotChecked=0, Total=4830 [2025-03-17 03:16:34,234 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 362 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:16:34,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 748 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 03:16:34,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-17 03:16:34,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 211. [2025-03-17 03:16:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 148 states have (on average 1.25) internal successors, (185), 148 states have internal predecessors, (185), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 03:16:34,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 281 transitions. [2025-03-17 03:16:34,264 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 281 transitions. Word has length 164 [2025-03-17 03:16:34,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:16:34,265 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 281 transitions. [2025-03-17 03:16:34,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.814814814814815) internal successors, (130), 26 states have internal predecessors, (130), 7 states have call successors, (70), 4 states have call predecessors, (70), 7 states have return successors, (71), 7 states have call predecessors, (71), 7 states have call successors, (71) [2025-03-17 03:16:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 281 transitions. [2025-03-17 03:16:34,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 03:16:34,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:16:34,267 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:16:34,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 03:16:34,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:16:34,468 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:16:34,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:16:34,469 INFO L85 PathProgramCache]: Analyzing trace with hash 512179878, now seen corresponding path program 1 times [2025-03-17 03:16:34,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:16:34,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681940004] [2025-03-17 03:16:34,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:34,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:16:34,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 03:16:34,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 03:16:34,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:34,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 03:16:34,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:16:34,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681940004] [2025-03-17 03:16:34,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681940004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:16:34,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:16:34,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:16:34,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408782932] [2025-03-17 03:16:34,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:16:34,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:16:34,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:16:34,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:16:34,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:16:34,644 INFO L87 Difference]: Start difference. First operand 211 states and 281 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:16:34,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:16:34,718 INFO L93 Difference]: Finished difference Result 423 states and 562 transitions. [2025-03-17 03:16:34,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:16:34,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2025-03-17 03:16:34,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:16:34,720 INFO L225 Difference]: With dead ends: 423 [2025-03-17 03:16:34,720 INFO L226 Difference]: Without dead ends: 213 [2025-03-17 03:16:34,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:16:34,722 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 65 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:16:34,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 444 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:16:34,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-17 03:16:34,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 107. [2025-03-17 03:16:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 75 states have (on average 1.24) internal successors, (93), 75 states have internal predecessors, (93), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:16:34,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 141 transitions. [2025-03-17 03:16:34,739 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 141 transitions. Word has length 164 [2025-03-17 03:16:34,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:16:34,739 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 141 transitions. [2025-03-17 03:16:34,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:16:34,739 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 141 transitions. [2025-03-17 03:16:34,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 03:16:34,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:16:34,741 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:16:34,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 03:16:34,741 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:16:34,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:16:34,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1111953219, now seen corresponding path program 1 times [2025-03-17 03:16:34,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:16:34,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850148306] [2025-03-17 03:16:34,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:34,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:16:34,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 03:16:34,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 03:16:34,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:34,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:16:34,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [495253601] [2025-03-17 03:16:34,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:34,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:16:34,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:16:34,901 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:16:34,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 03:16:34,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 03:16:35,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 03:16:35,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:35,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:35,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 03:16:35,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:16:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 03:16:35,582 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:16:35,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:16:35,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850148306] [2025-03-17 03:16:35,583 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 03:16:35,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495253601] [2025-03-17 03:16:35,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495253601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:16:35,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:16:35,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:16:35,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452031892] [2025-03-17 03:16:35,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:16:35,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:16:35,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:16:35,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:16:35,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:16:35,584 INFO L87 Difference]: Start difference. First operand 107 states and 141 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:16:35,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:16:35,816 INFO L93 Difference]: Finished difference Result 322 states and 425 transitions. [2025-03-17 03:16:35,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:16:35,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-03-17 03:16:35,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:16:35,823 INFO L225 Difference]: With dead ends: 322 [2025-03-17 03:16:35,823 INFO L226 Difference]: Without dead ends: 216 [2025-03-17 03:16:35,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:16:35,824 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 105 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:16:35,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 461 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:16:35,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-17 03:16:35,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 183. [2025-03-17 03:16:35,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 120 states have (on average 1.1833333333333333) internal successors, (142), 120 states have internal predecessors, (142), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 03:16:35,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 238 transitions. [2025-03-17 03:16:35,881 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 238 transitions. Word has length 165 [2025-03-17 03:16:35,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:16:35,881 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 238 transitions. [2025-03-17 03:16:35,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:16:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 238 transitions. [2025-03-17 03:16:35,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 03:16:35,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:16:35,885 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:16:35,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 03:16:36,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:16:36,086 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:16:36,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:16:36,086 INFO L85 PathProgramCache]: Analyzing trace with hash 132811262, now seen corresponding path program 1 times [2025-03-17 03:16:36,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:16:36,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676330228] [2025-03-17 03:16:36,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:36,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:16:36,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 03:16:36,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 03:16:36,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:36,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:16:36,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481920679] [2025-03-17 03:16:36,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:36,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:16:36,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:16:36,220 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:16:36,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 03:16:36,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 03:16:36,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 03:16:36,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:36,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:16:36,499 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:16:36,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 03:16:36,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 03:16:36,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:36,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:16:36,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:16:36,626 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:16:36,627 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:16:36,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 03:16:36,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:16:36,832 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:16:36,929 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:16:36,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:16:36 BoogieIcfgContainer [2025-03-17 03:16:36,935 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:16:36,935 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:16:36,935 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:16:36,936 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:16:36,940 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:16:23" (3/4) ... [2025-03-17 03:16:36,941 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:16:36,942 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:16:36,943 INFO L158 Benchmark]: Toolchain (without parser) took 14561.83ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 123.8MB in the beginning and 284.5MB in the end (delta: -160.7MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2025-03-17 03:16:36,943 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:16:36,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.06ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 107.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:16:36,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.24ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 101.7MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:16:36,943 INFO L158 Benchmark]: Boogie Preprocessor took 80.44ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 92.0MB in the end (delta: 9.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:16:36,943 INFO L158 Benchmark]: IcfgBuilder took 526.80ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 60.4MB in the end (delta: 31.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 03:16:36,945 INFO L158 Benchmark]: TraceAbstraction took 13552.34ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 59.8MB in the beginning and 284.6MB in the end (delta: -224.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:16:36,945 INFO L158 Benchmark]: Witness Printer took 6.62ms. Allocated memory is still 369.1MB. Free memory was 284.6MB in the beginning and 284.5MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:16:36,946 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.50ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.06ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 107.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.24ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 101.7MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 80.44ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 92.0MB in the end (delta: 9.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 526.80ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 60.4MB in the end (delta: 31.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13552.34ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 59.8MB in the beginning and 284.6MB in the end (delta: -224.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.62ms. Allocated memory is still 369.1MB. Free memory was 284.6MB in the beginning and 284.5MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryFLOATComparisonOperation at line 160, overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryFLOATComparisonOperation at line 154, overapproximation of someBinaryFLOATComparisonOperation at line 162, overapproximation of someBinaryFLOATComparisonOperation at line 164, overapproximation of someBinaryFLOATComparisonOperation at line 196, overapproximation of someBinaryFLOATComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 196, overapproximation of someBinaryArithmeticFLOAToperation at line 139, overapproximation of someBinaryArithmeticFLOAToperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 200; [L23] unsigned short int var_1_4 = 8; [L24] unsigned short int var_1_5 = 5; [L25] unsigned long int var_1_6 = 256; [L26] float var_1_7 = 9999999999999.2; [L27] float var_1_8 = 499.5; [L28] float var_1_9 = 64.4; [L29] float var_1_10 = 0.5; [L30] float var_1_11 = 5.8; [L31] float var_1_12 = 16.75; [L32] float var_1_13 = 99.5; [L33] signed short int var_1_15 = -10; [L34] unsigned char var_1_17 = 0; [L35] unsigned long int var_1_19 = 2743323310; [L36] unsigned long int var_1_20 = 4162860161; [L37] unsigned char var_1_21 = 0; [L38] double var_1_22 = 99.7; [L39] unsigned long int var_1_23 = 8; [L40] unsigned char var_1_24 = 1; [L41] unsigned char var_1_25 = 128; [L42] unsigned char var_1_26 = 128; [L43] unsigned char var_1_27 = 32; [L44] unsigned char var_1_28 = 200; [L45] float var_1_29 = 16.1; [L46] float var_1_30 = 7.9; [L47] unsigned char var_1_31 = 0; [L48] unsigned char var_1_32 = 1; [L49] unsigned char var_1_33 = 8; [L50] signed short int last_1_var_1_15 = -10; [L51] double last_1_var_1_22 = 99.7; [L52] unsigned long int last_1_var_1_23 = 8; [L53] unsigned char last_1_var_1_24 = 1; [L54] unsigned char last_1_var_1_27 = 32; [L55] unsigned char last_1_var_1_31 = 0; [L200] isInitial = 1 [L201] FCALL initially() [L202] COND TRUE 1 [L203] CALL updateLastVariables() [L188] last_1_var_1_15 = var_1_15 [L189] last_1_var_1_22 = var_1_22 [L190] last_1_var_1_23 = var_1_23 [L191] last_1_var_1_24 = var_1_24 [L192] last_1_var_1_27 = var_1_27 [L193] last_1_var_1_31 = var_1_31 [L203] RET updateLastVariables() [L204] CALL updateVariables() [L147] var_1_4 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_4 >= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L148] RET assume_abort_if_not(var_1_4 >= 8) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L149] CALL assume_abort_if_not(var_1_4 <= 17) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L149] RET assume_abort_if_not(var_1_4 <= 17) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L150] var_1_5 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L151] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L152] CALL assume_abort_if_not(var_1_5 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L152] RET assume_abort_if_not(var_1_5 <= 8) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L153] var_1_8 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_9=322/5] [L154] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_9=322/5] [L155] var_1_9 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L156] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L157] var_1_10 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L158] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L159] var_1_11 = __VERIFIER_nondet_float() [L160] 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_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L160] 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_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L161] var_1_12 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L162] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L163] var_1_13 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L164] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L165] var_1_19 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L166] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L167] CALL assume_abort_if_not(var_1_19 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L167] RET assume_abort_if_not(var_1_19 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L168] var_1_20 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_20 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L169] RET assume_abort_if_not(var_1_20 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L170] CALL assume_abort_if_not(var_1_20 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L170] RET assume_abort_if_not(var_1_20 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L171] var_1_21 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L172] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L173] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L173] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L174] var_1_25 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_25 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L175] RET assume_abort_if_not(var_1_25 >= 127) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L176] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L176] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L177] var_1_26 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_26 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L178] RET assume_abort_if_not(var_1_26 >= 127) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L179] CALL assume_abort_if_not(var_1_26 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L179] RET assume_abort_if_not(var_1_26 <= 254) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L180] var_1_28 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_28 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=-196674, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=-196674, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L181] RET assume_abort_if_not(var_1_28 >= 190) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=-196674, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L182] CALL assume_abort_if_not(var_1_28 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=-196674, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=-196674, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L182] RET assume_abort_if_not(var_1_28 <= 254) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=-196674, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L183] var_1_32 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=-196674, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=-196674, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L184] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=-196674, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L185] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=-196674, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=-196674, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L185] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=-196674, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L204] RET updateVariables() [L205] CALL step() [L59] COND TRUE (var_1_4 >= last_1_var_1_24) && (last_1_var_1_27 >= ((((var_1_5) < (last_1_var_1_24)) ? (var_1_5) : (last_1_var_1_24)))) [L60] var_1_6 = 200u VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=-196674, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L62] COND FALSE !(\read(last_1_var_1_31)) [L73] var_1_17 = var_1_21 VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=-196674, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L75] COND FALSE !(\read(var_1_17)) [L78] var_1_31 = (! 1) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=-196674, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L80] EXPR (last_1_var_1_23 * last_1_var_1_15) << (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=-196674, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L80] unsigned long int stepLocal_0 = (last_1_var_1_23 * last_1_var_1_15) << (var_1_4 - var_1_5); [L81] COND FALSE !(stepLocal_0 <= -128) [L84] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=-196674, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L86] unsigned char stepLocal_4 = var_1_17; VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_4=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=-196674, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L87] COND TRUE stepLocal_4 || (last_1_var_1_22 <= var_1_12) [L88] var_1_22 = ((((200.3) < (var_1_9)) ? (200.3) : (var_1_9))) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=-196674, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L92] signed long int stepLocal_6 = (((var_1_25) > (256)) ? (var_1_25) : (256)); VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_6=256, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=32, var_1_28=-196674, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L93] COND TRUE var_1_5 <= stepLocal_6 [L94] var_1_27 = ((var_1_28 - var_1_4) - var_1_5) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=174, var_1_28=-196674, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L98] var_1_29 = (var_1_12 + ((((9.999999999999995E14f) > (var_1_13)) ? (9.999999999999995E14f) : (var_1_13)))) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=174, var_1_28=-196674, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L99] COND TRUE var_1_19 != 25u VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=174, var_1_28=-196674, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L100] COND TRUE ! var_1_21 [L101] var_1_30 = var_1_8 VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=174, var_1_28=-196674, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L106] COND FALSE !(\read(var_1_31)) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=174, var_1_28=-196674, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L111] signed long int stepLocal_5 = var_1_33 % var_1_4; VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_5=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=174, var_1_28=-196674, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L112] COND FALSE !(stepLocal_5 > var_1_5) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=174, var_1_28=-196674, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L115] unsigned long int stepLocal_3 = var_1_6; [L116] signed long int stepLocal_2 = 128; VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_2=128, stepLocal_3=200, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=174, var_1_28=-196674, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L117] COND FALSE !(var_1_1 > stepLocal_3) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_2=128, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=174, var_1_28=-196674, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L120] COND TRUE var_1_33 != stepLocal_2 [L121] var_1_15 = (var_1_5 - 1) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=174, var_1_28=-196674, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L126] COND FALSE !(((((var_1_1) < ((var_1_4 - var_1_5))) ? (var_1_1) : ((var_1_4 - var_1_5)))) > var_1_27) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=174, var_1_28=-196674, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L137] signed long int stepLocal_1 = var_1_33 + var_1_5; VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_1=16, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=174, var_1_28=-196674, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L138] COND TRUE stepLocal_1 > var_1_24 [L139] var_1_7 = (((((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)) > (((((var_1_11) > ((var_1_12 + var_1_13))) ? (var_1_11) : ((var_1_12 + var_1_13)))))) ? ((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)) : (((((var_1_11) > ((var_1_12 + var_1_13))) ? (var_1_11) : ((var_1_12 + var_1_13))))))) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=174, var_1_28=-196674, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=3, var_1_8=2, var_1_9=0] [L205] RET step() [L206] CALL, EXPR property() [L196] EXPR (last_1_var_1_23 * last_1_var_1_15) << (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=174, var_1_28=-196674, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=3, var_1_8=2, var_1_9=0] [L196-L197] return (((((((((((((((last_1_var_1_23 * last_1_var_1_15) << (var_1_4 - var_1_5)) <= -128) ? (var_1_1 == ((unsigned char) (var_1_5 + var_1_4))) : (var_1_1 == ((unsigned char) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) && (((var_1_4 >= last_1_var_1_24) && (last_1_var_1_27 >= ((((var_1_5) < (last_1_var_1_24)) ? (var_1_5) : (last_1_var_1_24))))) ? (var_1_6 == ((unsigned long int) 200u)) : 1)) && (((var_1_33 + var_1_5) > var_1_24) ? (var_1_7 == ((float) (((((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)) > (((((var_1_11) > ((var_1_12 + var_1_13))) ? (var_1_11) : ((var_1_12 + var_1_13)))))) ? ((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)) : (((((var_1_11) > ((var_1_12 + var_1_13))) ? (var_1_11) : ((var_1_12 + var_1_13))))))))) : ((! var_1_31) ? (var_1_7 == ((float) ((((var_1_11) > (var_1_13)) ? (var_1_11) : (var_1_13))))) : 1))) && ((var_1_1 > var_1_6) ? (var_1_15 == ((signed short int) last_1_var_1_15)) : ((var_1_33 != 128) ? (var_1_15 == ((signed short int) (var_1_5 - 1))) : (var_1_15 == ((signed short int) var_1_27))))) && (last_1_var_1_31 ? (last_1_var_1_31 ? (((((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20))) - ((((10u) > (var_1_5)) ? (10u) : (var_1_5)))) != var_1_4) ? (var_1_17 == ((unsigned char) 0)) : (var_1_17 == ((unsigned char) 0))) : (var_1_17 == ((unsigned char) var_1_21))) : (var_1_17 == ((unsigned char) var_1_21)))) && ((var_1_17 || (last_1_var_1_22 <= var_1_12)) ? (var_1_22 == ((double) ((((200.3) < (var_1_9)) ? (200.3) : (var_1_9))))) : (var_1_22 == ((double) (var_1_8 - var_1_9))))) && ((((((var_1_1) < ((var_1_4 - var_1_5))) ? (var_1_1) : ((var_1_4 - var_1_5)))) > var_1_27) ? (((5 * var_1_27) <= var_1_24) ? ((var_1_5 >= var_1_1) ? (var_1_23 == ((unsigned long int) var_1_24)) : (var_1_23 == ((unsigned long int) var_1_5))) : (var_1_23 == ((unsigned long int) var_1_4))) : 1)) && (((var_1_33 % var_1_4) > var_1_5) ? (var_1_24 == ((unsigned char) (((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26))) - var_1_4))) : 1)) && ((var_1_5 <= ((((var_1_25) > (256)) ? (var_1_25) : (256)))) ? (var_1_27 == ((unsigned char) ((var_1_28 - var_1_4) - var_1_5))) : (var_1_27 == ((unsigned char) (((((var_1_25) > (var_1_28)) ? (var_1_25) : (var_1_28))) - var_1_5))))) && (var_1_29 == ((float) (var_1_12 + ((((9.999999999999995E14f) > (var_1_13)) ? (9.999999999999995E14f) : (var_1_13))))))) && ((var_1_19 != 25u) ? ((! var_1_21) ? (var_1_30 == ((float) var_1_8)) : 1) : (var_1_30 == ((float) (var_1_10 - var_1_9))))) && (var_1_17 ? (var_1_31 == ((unsigned char) (! var_1_32))) : (var_1_31 == ((unsigned char) (! 1))))) && (var_1_31 ? (((var_1_6 / var_1_25) <= var_1_4) ? (var_1_33 == ((unsigned char) var_1_5)) : 1) : 1) ; [L206] RET, EXPR property() [L206] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=174, var_1_28=-196674, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=3, var_1_8=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=127, var_1_27=174, var_1_28=-196674, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-196600, var_1_5=8, var_1_6=200, var_1_7=3, var_1_8=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 156 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 8, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1014 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 989 mSDsluCounter, 2497 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1597 mSDsCounter, 335 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1735 IncrementalHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 335 mSolverCounterUnsat, 900 mSDtfsCounter, 1735 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1397 GetRequests, 1298 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1211 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=5, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 305 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 2296 NumberOfCodeBlocks, 2296 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2278 ConstructedInterpolants, 0 QuantifiedInterpolants, 8336 SizeOfPredicates, 10 NumberOfNonLiveVariables, 2014 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 14669/15456 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 03:16:36,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.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 dfd4199778f3470f18ddded1b4acee60166184917bf25c1bba255dc5dd2abf98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:16:39,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:16:39,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:16:39,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:16:39,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:16:39,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:16:39,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:16:39,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:16:39,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:16:39,319 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:16:39,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:16:39,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:16:39,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:16:39,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:16:39,320 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:16:39,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:16:39,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:16:39,321 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:16:39,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:16:39,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:16:39,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:16:39,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:16:39,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:16:39,322 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:16:39,322 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:16:39,322 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:16:39,322 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:16:39,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:16:39,322 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:16:39,322 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:16:39,322 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:16:39,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:16:39,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:16:39,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:16:39,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:16:39,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:16:39,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:16:39,323 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:16:39,323 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:16:39,324 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:16:39,324 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:16:39,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:16:39,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:16:39,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:16:39,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:16:39,324 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 -> dfd4199778f3470f18ddded1b4acee60166184917bf25c1bba255dc5dd2abf98 [2025-03-17 03:16:39,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:16:39,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:16:39,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:16:39,618 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:16:39,619 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:16:39,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i [2025-03-17 03:16:40,985 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ca24cfb/8fc0f029a5db47fba13cc27dd9ad30e5/FLAG5054c62d5 [2025-03-17 03:16:41,239 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:16:41,240 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i [2025-03-17 03:16:41,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ca24cfb/8fc0f029a5db47fba13cc27dd9ad30e5/FLAG5054c62d5 [2025-03-17 03:16:41,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ca24cfb/8fc0f029a5db47fba13cc27dd9ad30e5 [2025-03-17 03:16:41,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:16:41,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:16:41,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:16:41,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:16:41,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:16:41,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:16:41" (1/1) ... [2025-03-17 03:16:41,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f3a22dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:41, skipping insertion in model container [2025-03-17 03:16:41,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:16:41" (1/1) ... [2025-03-17 03:16:41,295 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:16:41,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i[916,929] [2025-03-17 03:16:41,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:16:41,514 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:16:41,523 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i[916,929] [2025-03-17 03:16:41,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:16:41,593 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:16:41,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:41 WrapperNode [2025-03-17 03:16:41,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:16:41,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:16:41,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:16:41,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:16:41,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:41" (1/1) ... [2025-03-17 03:16:41,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:41" (1/1) ... [2025-03-17 03:16:41,649 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 193 [2025-03-17 03:16:41,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:16:41,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:16:41,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:16:41,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:16:41,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:41" (1/1) ... [2025-03-17 03:16:41,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:41" (1/1) ... [2025-03-17 03:16:41,662 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:41" (1/1) ... [2025-03-17 03:16:41,676 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:16:41,676 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:41" (1/1) ... [2025-03-17 03:16:41,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:41" (1/1) ... [2025-03-17 03:16:41,686 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:41" (1/1) ... [2025-03-17 03:16:41,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:41" (1/1) ... [2025-03-17 03:16:41,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:41" (1/1) ... [2025-03-17 03:16:41,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:41" (1/1) ... [2025-03-17 03:16:41,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:16:41,696 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:16:41,696 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:16:41,696 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:16:41,697 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:41" (1/1) ... [2025-03-17 03:16:41,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:16:41,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:16:41,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:16:41,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:16:41,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:16:41,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:16:41,776 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:16:41,776 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:16:41,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:16:41,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:16:41,868 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:16:41,871 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:16:46,598 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-17 03:16:46,598 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:16:46,609 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:16:46,609 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:16:46,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:16:46 BoogieIcfgContainer [2025-03-17 03:16:46,609 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:16:46,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:16:46,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:16:46,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:16:46,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:16:41" (1/3) ... [2025-03-17 03:16:46,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75298b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:16:46, skipping insertion in model container [2025-03-17 03:16:46,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:41" (2/3) ... [2025-03-17 03:16:46,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75298b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:16:46, skipping insertion in model container [2025-03-17 03:16:46,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:16:46" (3/3) ... [2025-03-17 03:16:46,623 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-39.i [2025-03-17 03:16:46,636 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:16:46,638 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-39.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:16:46,684 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:16:46,695 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;@4ef40e09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:16:46,695 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:16:46,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 53 states have internal predecessors, (76), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:16:46,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 03:16:46,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:16:46,708 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:16:46,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:16:46,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:16:46,725 INFO L85 PathProgramCache]: Analyzing trace with hash 585822803, now seen corresponding path program 1 times [2025-03-17 03:16:46,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:16:46,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680767928] [2025-03-17 03:16:46,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:46,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:16:46,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:16:46,738 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:16:46,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 03:16:46,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 03:16:47,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 03:16:47,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:47,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:47,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:16:47,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:16:47,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 526 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 03:16:47,297 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:16:47,298 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:16:47,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680767928] [2025-03-17 03:16:47,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680767928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:16:47,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:16:47,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:16:47,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182040839] [2025-03-17 03:16:47,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:16:47,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:16:47,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:16:47,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:16:47,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:16:47,340 INFO L87 Difference]: Start difference. First operand has 79 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 53 states have internal predecessors, (76), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 03:16:47,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:16:47,361 INFO L93 Difference]: Finished difference Result 155 states and 270 transitions. [2025-03-17 03:16:47,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:16:47,363 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 159 [2025-03-17 03:16:47,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:16:47,369 INFO L225 Difference]: With dead ends: 155 [2025-03-17 03:16:47,369 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 03:16:47,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:16:47,374 INFO L435 NwaCegarLoop]: 120 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, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:16:47,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:16:47,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 03:16:47,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-17 03:16:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:16:47,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 120 transitions. [2025-03-17 03:16:47,409 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 120 transitions. Word has length 159 [2025-03-17 03:16:47,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:16:47,409 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 120 transitions. [2025-03-17 03:16:47,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 03:16:47,410 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 120 transitions. [2025-03-17 03:16:47,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 03:16:47,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:16:47,414 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:16:47,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 03:16:47,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:16:47,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:16:47,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:16:47,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1531396601, now seen corresponding path program 1 times [2025-03-17 03:16:47,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:16:47,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366302967] [2025-03-17 03:16:47,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:47,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:16:47,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:16:47,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:16:47,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 03:16:47,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 03:16:48,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 03:16:48,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:48,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:48,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 03:16:48,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:16:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2025-03-17 03:16:48,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:16:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-17 03:16:49,670 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:16:49,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366302967] [2025-03-17 03:16:49,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366302967] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:16:49,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 03:16:49,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-17 03:16:49,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408252550] [2025-03-17 03:16:49,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 03:16:49,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:16:49,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:16:49,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:16:49,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:16:49,673 INFO L87 Difference]: Start difference. First operand 77 states and 120 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-17 03:16:55,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:16:55,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:16:55,228 INFO L93 Difference]: Finished difference Result 161 states and 246 transitions. [2025-03-17 03:16:55,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 03:16:55,272 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 159 [2025-03-17 03:16:55,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:16:55,275 INFO L225 Difference]: With dead ends: 161 [2025-03-17 03:16:55,276 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 03:16:55,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:16:55,277 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 251 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 134 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:16:55,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 211 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2025-03-17 03:16:55,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 03:16:55,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2025-03-17 03:16:55,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:16:55,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 121 transitions. [2025-03-17 03:16:55,293 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 121 transitions. Word has length 159 [2025-03-17 03:16:55,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:16:55,294 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 121 transitions. [2025-03-17 03:16:55,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-17 03:16:55,294 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 121 transitions. [2025-03-17 03:16:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 03:16:55,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:16:55,295 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:16:55,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 03:16:55,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:16:55,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:16:55,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:16:55,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1122572376, now seen corresponding path program 1 times [2025-03-17 03:16:55,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:16:55,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004853195] [2025-03-17 03:16:55,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:55,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:16:55,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:16:55,500 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:16:55,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 03:16:55,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 03:16:55,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 03:16:55,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:55,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:55,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 03:16:55,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:16:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-03-17 03:16:56,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:16:57,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-17 03:16:57,488 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:16:57,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004853195] [2025-03-17 03:16:57,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004853195] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:16:57,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 03:16:57,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-17 03:16:57,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646546596] [2025-03-17 03:16:57,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 03:16:57,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:16:57,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:16:57,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:16:57,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:16:57,490 INFO L87 Difference]: Start difference. First operand 81 states and 121 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2025-03-17 03:17:02,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:17:05,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:17:05,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:17:05,501 INFO L93 Difference]: Finished difference Result 169 states and 248 transitions. [2025-03-17 03:17:05,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:17:05,535 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 159 [2025-03-17 03:17:05,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:17:05,536 INFO L225 Difference]: With dead ends: 169 [2025-03-17 03:17:05,536 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 03:17:05,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:17:05,537 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 57 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2025-03-17 03:17:05,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 215 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 1 Unknown, 0 Unchecked, 7.9s Time] [2025-03-17 03:17:05,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 03:17:05,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2025-03-17 03:17:05,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:17:05,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2025-03-17 03:17:05,547 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 159 [2025-03-17 03:17:05,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:17:05,547 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2025-03-17 03:17:05,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2025-03-17 03:17:05,547 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2025-03-17 03:17:05,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 03:17:05,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:05,552 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:17:05,570 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 (4)] Forceful destruction successful, exit code 0 [2025-03-17 03:17:05,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:17:05,753 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:05,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:05,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1078356151, now seen corresponding path program 1 times [2025-03-17 03:17:05,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:17:05,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553451215] [2025-03-17 03:17:05,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:05,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:17:05,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:17:05,756 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:17:05,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 03:17:05,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 03:17:06,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 03:17:06,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:06,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:06,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 03:17:06,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:17:09,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 219 proven. 123 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2025-03-17 03:17:09,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:17:10,948 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:17:10,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553451215] [2025-03-17 03:17:10,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553451215] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:17:10,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [690002288] [2025-03-17 03:17:10,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:10,949 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 03:17:10,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 03:17:10,951 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 03:17:10,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-17 03:17:11,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 03:17:12,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 03:17:12,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:12,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:12,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 03:17:12,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:17:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 219 proven. 123 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2025-03-17 03:17:15,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:17:16,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [690002288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:17:16,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 03:17:16,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 13 [2025-03-17 03:17:16,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524097327] [2025-03-17 03:17:16,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 03:17:16,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:17:16,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:17:16,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:17:16,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2025-03-17 03:17:16,661 INFO L87 Difference]: Start difference. First operand 85 states and 122 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-17 03:17:24,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:17:28,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.90s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:17:32,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:17:32,722 INFO L93 Difference]: Finished difference Result 320 states and 443 transitions. [2025-03-17 03:17:32,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 03:17:32,723 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 160 [2025-03-17 03:17:32,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:17:32,724 INFO L225 Difference]: With dead ends: 320 [2025-03-17 03:17:32,724 INFO L226 Difference]: Without dead ends: 236 [2025-03-17 03:17:32,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=361, Invalid=1361, Unknown=0, NotChecked=0, Total=1722 [2025-03-17 03:17:32,726 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 267 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 102 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:17:32,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 576 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 773 Invalid, 1 Unknown, 0 Unchecked, 14.0s Time] [2025-03-17 03:17:32,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-17 03:17:32,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 187. [2025-03-17 03:17:32,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 128 states have (on average 1.265625) internal successors, (162), 128 states have internal predecessors, (162), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 03:17:32,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 258 transitions. [2025-03-17 03:17:32,763 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 258 transitions. Word has length 160 [2025-03-17 03:17:32,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:17:32,763 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 258 transitions. [2025-03-17 03:17:32,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-17 03:17:32,764 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 258 transitions. [2025-03-17 03:17:32,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 03:17:32,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:32,765 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:17:32,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 03:17:32,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-03-17 03:17:33,166 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 03:17:33,166 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:33,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:33,167 INFO L85 PathProgramCache]: Analyzing trace with hash 166408330, now seen corresponding path program 1 times [2025-03-17 03:17:33,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:17:33,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544825574] [2025-03-17 03:17:33,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:33,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:17:33,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:17:33,170 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:17:33,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 03:17:33,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 03:17:33,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 03:17:33,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:33,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:33,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 03:17:33,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:17:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 03:17:35,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:17:35,048 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:17:35,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544825574] [2025-03-17 03:17:35,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544825574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:17:35,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:17:35,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:17:35,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992636374] [2025-03-17 03:17:35,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:17:35,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:17:35,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:17:35,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:17:35,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:17:35,049 INFO L87 Difference]: Start difference. First operand 187 states and 258 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:17:39,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:17:43,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:17:43,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:17:43,275 INFO L93 Difference]: Finished difference Result 375 states and 516 transitions. [2025-03-17 03:17:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:17:43,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-03-17 03:17:43,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:17:43,337 INFO L225 Difference]: With dead ends: 375 [2025-03-17 03:17:43,337 INFO L226 Difference]: Without dead ends: 189 [2025-03-17 03:17:43,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:17:43,340 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 31 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:17:43,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 415 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2025-03-17 03:17:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-17 03:17:43,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2025-03-17 03:17:43,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 128 states have (on average 1.2578125) internal successors, (161), 128 states have internal predecessors, (161), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 03:17:43,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 257 transitions. [2025-03-17 03:17:43,382 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 257 transitions. Word has length 160 [2025-03-17 03:17:43,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:17:43,383 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 257 transitions. [2025-03-17 03:17:43,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:17:43,383 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 257 transitions. [2025-03-17 03:17:43,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 03:17:43,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:43,387 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:17:43,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 03:17:43,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:17:43,588 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:43,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:43,589 INFO L85 PathProgramCache]: Analyzing trace with hash -480297801, now seen corresponding path program 1 times [2025-03-17 03:17:43,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:17:43,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187855245] [2025-03-17 03:17:43,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:43,590 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:17:43,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:17:43,594 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:17:43,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 03:17:43,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 03:17:44,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 03:17:44,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:44,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:44,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 03:17:44,093 INFO L279 TraceCheckSpWp]: Computing forward predicates...