./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-80.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 9e515de62df857d489d59950c6beb84861229f7c018feb1ce9e167b3b2d6609e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:02:58,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:02:58,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:02:58,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:02:58,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:02:58,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:02:58,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:02:58,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:02:58,459 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:02:58,459 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:02:58,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:02:58,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:02:58,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:02:58,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:02:58,461 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:02:58,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:02:58,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:02:58,462 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:02:58,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:02:58,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:02:58,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:02:58,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:02:58,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:02:58,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:02:58,462 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:02:58,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:02:58,462 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:02:58,463 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:02:58,463 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:02:58,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:02:58,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:02:58,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:02:58,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:02:58,464 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:02:58,464 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:02:58,464 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:02:58,464 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:02:58,464 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:02:58,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:02:58,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:02:58,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:02:58,465 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:02:58,465 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:02:58,465 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 -> 9e515de62df857d489d59950c6beb84861229f7c018feb1ce9e167b3b2d6609e [2025-03-03 23:02:58,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:02:58,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:02:58,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:02:58,729 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:02:58,729 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:02:58,730 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-80.i [2025-03-03 23:02:59,899 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94e2cf0bd/a034a90a91b84f948d60caabe8c783a1/FLAG92905c6c1 [2025-03-03 23:03:00,179 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:03:00,181 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-80.i [2025-03-03 23:03:00,188 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94e2cf0bd/a034a90a91b84f948d60caabe8c783a1/FLAG92905c6c1 [2025-03-03 23:03:00,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94e2cf0bd/a034a90a91b84f948d60caabe8c783a1 [2025-03-03 23:03:00,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:03:00,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:03:00,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:03:00,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:03:00,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:03:00,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:03:00" (1/1) ... [2025-03-03 23:03:00,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e0efbfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:00, skipping insertion in model container [2025-03-03 23:03:00,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:03:00" (1/1) ... [2025-03-03 23:03:00,503 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:03:00,607 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-80.i[916,929] [2025-03-03 23:03:00,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:03:00,689 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:03:00,698 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-80.i[916,929] [2025-03-03 23:03:00,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:03:00,758 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:03:00,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:00 WrapperNode [2025-03-03 23:03:00,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:03:00,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:03:00,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:03:00,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:03:00,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:00" (1/1) ... [2025-03-03 23:03:00,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:00" (1/1) ... [2025-03-03 23:03:00,814 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 242 [2025-03-03 23:03:00,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:03:00,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:03:00,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:03:00,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:03:00,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:00" (1/1) ... [2025-03-03 23:03:00,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:00" (1/1) ... [2025-03-03 23:03:00,833 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:00" (1/1) ... [2025-03-03 23:03:00,845 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:03:00,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:00" (1/1) ... [2025-03-03 23:03:00,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:00" (1/1) ... [2025-03-03 23:03:00,854 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:00" (1/1) ... [2025-03-03 23:03:00,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:00" (1/1) ... [2025-03-03 23:03:00,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:00" (1/1) ... [2025-03-03 23:03:00,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:00" (1/1) ... [2025-03-03 23:03:00,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:03:00,865 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:03:00,865 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:03:00,865 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:03:00,866 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:00" (1/1) ... [2025-03-03 23:03:00,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:03:00,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:03:00,891 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:03:00,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:03:00,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:03:00,909 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:03:00,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:03:00,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:03:00,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:03:00,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:03:00,967 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:03:00,969 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:03:01,338 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L188: havoc property_#t~ite21#1;havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~short22#1;havoc property_#t~bitwise23#1;havoc property_#t~short24#1; [2025-03-03 23:03:01,383 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-03 23:03:01,383 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:03:01,397 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:03:01,397 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-03 23:03:01,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:03:01 BoogieIcfgContainer [2025-03-03 23:03:01,398 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:03:01,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:03:01,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:03:01,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:03:01,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:03:00" (1/3) ... [2025-03-03 23:03:01,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565e667b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:03:01, skipping insertion in model container [2025-03-03 23:03:01,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:00" (2/3) ... [2025-03-03 23:03:01,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565e667b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:03:01, skipping insertion in model container [2025-03-03 23:03:01,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:03:01" (3/3) ... [2025-03-03 23:03:01,404 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-80.i [2025-03-03 23:03:01,414 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:03:01,416 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-80.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:03:01,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:03:01,468 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;@2899deb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:03:01,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:03:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 77 states have internal predecessors, (112), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 23:03:01,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 23:03:01,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:03:01,483 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:03:01,483 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:03:01,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:03:01,487 INFO L85 PathProgramCache]: Analyzing trace with hash -120666513, now seen corresponding path program 1 times [2025-03-03 23:03:01,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:03:01,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260005851] [2025-03-03 23:03:01,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:03:01,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:03:01,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 23:03:01,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 23:03:01,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:03:01,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:03:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 23:03:01,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:03:01,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260005851] [2025-03-03 23:03:01,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260005851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:03:01,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408893407] [2025-03-03 23:03:01,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:03:01,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:03:01,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:03:01,760 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:03:01,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:03:01,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 23:03:01,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 23:03:01,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:03:01,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:03:01,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:03:01,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:03:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 23:03:01,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:03:01,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408893407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:03:01,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:03:01,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:03:01,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509481062] [2025-03-03 23:03:01,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:03:01,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:03:01,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:03:01,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:03:01,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:03:01,995 INFO L87 Difference]: Start difference. First operand has 102 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 77 states have internal predecessors, (112), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:03:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:03:02,018 INFO L93 Difference]: Finished difference Result 198 states and 334 transitions. [2025-03-03 23:03:02,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:03:02,020 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 161 [2025-03-03 23:03:02,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:03:02,025 INFO L225 Difference]: With dead ends: 198 [2025-03-03 23:03:02,025 INFO L226 Difference]: Without dead ends: 99 [2025-03-03 23:03:02,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:03:02,029 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:03:02,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:03:02,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-03 23:03:02,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-03 23:03:02,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.445945945945946) internal successors, (107), 74 states have internal predecessors, (107), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 23:03:02,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 153 transitions. [2025-03-03 23:03:02,065 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 153 transitions. Word has length 161 [2025-03-03 23:03:02,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:03:02,065 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 153 transitions. [2025-03-03 23:03:02,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:03:02,066 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 153 transitions. [2025-03-03 23:03:02,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 23:03:02,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:03:02,069 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:03:02,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 23:03:02,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:03:02,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:03:02,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:03:02,271 INFO L85 PathProgramCache]: Analyzing trace with hash 965011882, now seen corresponding path program 1 times [2025-03-03 23:03:02,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:03:02,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183871179] [2025-03-03 23:03:02,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:03:02,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:03:02,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 23:03:02,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 23:03:02,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:03:02,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:03:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 23:03:02,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:03:02,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183871179] [2025-03-03 23:03:02,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183871179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:03:02,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:03:02,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:03:02,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162005810] [2025-03-03 23:03:02,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:03:02,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:03:02,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:03:02,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:03:02,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:03:02,481 INFO L87 Difference]: Start difference. First operand 99 states and 153 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 23:03:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:03:02,542 INFO L93 Difference]: Finished difference Result 245 states and 376 transitions. [2025-03-03 23:03:02,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:03:02,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 161 [2025-03-03 23:03:02,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:03:02,545 INFO L225 Difference]: With dead ends: 245 [2025-03-03 23:03:02,545 INFO L226 Difference]: Without dead ends: 149 [2025-03-03 23:03:02,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:03:02,546 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 77 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:03:02,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 264 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:03:02,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-03 23:03:02,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2025-03-03 23:03:02,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 119 states have internal predecessors, (171), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 23:03:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2025-03-03 23:03:02,564 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 161 [2025-03-03 23:03:02,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:03:02,566 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2025-03-03 23:03:02,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 23:03:02,566 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2025-03-03 23:03:02,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 23:03:02,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:03:02,568 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:03:02,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:03:02,568 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:03:02,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:03:02,568 INFO L85 PathProgramCache]: Analyzing trace with hash 681545404, now seen corresponding path program 1 times [2025-03-03 23:03:02,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:03:02,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977531411] [2025-03-03 23:03:02,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:03:02,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:03:02,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 23:03:02,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 23:03:02,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:03:02,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:03:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 23:03:03,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:03:03,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977531411] [2025-03-03 23:03:03,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977531411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:03:03,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:03:03,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 23:03:03,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400181995] [2025-03-03 23:03:03,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:03:03,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 23:03:03,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:03:03,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 23:03:03,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:03:03,421 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:03:04,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:03:04,110 INFO L93 Difference]: Finished difference Result 652 states and 992 transitions. [2025-03-03 23:03:04,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:03:04,111 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 162 [2025-03-03 23:03:04,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:03:04,116 INFO L225 Difference]: With dead ends: 652 [2025-03-03 23:03:04,116 INFO L226 Difference]: Without dead ends: 509 [2025-03-03 23:03:04,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-03 23:03:04,117 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 808 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:03:04,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 889 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 23:03:04,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-03 23:03:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 266. [2025-03-03 23:03:04,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 213 states have (on average 1.4507042253521127) internal successors, (309), 214 states have internal predecessors, (309), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 23:03:04,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 405 transitions. [2025-03-03 23:03:04,149 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 405 transitions. Word has length 162 [2025-03-03 23:03:04,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:03:04,149 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 405 transitions. [2025-03-03 23:03:04,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:03:04,150 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 405 transitions. [2025-03-03 23:03:04,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 23:03:04,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:03:04,151 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:03:04,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:03:04,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:03:04,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:03:04,152 INFO L85 PathProgramCache]: Analyzing trace with hash 272721179, now seen corresponding path program 1 times [2025-03-03 23:03:04,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:03:04,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686571503] [2025-03-03 23:03:04,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:03:04,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:03:04,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 23:03:04,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 23:03:04,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:03:04,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:03:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 23:03:04,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:03:04,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686571503] [2025-03-03 23:03:04,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686571503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:03:04,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:03:04,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 23:03:04,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080217175] [2025-03-03 23:03:04,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:03:04,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 23:03:04,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:03:04,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 23:03:04,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:03:04,780 INFO L87 Difference]: Start difference. First operand 266 states and 405 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:03:05,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:03:05,671 INFO L93 Difference]: Finished difference Result 635 states and 964 transitions. [2025-03-03 23:03:05,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 23:03:05,672 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 162 [2025-03-03 23:03:05,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:03:05,675 INFO L225 Difference]: With dead ends: 635 [2025-03-03 23:03:05,675 INFO L226 Difference]: Without dead ends: 492 [2025-03-03 23:03:05,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-03 23:03:05,677 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 592 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 23:03:05,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1063 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 23:03:05,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-03-03 23:03:05,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 290. [2025-03-03 23:03:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 236 states have (on average 1.4576271186440677) internal successors, (344), 237 states have internal predecessors, (344), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 23:03:05,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 440 transitions. [2025-03-03 23:03:05,699 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 440 transitions. Word has length 162 [2025-03-03 23:03:05,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:03:05,699 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 440 transitions. [2025-03-03 23:03:05,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:03:05,700 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 440 transitions. [2025-03-03 23:03:05,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 23:03:05,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:03:05,701 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:03:05,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:03:05,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:03:05,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:03:05,702 INFO L85 PathProgramCache]: Analyzing trace with hash 426808859, now seen corresponding path program 1 times [2025-03-03 23:03:05,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:03:05,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5823000] [2025-03-03 23:03:05,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:03:05,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:03:05,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 23:03:05,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 23:03:05,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:03:05,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:03:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 23:03:06,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:03:06,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5823000] [2025-03-03 23:03:06,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5823000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:03:06,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:03:06,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 23:03:06,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398472947] [2025-03-03 23:03:06,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:03:06,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:03:06,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:03:06,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:03:06,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:03:06,060 INFO L87 Difference]: Start difference. First operand 290 states and 440 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 23:03:06,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:03:06,488 INFO L93 Difference]: Finished difference Result 661 states and 1006 transitions. [2025-03-03 23:03:06,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:03:06,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162 [2025-03-03 23:03:06,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:03:06,492 INFO L225 Difference]: With dead ends: 661 [2025-03-03 23:03:06,493 INFO L226 Difference]: Without dead ends: 518 [2025-03-03 23:03:06,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:03:06,495 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 356 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:03:06,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 892 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 23:03:06,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-03 23:03:06,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 309. [2025-03-03 23:03:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 255 states have (on average 1.4705882352941178) internal successors, (375), 256 states have internal predecessors, (375), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 23:03:06,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 471 transitions. [2025-03-03 23:03:06,516 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 471 transitions. Word has length 162 [2025-03-03 23:03:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:03:06,517 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 471 transitions. [2025-03-03 23:03:06,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 23:03:06,517 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 471 transitions. [2025-03-03 23:03:06,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 23:03:06,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:03:06,518 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:03:06,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 23:03:06,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:03:06,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:03:06,521 INFO L85 PathProgramCache]: Analyzing trace with hash 17984634, now seen corresponding path program 1 times [2025-03-03 23:03:06,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:03:06,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883147455] [2025-03-03 23:03:06,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:03:06,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:03:06,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 23:03:06,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 23:03:06,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:03:06,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:03:06,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 23:03:06,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:03:06,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883147455] [2025-03-03 23:03:06,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883147455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:03:06,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:03:06,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 23:03:06,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179613357] [2025-03-03 23:03:06,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:03:06,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 23:03:06,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:03:06,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 23:03:06,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:03:06,805 INFO L87 Difference]: Start difference. First operand 309 states and 471 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 23:03:07,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:03:07,398 INFO L93 Difference]: Finished difference Result 698 states and 1062 transitions. [2025-03-03 23:03:07,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:03:07,398 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162 [2025-03-03 23:03:07,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:03:07,403 INFO L225 Difference]: With dead ends: 698 [2025-03-03 23:03:07,403 INFO L226 Difference]: Without dead ends: 555 [2025-03-03 23:03:07,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-03 23:03:07,404 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 396 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:03:07,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 928 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 23:03:07,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-03 23:03:07,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 290. [2025-03-03 23:03:07,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 236 states have (on average 1.4576271186440677) internal successors, (344), 237 states have internal predecessors, (344), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 23:03:07,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 440 transitions. [2025-03-03 23:03:07,432 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 440 transitions. Word has length 162 [2025-03-03 23:03:07,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:03:07,432 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 440 transitions. [2025-03-03 23:03:07,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 23:03:07,432 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 440 transitions. [2025-03-03 23:03:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 23:03:07,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:03:07,436 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:03:07,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 23:03:07,436 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:03:07,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:03:07,437 INFO L85 PathProgramCache]: Analyzing trace with hash 87324067, now seen corresponding path program 1 times [2025-03-03 23:03:07,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:03:07,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863303450] [2025-03-03 23:03:07,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:03:07,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:03:07,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 23:03:07,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 23:03:07,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:03:07,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:03:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 23:03:08,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:03:08,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863303450] [2025-03-03 23:03:08,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863303450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:03:08,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:03:08,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 23:03:08,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669010439] [2025-03-03 23:03:08,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:03:08,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 23:03:08,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:03:08,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 23:03:08,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:03:08,196 INFO L87 Difference]: Start difference. First operand 290 states and 440 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:03:09,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:03:09,497 INFO L93 Difference]: Finished difference Result 771 states and 1161 transitions. [2025-03-03 23:03:09,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 23:03:09,498 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 163 [2025-03-03 23:03:09,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:03:09,501 INFO L225 Difference]: With dead ends: 771 [2025-03-03 23:03:09,501 INFO L226 Difference]: Without dead ends: 603 [2025-03-03 23:03:09,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-03-03 23:03:09,503 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 822 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 23:03:09,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1228 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 23:03:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-03 23:03:09,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 335. [2025-03-03 23:03:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 281 states have (on average 1.4768683274021353) internal successors, (415), 282 states have internal predecessors, (415), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 23:03:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 511 transitions. [2025-03-03 23:03:09,529 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 511 transitions. Word has length 163 [2025-03-03 23:03:09,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:03:09,529 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 511 transitions. [2025-03-03 23:03:09,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:03:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 511 transitions. [2025-03-03 23:03:09,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 23:03:09,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:03:09,531 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:03:09,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 23:03:09,531 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:03:09,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:03:09,532 INFO L85 PathProgramCache]: Analyzing trace with hash 74182206, now seen corresponding path program 1 times [2025-03-03 23:03:09,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:03:09,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108211171] [2025-03-03 23:03:09,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:03:09,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:03:09,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 23:03:09,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 23:03:09,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:03:09,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:03:09,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 23:03:09,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:03:09,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108211171] [2025-03-03 23:03:09,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108211171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:03:09,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260057731] [2025-03-03 23:03:09,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:03:09,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:03:09,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:03:09,699 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:03:09,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 23:03:09,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 23:03:09,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 23:03:09,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:03:09,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:03:09,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 23:03:09,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:03:10,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2025-03-03 23:03:10,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:03:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 23:03:10,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260057731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:03:10,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:03:10,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 23:03:10,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428169734] [2025-03-03 23:03:10,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:03:10,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:03:10,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:03:10,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:03:10,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:03:10,216 INFO L87 Difference]: Start difference. First operand 335 states and 511 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 23:03:10,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:03:10,382 INFO L93 Difference]: Finished difference Result 618 states and 939 transitions. [2025-03-03 23:03:10,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:03:10,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 163 [2025-03-03 23:03:10,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:03:10,385 INFO L225 Difference]: With dead ends: 618 [2025-03-03 23:03:10,385 INFO L226 Difference]: Without dead ends: 344 [2025-03-03 23:03:10,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 323 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:03:10,386 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 224 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:03:10,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 319 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:03:10,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-03 23:03:10,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 340. [2025-03-03 23:03:10,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 284 states have (on average 1.4295774647887325) internal successors, (406), 285 states have internal predecessors, (406), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 23:03:10,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 502 transitions. [2025-03-03 23:03:10,402 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 502 transitions. Word has length 163 [2025-03-03 23:03:10,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:03:10,403 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 502 transitions. [2025-03-03 23:03:10,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 23:03:10,403 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 502 transitions. [2025-03-03 23:03:10,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 23:03:10,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:03:10,405 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:03:10,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 23:03:10,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-03 23:03:10,606 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:03:10,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:03:10,606 INFO L85 PathProgramCache]: Analyzing trace with hash 703670646, now seen corresponding path program 1 times [2025-03-03 23:03:10,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:03:10,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634268538] [2025-03-03 23:03:10,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:03:10,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:03:10,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 23:03:10,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 23:03:10,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:03:10,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:03:10,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 23:03:10,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:03:10,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634268538] [2025-03-03 23:03:10,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634268538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:03:10,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231646633] [2025-03-03 23:03:10,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:03:10,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:03:10,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:03:10,758 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:03:10,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 23:03:10,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 23:03:10,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 23:03:10,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:03:10,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:03:10,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 23:03:10,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:03:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 186 proven. 60 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-03-03 23:03:11,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:03:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 23:03:11,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231646633] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:03:11,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:03:11,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 23:03:11,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991319288] [2025-03-03 23:03:11,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:03:11,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:03:11,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:03:11,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:03:11,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:03:11,228 INFO L87 Difference]: Start difference. First operand 340 states and 502 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-03 23:03:11,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:03:11,364 INFO L93 Difference]: Finished difference Result 526 states and 766 transitions. [2025-03-03 23:03:11,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:03:11,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 163 [2025-03-03 23:03:11,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:03:11,366 INFO L225 Difference]: With dead ends: 526 [2025-03-03 23:03:11,366 INFO L226 Difference]: Without dead ends: 249 [2025-03-03 23:03:11,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 323 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:03:11,366 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 82 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:03:11,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 277 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:03:11,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-03 23:03:11,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 245. [2025-03-03 23:03:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 189 states have (on average 1.3280423280423281) internal successors, (251), 189 states have internal predecessors, (251), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 23:03:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 343 transitions. [2025-03-03 23:03:11,387 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 343 transitions. Word has length 163 [2025-03-03 23:03:11,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:03:11,388 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 343 transitions. [2025-03-03 23:03:11,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-03 23:03:11,388 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 343 transitions. [2025-03-03 23:03:11,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 23:03:11,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:03:11,390 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:03:11,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 23:03:11,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:03:11,594 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:03:11,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:03:11,594 INFO L85 PathProgramCache]: Analyzing trace with hash -947105570, now seen corresponding path program 1 times [2025-03-03 23:03:11,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:03:11,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487445670] [2025-03-03 23:03:11,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:03:11,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:03:11,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 23:03:11,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 23:03:11,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:03:11,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:03:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 23:03:11,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:03:11,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487445670] [2025-03-03 23:03:11,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487445670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:03:11,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:03:11,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:03:11,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928647122] [2025-03-03 23:03:11,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:03:11,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:03:11,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:03:11,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:03:11,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:03:11,787 INFO L87 Difference]: Start difference. First operand 245 states and 343 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 23:03:11,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:03:11,817 INFO L93 Difference]: Finished difference Result 395 states and 561 transitions. [2025-03-03 23:03:11,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:03:11,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 165 [2025-03-03 23:03:11,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:03:11,820 INFO L225 Difference]: With dead ends: 395 [2025-03-03 23:03:11,820 INFO L226 Difference]: Without dead ends: 249 [2025-03-03 23:03:11,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-03 23:03:11,820 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 2 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:03:11,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 400 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:03:11,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-03 23:03:11,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 245. [2025-03-03 23:03:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 189 states have (on average 1.306878306878307) internal successors, (247), 189 states have internal predecessors, (247), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 23:03:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 339 transitions. [2025-03-03 23:03:11,841 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 339 transitions. Word has length 165 [2025-03-03 23:03:11,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:03:11,841 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 339 transitions. [2025-03-03 23:03:11,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 23:03:11,842 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 339 transitions. [2025-03-03 23:03:11,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 23:03:11,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:03:11,843 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:03:11,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 23:03:11,844 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:03:11,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:03:11,844 INFO L85 PathProgramCache]: Analyzing trace with hash 49966783, now seen corresponding path program 1 times [2025-03-03 23:03:11,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:03:11,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761275383] [2025-03-03 23:03:11,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:03:11,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:03:11,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 23:03:11,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 23:03:11,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:03:11,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:03:11,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [135584848] [2025-03-03 23:03:11,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:03:11,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:03:11,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:03:11,940 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-03 23:03:11,943 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-03 23:03:12,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 23:03:12,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 23:03:12,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:03:12,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:03:12,062 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:03:12,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 23:03:12,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 23:03:12,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:03:12,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:03:12,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:03:12,213 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:03:12,214 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:03:12,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 23:03:12,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:03:12,420 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:03:12,524 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:03:12,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:03:12 BoogieIcfgContainer [2025-03-03 23:03:12,529 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:03:12,530 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:03:12,530 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:03:12,530 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:03:12,531 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:03:01" (3/4) ... [2025-03-03 23:03:12,533 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:03:12,534 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:03:12,535 INFO L158 Benchmark]: Toolchain (without parser) took 12054.48ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 130.0MB in the beginning and 81.0MB in the end (delta: 49.1MB). Peak memory consumption was 120.7MB. Max. memory is 16.1GB. [2025-03-03 23:03:12,535 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:03:12,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.49ms. Allocated memory is still 167.8MB. Free memory was 129.6MB in the beginning and 114.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:03:12,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.74ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 110.2MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:03:12,536 INFO L158 Benchmark]: Boogie Preprocessor took 46.32ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 104.7MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:03:12,536 INFO L158 Benchmark]: IcfgBuilder took 532.67ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 74.1MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 23:03:12,537 INFO L158 Benchmark]: TraceAbstraction took 11129.82ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 73.6MB in the beginning and 81.0MB in the end (delta: -7.4MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. [2025-03-03 23:03:12,537 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 243.3MB. Free memory was 81.0MB in the beginning and 81.0MB in the end (delta: 73.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:03:12,538 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.47ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.49ms. Allocated memory is still 167.8MB. Free memory was 129.6MB in the beginning and 114.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.74ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 110.2MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.32ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 104.7MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 532.67ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 74.1MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11129.82ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 73.6MB in the beginning and 81.0MB in the end (delta: -7.4MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 243.3MB. Free memory was 81.0MB in the beginning and 81.0MB in the end (delta: 73.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 129, overapproximation of someBinaryArithmeticDOUBLEoperation at line 134, overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someBinaryFLOATComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someBinaryFLOATComparisonOperation at line 147, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 155, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 128, overapproximation of someUnaryFLOAToperation at line 61, overapproximation of someBinaryArithmeticFLOAToperation at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.8; [L23] float var_1_6 = 16.375; [L24] float var_1_7 = 0.25; [L25] unsigned char var_1_8 = 1; [L26] unsigned char var_1_9 = 1; [L27] unsigned char var_1_10 = 0; [L28] unsigned long int var_1_11 = 128; [L29] double var_1_13 = 255.5; [L30] double var_1_14 = 0.0; [L31] double var_1_15 = 0.0; [L32] double var_1_16 = 100.3; [L33] unsigned long int var_1_17 = 32; [L34] unsigned short int var_1_19 = 100; [L35] double var_1_21 = 10000000000.5; [L36] double var_1_22 = 32.2; [L37] signed short int var_1_23 = -2; [L38] signed char var_1_24 = 32; [L39] signed char var_1_25 = 10; [L40] signed char var_1_26 = -128; [L41] double var_1_27 = 5.8; [L42] unsigned short int var_1_28 = 16; [L43] unsigned char var_1_30 = 1; [L44] unsigned char var_1_31 = 0; [L45] unsigned char var_1_32 = 0; [L46] unsigned long int var_1_33 = 256; [L47] unsigned char var_1_34 = 0; [L48] float var_1_35 = 3.625; [L49] float var_1_36 = 9.8; [L50] unsigned char var_1_37 = 4; [L51] unsigned long int last_1_var_1_17 = 32; [L52] double last_1_var_1_22 = 32.2; [L53] double last_1_var_1_27 = 5.8; [L54] unsigned char last_1_var_1_37 = 4; VAL [isInitial=0, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_6=131/8, var_1_7=1/4, var_1_8=1, var_1_9=1] [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] CALL updateLastVariables() [L182] last_1_var_1_17 = var_1_17 [L183] last_1_var_1_22 = var_1_22 [L184] last_1_var_1_27 = var_1_27 [L185] last_1_var_1_37 = var_1_37 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_6=131/8, var_1_7=1/4, var_1_8=1, var_1_9=1] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L144] var_1_6 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_7=1/4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_7=1/4, var_1_8=1, var_1_9=1] [L145] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_7=1/4, var_1_8=1, var_1_9=1] [L146] var_1_7 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L147] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L148] var_1_9 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L149] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L150] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L151] var_1_10 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L152] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L153] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L154] var_1_14 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L155] RET assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L156] var_1_15 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L157] RET assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L158] var_1_16 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L159] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L160] var_1_24 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L161] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L162] CALL assume_abort_if_not(var_1_24 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L162] RET assume_abort_if_not(var_1_24 <= 127) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L163] var_1_25 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L164] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L165] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L165] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L166] var_1_26 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_26 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L167] RET assume_abort_if_not(var_1_26 >= -128) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L168] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L168] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_26 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L169] RET assume_abort_if_not(var_1_26 != 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L170] var_1_31 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L171] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L172] CALL assume_abort_if_not(var_1_31 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L172] RET assume_abort_if_not(var_1_31 <= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L173] var_1_33 = __VERIFIER_nondet_ulong() [L174] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L174] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L175] CALL assume_abort_if_not(var_1_33 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L175] RET assume_abort_if_not(var_1_33 <= 4294967295) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L176] CALL assume_abort_if_not(var_1_33 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L176] RET assume_abort_if_not(var_1_33 != 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L177] var_1_34 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L178] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L179] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L179] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L196] RET updateVariables() [L197] CALL step() [L58] COND FALSE !((- last_1_var_1_27) < var_1_7) [L61] var_1_21 = ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_6=5, var_1_8=1, var_1_9=1] [L63] COND TRUE ((((8.25) < (last_1_var_1_22)) ? (8.25) : (last_1_var_1_22))) >= (var_1_15 * var_1_16) [L64] var_1_28 = ((var_1_25 + (100 + 64)) + last_1_var_1_37) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_6=5, var_1_8=1, var_1_9=1] [L68] COND TRUE \read(var_1_9) [L69] var_1_11 = 0u VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_6=5, var_1_8=1, var_1_9=1] [L79] COND TRUE \read(var_1_9) [L80] var_1_30 = (! var_1_31) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_6=5, var_1_8=1, var_1_9=1] [L82] var_1_35 = var_1_16 [L83] var_1_36 = var_1_14 [L84] var_1_37 = var_1_25 [L85] unsigned long int stepLocal_0 = 1u; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=3, var_1_16=4, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L86] COND FALSE !(((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=3, var_1_16=4, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L91] signed long int stepLocal_4 = (var_1_24 - var_1_25) / ((((var_1_26) < (4)) ? (var_1_26) : (4))); VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_4=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=3, var_1_16=4, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L92] COND TRUE stepLocal_4 > var_1_37 [L93] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=3, var_1_16=4, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L95] unsigned char stepLocal_3 = var_1_37; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_3=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=3, var_1_16=4, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L96] COND FALSE !(var_1_28 <= stepLocal_3) [L99] var_1_19 = ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=3, var_1_16=4, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L101] signed long int stepLocal_2 = var_1_19 - var_1_19; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=3, var_1_16=4, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L102] COND TRUE \read(var_1_9) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=3, var_1_16=4, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L103] COND TRUE \read(var_1_10) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=3, var_1_16=4, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L104] EXPR (last_1_var_1_17 / -64) << var_1_11 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=3, var_1_16=4, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L104] COND TRUE ((last_1_var_1_17 / -64) << var_1_11) >= stepLocal_2 [L105] var_1_17 = var_1_19 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=3, var_1_16=4, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L113] EXPR var_1_37 ^ (4u / var_1_33) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=3, var_1_16=4, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L113] COND TRUE (var_1_37 ^ (4u / var_1_33)) != var_1_17 [L114] var_1_32 = ((99.6f != var_1_7) || var_1_10) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=3, var_1_16=4, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L118] COND TRUE ((var_1_16 * var_1_6) > var_1_15) && var_1_32 [L119] var_1_22 = var_1_6 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=3, var_1_16=4, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=2, var_1_22=5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L123] COND TRUE ((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23 [L124] var_1_1 = (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=3, var_1_16=4, var_1_17=0, var_1_19=0, var_1_21=2, var_1_22=5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L126] signed long int stepLocal_5 = var_1_19 + var_1_37; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_5=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=3, var_1_16=4, var_1_17=0, var_1_19=0, var_1_21=2, var_1_22=5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L127] COND TRUE var_1_28 != stepLocal_5 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=3, var_1_16=4, var_1_17=0, var_1_19=0, var_1_21=2, var_1_22=5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L128] COND TRUE var_1_1 < var_1_21 [L129] var_1_27 = (var_1_15 - var_1_16) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=3, var_1_16=4, var_1_17=0, var_1_19=0, var_1_21=2, var_1_22=5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L132] unsigned short int stepLocal_1 = var_1_28; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_1=168, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=3, var_1_16=4, var_1_17=0, var_1_19=0, var_1_21=2, var_1_22=5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L133] COND TRUE var_1_7 != (var_1_27 * var_1_6) [L134] var_1_13 = ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_1=168, var_1_10=1, var_1_11=0, var_1_14=3, var_1_16=4, var_1_17=0, var_1_19=0, var_1_21=2, var_1_22=5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L197] RET step() [L198] CALL, EXPR property() [L188] EXPR (((((((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23) ? (var_1_1 == ((float) (var_1_6 - var_1_7))) : 1) && ((((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) ? ((1u < var_1_37) ? (var_1_8 == ((unsigned char) (var_1_9 && var_1_10))) : 1) : 1)) && (var_1_9 ? (var_1_11 == ((unsigned long int) 0u)) : (var_1_10 ? (var_1_11 == ((unsigned long int) ((((8u + var_1_28) < 0 ) ? -(8u + var_1_28) : (8u + var_1_28))))) : ((var_1_6 < 127.5f) ? (var_1_11 == ((unsigned long int) var_1_28)) : 1)))) && ((var_1_7 != (var_1_27 * var_1_6)) ? (var_1_13 == ((double) ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7))) : ((var_1_28 > var_1_28) ? (var_1_13 == ((double) 10.6)) : (var_1_13 == ((double) var_1_15))))) && (var_1_9 ? (var_1_10 ? ((((last_1_var_1_17 / -64) << var_1_11) >= (var_1_19 - var_1_19)) ? (var_1_17 == ((unsigned long int) var_1_19)) : 1) : (var_1_17 == ((unsigned long int) var_1_19))) : (var_1_17 == ((unsigned long int) 2u))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=3, var_1_16=4, var_1_17=0, var_1_19=0, var_1_21=2, var_1_22=5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L188] EXPR (((((((((((((((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23) ? (var_1_1 == ((float) (var_1_6 - var_1_7))) : 1) && ((((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) ? ((1u < var_1_37) ? (var_1_8 == ((unsigned char) (var_1_9 && var_1_10))) : 1) : 1)) && (var_1_9 ? (var_1_11 == ((unsigned long int) 0u)) : (var_1_10 ? (var_1_11 == ((unsigned long int) ((((8u + var_1_28) < 0 ) ? -(8u + var_1_28) : (8u + var_1_28))))) : ((var_1_6 < 127.5f) ? (var_1_11 == ((unsigned long int) var_1_28)) : 1)))) && ((var_1_7 != (var_1_27 * var_1_6)) ? (var_1_13 == ((double) ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7))) : ((var_1_28 > var_1_28) ? (var_1_13 == ((double) 10.6)) : (var_1_13 == ((double) var_1_15))))) && (var_1_9 ? (var_1_10 ? ((((last_1_var_1_17 / -64) << var_1_11) >= (var_1_19 - var_1_19)) ? (var_1_17 == ((unsigned long int) var_1_19)) : 1) : (var_1_17 == ((unsigned long int) var_1_19))) : (var_1_17 == ((unsigned long int) 2u)))) && ((var_1_28 <= var_1_37) ? (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))) : (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))))) && (((- last_1_var_1_27) < var_1_7) ? (var_1_21 == ((double) 0.19999999999999996)) : (var_1_21 == ((double) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))))) && ((((var_1_16 * var_1_6) > var_1_15) && var_1_32) ? (var_1_22 == ((double) var_1_6)) : (var_1_22 == ((double) ((((var_1_15) < (var_1_7)) ? (var_1_15) : (var_1_7))))))) && ((((var_1_24 - var_1_25) / ((((var_1_26) < (4)) ? (var_1_26) : (4)))) > var_1_37) ? (var_1_23 == ((signed short int) var_1_24)) : 1)) && ((var_1_28 != (var_1_19 + var_1_37)) ? ((var_1_1 < var_1_21) ? (var_1_27 == ((double) (var_1_15 - var_1_16))) : 1) : 1)) && ((((((8.25) < (last_1_var_1_22)) ? (8.25) : (last_1_var_1_22))) >= (var_1_15 * var_1_16)) ? (var_1_28 == ((unsigned short int) ((var_1_25 + (100 + 64)) + last_1_var_1_37))) : (var_1_28 == ((unsigned short int) last_1_var_1_37)))) && (var_1_9 ? (var_1_30 == ((unsigned char) (! var_1_31))) : 1)) && (((var_1_37 ^ (4u / var_1_33)) != var_1_17) ? (var_1_32 == ((unsigned char) ((99.6f != var_1_7) || var_1_10))) : (var_1_32 == ((unsigned char) (var_1_31 || var_1_34)))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=3, var_1_16=4, var_1_17=0, var_1_19=0, var_1_21=2, var_1_22=5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L188-L189] return ((((((((((((((((((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23) ? (var_1_1 == ((float) (var_1_6 - var_1_7))) : 1) && ((((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) ? ((1u < var_1_37) ? (var_1_8 == ((unsigned char) (var_1_9 && var_1_10))) : 1) : 1)) && (var_1_9 ? (var_1_11 == ((unsigned long int) 0u)) : (var_1_10 ? (var_1_11 == ((unsigned long int) ((((8u + var_1_28) < 0 ) ? -(8u + var_1_28) : (8u + var_1_28))))) : ((var_1_6 < 127.5f) ? (var_1_11 == ((unsigned long int) var_1_28)) : 1)))) && ((var_1_7 != (var_1_27 * var_1_6)) ? (var_1_13 == ((double) ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7))) : ((var_1_28 > var_1_28) ? (var_1_13 == ((double) 10.6)) : (var_1_13 == ((double) var_1_15))))) && (var_1_9 ? (var_1_10 ? ((((last_1_var_1_17 / -64) << var_1_11) >= (var_1_19 - var_1_19)) ? (var_1_17 == ((unsigned long int) var_1_19)) : 1) : (var_1_17 == ((unsigned long int) var_1_19))) : (var_1_17 == ((unsigned long int) 2u)))) && ((var_1_28 <= var_1_37) ? (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))) : (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))))) && (((- last_1_var_1_27) < var_1_7) ? (var_1_21 == ((double) 0.19999999999999996)) : (var_1_21 == ((double) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))))) && ((((var_1_16 * var_1_6) > var_1_15) && var_1_32) ? (var_1_22 == ((double) var_1_6)) : (var_1_22 == ((double) ((((var_1_15) < (var_1_7)) ? (var_1_15) : (var_1_7))))))) && ((((var_1_24 - var_1_25) / ((((var_1_26) < (4)) ? (var_1_26) : (4)))) > var_1_37) ? (var_1_23 == ((signed short int) var_1_24)) : 1)) && ((var_1_28 != (var_1_19 + var_1_37)) ? ((var_1_1 < var_1_21) ? (var_1_27 == ((double) (var_1_15 - var_1_16))) : 1) : 1)) && ((((((8.25) < (last_1_var_1_22)) ? (8.25) : (last_1_var_1_22))) >= (var_1_15 * var_1_16)) ? (var_1_28 == ((unsigned short int) ((var_1_25 + (100 + 64)) + last_1_var_1_37))) : (var_1_28 == ((unsigned short int) last_1_var_1_37)))) && (var_1_9 ? (var_1_30 == ((unsigned char) (! var_1_31))) : 1)) && (((var_1_37 ^ (4u / var_1_33)) != var_1_17) ? (var_1_32 == ((unsigned char) ((99.6f != var_1_7) || var_1_10))) : (var_1_32 == ((unsigned char) (var_1_31 || var_1_34))))) && (var_1_35 == ((float) var_1_16))) && (var_1_36 == ((float) var_1_14))) && (var_1_37 == ((unsigned char) var_1_25)) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=3, var_1_16=4, var_1_17=0, var_1_19=0, var_1_21=2, var_1_22=5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=3, var_1_16=4, var_1_17=0, var_1_19=0, var_1_21=2, var_1_22=5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=4, var_1_36=3, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 11, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3365 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3359 mSDsluCounter, 6409 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4747 mSDsCounter, 646 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3538 IncrementalHoareTripleChecker+Invalid, 4184 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 646 mSolverCounterUnsat, 1662 mSDtfsCounter, 3538 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 928 GetRequests, 839 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=340occurred in iteration=8, InterpolantAutomatonStates: 71, 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, 10 MinimizatonAttempts, 1202 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2441 NumberOfCodeBlocks, 2441 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2422 ConstructedInterpolants, 0 QuantifiedInterpolants, 8700 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1193 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 14794/15180 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 23:03:12,580 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-80.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 9e515de62df857d489d59950c6beb84861229f7c018feb1ce9e167b3b2d6609e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:03:14,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:03:14,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:03:14,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:03:14,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:03:14,703 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:03:14,703 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:03:14,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:03:14,704 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:03:14,704 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:03:14,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:03:14,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:03:14,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:03:14,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:03:14,704 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:03:14,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:03:14,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:03:14,704 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:03:14,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:03:14,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:03:14,706 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:03:14,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:03:14,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:03:14,707 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:03:14,707 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:03:14,707 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:03:14,707 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:03:14,707 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:03:14,707 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:03:14,707 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:03:14,708 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:03:14,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:03:14,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:03:14,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:03:14,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:03:14,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:03:14,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:03:14,709 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:03:14,709 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:03:14,709 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:03:14,709 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:03:14,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:03:14,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:03:14,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:03:14,709 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:03:14,709 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 -> 9e515de62df857d489d59950c6beb84861229f7c018feb1ce9e167b3b2d6609e [2025-03-03 23:03:14,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:03:14,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:03:15,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:03:15,002 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:03:15,002 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:03:15,003 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-80.i [2025-03-03 23:03:16,243 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f51ebc023/2057caae4a364a7f9e0ba73cf700c6aa/FLAGa10f6679f [2025-03-03 23:03:16,453 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:03:16,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-80.i [2025-03-03 23:03:16,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f51ebc023/2057caae4a364a7f9e0ba73cf700c6aa/FLAGa10f6679f [2025-03-03 23:03:16,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f51ebc023/2057caae4a364a7f9e0ba73cf700c6aa [2025-03-03 23:03:16,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:03:16,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:03:16,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:03:16,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:03:16,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:03:16,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:03:16" (1/1) ... [2025-03-03 23:03:16,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@684a267f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:16, skipping insertion in model container [2025-03-03 23:03:16,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:03:16" (1/1) ... [2025-03-03 23:03:16,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:03:16,628 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-80.i[916,929] [2025-03-03 23:03:16,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:03:16,718 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:03:16,728 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-80.i[916,929] [2025-03-03 23:03:16,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:03:16,777 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:03:16,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:16 WrapperNode [2025-03-03 23:03:16,778 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:03:16,779 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:03:16,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:03:16,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:03:16,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:16" (1/1) ... [2025-03-03 23:03:16,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:16" (1/1) ... [2025-03-03 23:03:16,821 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-03-03 23:03:16,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:03:16,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:03:16,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:03:16,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:03:16,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:16" (1/1) ... [2025-03-03 23:03:16,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:16" (1/1) ... [2025-03-03 23:03:16,834 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:16" (1/1) ... [2025-03-03 23:03:16,846 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:03:16,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:16" (1/1) ... [2025-03-03 23:03:16,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:16" (1/1) ... [2025-03-03 23:03:16,854 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:16" (1/1) ... [2025-03-03 23:03:16,859 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:16" (1/1) ... [2025-03-03 23:03:16,861 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:16" (1/1) ... [2025-03-03 23:03:16,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:16" (1/1) ... [2025-03-03 23:03:16,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:03:16,871 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:03:16,871 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:03:16,871 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:03:16,872 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:16" (1/1) ... [2025-03-03 23:03:16,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:03:16,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:03:16,899 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:03:16,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:03:16,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:03:16,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:03:16,922 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:03:16,922 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:03:16,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:03:16,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:03:16,985 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:03:16,987 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:03:44,474 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 23:03:44,474 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:03:44,481 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:03:44,481 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:03:44,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:03:44 BoogieIcfgContainer [2025-03-03 23:03:44,481 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:03:44,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:03:44,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:03:44,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:03:44,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:03:16" (1/3) ... [2025-03-03 23:03:44,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17946a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:03:44, skipping insertion in model container [2025-03-03 23:03:44,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:16" (2/3) ... [2025-03-03 23:03:44,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17946a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:03:44, skipping insertion in model container [2025-03-03 23:03:44,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:03:44" (3/3) ... [2025-03-03 23:03:44,488 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-80.i [2025-03-03 23:03:44,498 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:03:44,499 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-80.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:03:44,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:03:44,550 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;@16fb0e7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:03:44,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:03:44,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 23:03:44,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 23:03:44,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:03:44,565 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:03:44,565 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:03:44,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:03:44,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1881888824, now seen corresponding path program 1 times [2025-03-03 23:03:44,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:03:44,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905675147] [2025-03-03 23:03:44,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:03:44,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:03:44,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:03:44,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:03:44,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 23:03:44,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 23:03:45,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 23:03:45,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:03:45,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:03:45,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:03:45,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:03:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-03-03 23:03:45,572 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:03:45,573 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:03:45,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905675147] [2025-03-03 23:03:45,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [905675147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:03:45,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:03:45,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:03:45,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928440468] [2025-03-03 23:03:45,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:03:45,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:03:45,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:03:45,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:03:45,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:03:45,592 INFO L87 Difference]: Start difference. First operand has 80 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:03:45,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:03:45,609 INFO L93 Difference]: Finished difference Result 154 states and 266 transitions. [2025-03-03 23:03:45,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:03:45,611 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 156 [2025-03-03 23:03:45,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:03:45,615 INFO L225 Difference]: With dead ends: 154 [2025-03-03 23:03:45,616 INFO L226 Difference]: Without dead ends: 77 [2025-03-03 23:03:45,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:03:45,624 INFO L435 NwaCegarLoop]: 119 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, 119 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:03:45,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:03:45,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-03 23:03:45,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-03 23:03:45,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 23:03:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 119 transitions. [2025-03-03 23:03:45,659 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 119 transitions. Word has length 156 [2025-03-03 23:03:45,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:03:45,659 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 119 transitions. [2025-03-03 23:03:45,660 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:03:45,660 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 119 transitions. [2025-03-03 23:03:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 23:03:45,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:03:45,662 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:03:45,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 23:03:45,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:03:45,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:03:45,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:03:45,864 INFO L85 PathProgramCache]: Analyzing trace with hash -290137059, now seen corresponding path program 1 times [2025-03-03 23:03:45,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:03:45,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666051392] [2025-03-03 23:03:45,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:03:45,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:03:45,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:03:45,868 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:03:45,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 23:03:45,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 23:03:46,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 23:03:46,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:03:46,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:03:46,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 23:03:46,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:03:54,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 33 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-03-03 23:03:54,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:03:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 23:03:59,514 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:03:59,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666051392] [2025-03-03 23:03:59,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666051392] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:03:59,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:03:59,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2025-03-03 23:03:59,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021942065] [2025-03-03 23:03:59,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:03:59,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 23:03:59,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:03:59,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 23:03:59,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-03 23:03:59,517 INFO L87 Difference]: Start difference. First operand 77 states and 119 transitions. Second operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-03 23:04:11,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:04:15,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:04:25,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:04:29,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:04:33,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []