./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.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 e1856ea979a515682843ea065e3d41725035a700c47302906a364d3e5d5e532f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:41:47,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:41:47,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:41:47,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:41:47,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:41:47,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:41:47,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:41:47,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:41:47,801 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:41:47,801 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:41:47,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:41:47,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:41:47,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:41:47,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:41:47,802 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:41:47,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:41:47,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:41:47,803 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:41:47,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:41:47,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:41:47,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:41:47,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:41:47,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:41:47,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:41:47,803 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:41:47,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:41:47,804 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:41:47,804 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:41:47,804 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:41:47,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:41:47,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:41:47,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:41:47,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:41:47,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:41:47,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:41:47,805 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:41:47,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:41:47,805 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:41:47,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:41:47,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:41:47,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:41:47,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:41:47,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:41:47,805 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 -> e1856ea979a515682843ea065e3d41725035a700c47302906a364d3e5d5e532f [2025-03-03 19:41:48,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:41:48,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:41:48,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:41:48,042 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:41:48,042 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:41:48,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2025-03-03 19:41:49,146 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22ca9e20b/2daab435346541649a219bee4aaf2baa/FLAGe94345ebf [2025-03-03 19:41:49,373 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:41:49,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2025-03-03 19:41:49,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22ca9e20b/2daab435346541649a219bee4aaf2baa/FLAGe94345ebf [2025-03-03 19:41:49,711 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22ca9e20b/2daab435346541649a219bee4aaf2baa [2025-03-03 19:41:49,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:41:49,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:41:49,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:41:49,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:41:49,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:41:49,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:41:49" (1/1) ... [2025-03-03 19:41:49,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f59e618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:49, skipping insertion in model container [2025-03-03 19:41:49,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:41:49" (1/1) ... [2025-03-03 19:41:49,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:41:49,822 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i[915,928] [2025-03-03 19:41:49,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:41:49,900 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:41:49,909 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i[915,928] [2025-03-03 19:41:49,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:41:49,959 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:41:49,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:49 WrapperNode [2025-03-03 19:41:49,960 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:41:49,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:41:49,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:41:49,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:41:49,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:49" (1/1) ... [2025-03-03 19:41:49,973 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:49" (1/1) ... [2025-03-03 19:41:50,017 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 229 [2025-03-03 19:41:50,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:41:50,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:41:50,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:41:50,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:41:50,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:49" (1/1) ... [2025-03-03 19:41:50,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:49" (1/1) ... [2025-03-03 19:41:50,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:49" (1/1) ... [2025-03-03 19:41:50,048 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 19:41:50,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:49" (1/1) ... [2025-03-03 19:41:50,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:49" (1/1) ... [2025-03-03 19:41:50,057 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:49" (1/1) ... [2025-03-03 19:41:50,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:49" (1/1) ... [2025-03-03 19:41:50,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:49" (1/1) ... [2025-03-03 19:41:50,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:49" (1/1) ... [2025-03-03 19:41:50,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:41:50,072 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:41:50,072 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:41:50,072 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:41:50,073 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:49" (1/1) ... [2025-03-03 19:41:50,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:41:50,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:41:50,098 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 19:41:50,104 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 19:41:50,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:41:50,118 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:41:50,118 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:41:50,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:41:50,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:41:50,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:41:50,185 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:41:50,187 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:41:50,487 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc property_#t~bitwise22#1;havoc property_#t~short23#1;havoc property_#t~bitwise24#1;havoc property_#t~short25#1; [2025-03-03 19:41:50,525 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-03 19:41:50,525 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:41:50,543 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:41:50,543 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:41:50,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:41:50 BoogieIcfgContainer [2025-03-03 19:41:50,544 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:41:50,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:41:50,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:41:50,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:41:50,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:41:49" (1/3) ... [2025-03-03 19:41:50,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6020f760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:41:50, skipping insertion in model container [2025-03-03 19:41:50,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:49" (2/3) ... [2025-03-03 19:41:50,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6020f760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:41:50, skipping insertion in model container [2025-03-03 19:41:50,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:41:50" (3/3) ... [2025-03-03 19:41:50,551 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2025-03-03 19:41:50,562 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:41:50,564 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-84.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:41:50,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:41:50,620 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;@6c450229, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:41:50,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:41:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 64 states have (on average 1.375) internal successors, (88), 65 states have internal predecessors, (88), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 19:41:50,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 19:41:50,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:41:50,637 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:41:50,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:41:50,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:41:50,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2117541822, now seen corresponding path program 1 times [2025-03-03 19:41:50,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:41:50,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049343546] [2025-03-03 19:41:50,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:41:50,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:41:50,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 19:41:50,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 19:41:50,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:41:50,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:41:50,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-03 19:41:50,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:41:50,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049343546] [2025-03-03 19:41:50,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049343546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:41:50,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677263236] [2025-03-03 19:41:50,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:41:50,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:41:50,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:41:50,931 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 19:41:50,933 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 19:41:51,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 19:41:51,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 19:41:51,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:41:51,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:41:51,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:41:51,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:41:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-03 19:41:51,108 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:41:51,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677263236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:41:51,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:41:51,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:41:51,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878985243] [2025-03-03 19:41:51,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:41:51,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:41:51,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:41:51,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:41:51,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:41:51,129 INFO L87 Difference]: Start difference. First operand has 100 states, 64 states have (on average 1.375) internal successors, (88), 65 states have internal predecessors, (88), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 19:41:51,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:41:51,161 INFO L93 Difference]: Finished difference Result 194 states and 336 transitions. [2025-03-03 19:41:51,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:41:51,163 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, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 208 [2025-03-03 19:41:51,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:41:51,169 INFO L225 Difference]: With dead ends: 194 [2025-03-03 19:41:51,169 INFO L226 Difference]: Without dead ends: 97 [2025-03-03 19:41:51,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 209 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 19:41:51,174 INFO L435 NwaCegarLoop]: 145 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, 145 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 19:41:51,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:41:51,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-03 19:41:51,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-03 19:41:51,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 19:41:51,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 149 transitions. [2025-03-03 19:41:51,217 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 149 transitions. Word has length 208 [2025-03-03 19:41:51,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:41:51,218 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 149 transitions. [2025-03-03 19:41:51,219 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, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 19:41:51,219 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 149 transitions. [2025-03-03 19:41:51,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 19:41:51,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:41:51,222 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:41:51,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:41:51,423 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 19:41:51,423 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:41:51,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:41:51,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1435833341, now seen corresponding path program 1 times [2025-03-03 19:41:51,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:41:51,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943764297] [2025-03-03 19:41:51,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:41:51,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:41:51,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 19:41:51,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 19:41:51,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:41:51,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:41:51,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:41:51,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:41:51,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943764297] [2025-03-03 19:41:51,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943764297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:41:51,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:41:51,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:41:51,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830260151] [2025-03-03 19:41:51,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:41:51,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:41:51,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:41:51,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:41:51,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:41:51,827 INFO L87 Difference]: Start difference. First operand 97 states and 149 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:41:51,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:41:51,865 INFO L93 Difference]: Finished difference Result 191 states and 295 transitions. [2025-03-03 19:41:51,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:41:51,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2025-03-03 19:41:51,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:41:51,869 INFO L225 Difference]: With dead ends: 191 [2025-03-03 19:41:51,869 INFO L226 Difference]: Without dead ends: 97 [2025-03-03 19:41:51,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:41:51,870 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 146 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:41:51,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 141 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:41:51,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-03 19:41:51,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-03 19:41:51,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 19:41:51,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 148 transitions. [2025-03-03 19:41:51,887 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 148 transitions. Word has length 208 [2025-03-03 19:41:51,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:41:51,889 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 148 transitions. [2025-03-03 19:41:51,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:41:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 148 transitions. [2025-03-03 19:41:51,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 19:41:51,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:41:51,892 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:41:51,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:41:51,892 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:41:51,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:41:51,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1306750622, now seen corresponding path program 1 times [2025-03-03 19:41:51,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:41:51,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430263829] [2025-03-03 19:41:51,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:41:51,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:41:51,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 19:41:51,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 19:41:51,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:41:51,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:41:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:41:55,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:41:55,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430263829] [2025-03-03 19:41:55,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430263829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:41:55,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:41:55,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 19:41:55,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858666130] [2025-03-03 19:41:55,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:41:55,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:41:55,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:41:55,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:41:55,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:41:55,388 INFO L87 Difference]: Start difference. First operand 97 states and 148 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:41:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:41:57,529 INFO L93 Difference]: Finished difference Result 375 states and 536 transitions. [2025-03-03 19:41:57,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 19:41:57,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2025-03-03 19:41:57,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:41:57,533 INFO L225 Difference]: With dead ends: 375 [2025-03-03 19:41:57,533 INFO L226 Difference]: Without dead ends: 281 [2025-03-03 19:41:57,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2025-03-03 19:41:57,535 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 326 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 19:41:57,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 840 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 19:41:57,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-03 19:41:57,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 149. [2025-03-03 19:41:57,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 111 states have (on average 1.3783783783783783) internal successors, (153), 112 states have internal predecessors, (153), 35 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-03 19:41:57,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 223 transitions. [2025-03-03 19:41:57,560 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 223 transitions. Word has length 208 [2025-03-03 19:41:57,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:41:57,561 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 223 transitions. [2025-03-03 19:41:57,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:41:57,561 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 223 transitions. [2025-03-03 19:41:57,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 19:41:57,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:41:57,565 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:41:57,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:41:57,565 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:41:57,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:41:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1627381081, now seen corresponding path program 1 times [2025-03-03 19:41:57,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:41:57,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598008475] [2025-03-03 19:41:57,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:41:57,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:41:57,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 19:41:57,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 19:41:57,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:41:57,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:41:59,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:41:59,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:41:59,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598008475] [2025-03-03 19:41:59,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598008475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:41:59,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:41:59,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 19:41:59,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824530052] [2025-03-03 19:41:59,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:41:59,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:41:59,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:41:59,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:41:59,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:41:59,111 INFO L87 Difference]: Start difference. First operand 149 states and 223 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:01,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:42:01,325 INFO L93 Difference]: Finished difference Result 540 states and 759 transitions. [2025-03-03 19:42:01,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 19:42:01,328 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2025-03-03 19:42:01,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:42:01,331 INFO L225 Difference]: With dead ends: 540 [2025-03-03 19:42:01,331 INFO L226 Difference]: Without dead ends: 394 [2025-03-03 19:42:01,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2025-03-03 19:42:01,332 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 403 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:42:01,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 924 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 19:42:01,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-03 19:42:01,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 151. [2025-03-03 19:42:01,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 114 states have internal predecessors, (157), 35 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-03 19:42:01,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 227 transitions. [2025-03-03 19:42:01,352 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 227 transitions. Word has length 209 [2025-03-03 19:42:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:42:01,353 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 227 transitions. [2025-03-03 19:42:01,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:01,353 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 227 transitions. [2025-03-03 19:42:01,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 19:42:01,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:42:01,355 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:42:01,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:42:01,355 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:42:01,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:42:01,356 INFO L85 PathProgramCache]: Analyzing trace with hash 35547508, now seen corresponding path program 1 times [2025-03-03 19:42:01,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:42:01,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993274869] [2025-03-03 19:42:01,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:42:01,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:42:01,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 19:42:01,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 19:42:01,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:01,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:42:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:42:03,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:42:03,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993274869] [2025-03-03 19:42:03,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993274869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:42:03,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:42:03,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 19:42:03,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098745831] [2025-03-03 19:42:03,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:42:03,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 19:42:03,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:42:03,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 19:42:03,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:42:03,978 INFO L87 Difference]: Start difference. First operand 151 states and 227 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:07,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:42:07,203 INFO L93 Difference]: Finished difference Result 476 states and 686 transitions. [2025-03-03 19:42:07,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 19:42:07,204 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2025-03-03 19:42:07,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:42:07,207 INFO L225 Difference]: With dead ends: 476 [2025-03-03 19:42:07,207 INFO L226 Difference]: Without dead ends: 328 [2025-03-03 19:42:07,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2025-03-03 19:42:07,208 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 423 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:42:07,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 624 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 19:42:07,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-03 19:42:07,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 152. [2025-03-03 19:42:07,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 114 states have (on average 1.394736842105263) internal successors, (159), 115 states have internal predecessors, (159), 35 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-03 19:42:07,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 229 transitions. [2025-03-03 19:42:07,220 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 229 transitions. Word has length 209 [2025-03-03 19:42:07,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:42:07,220 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 229 transitions. [2025-03-03 19:42:07,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:07,221 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 229 transitions. [2025-03-03 19:42:07,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 19:42:07,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:42:07,222 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:42:07,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:42:07,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:42:07,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:42:07,222 INFO L85 PathProgramCache]: Analyzing trace with hash -808924363, now seen corresponding path program 1 times [2025-03-03 19:42:07,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:42:07,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64956761] [2025-03-03 19:42:07,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:42:07,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:42:07,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 19:42:07,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 19:42:07,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:07,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:42:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:42:08,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:42:08,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64956761] [2025-03-03 19:42:08,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64956761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:42:08,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:42:08,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 19:42:08,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292614367] [2025-03-03 19:42:08,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:42:08,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 19:42:08,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:42:08,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 19:42:08,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:42:08,495 INFO L87 Difference]: Start difference. First operand 152 states and 229 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:09,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:42:09,502 INFO L93 Difference]: Finished difference Result 365 states and 540 transitions. [2025-03-03 19:42:09,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:42:09,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2025-03-03 19:42:09,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:42:09,504 INFO L225 Difference]: With dead ends: 365 [2025-03-03 19:42:09,504 INFO L226 Difference]: Without dead ends: 216 [2025-03-03 19:42:09,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:42:09,505 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 41 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 19:42:09,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 600 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 19:42:09,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-03 19:42:09,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 197. [2025-03-03 19:42:09,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 151 states have (on average 1.3443708609271523) internal successors, (203), 154 states have internal predecessors, (203), 41 states have call successors, (41), 4 states have call predecessors, (41), 4 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-03 19:42:09,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 285 transitions. [2025-03-03 19:42:09,519 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 285 transitions. Word has length 209 [2025-03-03 19:42:09,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:42:09,520 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 285 transitions. [2025-03-03 19:42:09,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:09,520 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 285 transitions. [2025-03-03 19:42:09,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 19:42:09,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:42:09,521 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:42:09,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:42:09,522 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:42:09,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:42:09,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1996113902, now seen corresponding path program 1 times [2025-03-03 19:42:09,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:42:09,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760716222] [2025-03-03 19:42:09,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:42:09,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:42:09,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 19:42:09,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 19:42:09,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:09,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:42:12,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:42:12,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:42:12,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760716222] [2025-03-03 19:42:12,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760716222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:42:12,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:42:12,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 19:42:12,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353389170] [2025-03-03 19:42:12,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:42:12,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 19:42:12,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:42:12,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 19:42:12,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:42:12,305 INFO L87 Difference]: Start difference. First operand 197 states and 285 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:42:12,841 INFO L93 Difference]: Finished difference Result 461 states and 657 transitions. [2025-03-03 19:42:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 19:42:12,842 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2025-03-03 19:42:12,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:42:12,843 INFO L225 Difference]: With dead ends: 461 [2025-03-03 19:42:12,843 INFO L226 Difference]: Without dead ends: 267 [2025-03-03 19:42:12,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:42:12,844 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 36 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:42:12,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 836 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:42:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-03 19:42:12,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 204. [2025-03-03 19:42:12,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 158 states have (on average 1.3417721518987342) internal successors, (212), 161 states have internal predecessors, (212), 41 states have call successors, (41), 4 states have call predecessors, (41), 4 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-03 19:42:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 294 transitions. [2025-03-03 19:42:12,859 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 294 transitions. Word has length 209 [2025-03-03 19:42:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:42:12,859 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 294 transitions. [2025-03-03 19:42:12,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 294 transitions. [2025-03-03 19:42:12,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 19:42:12,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:42:12,863 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:42:12,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:42:12,863 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:42:12,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:42:12,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1490555277, now seen corresponding path program 1 times [2025-03-03 19:42:12,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:42:12,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616718155] [2025-03-03 19:42:12,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:42:12,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:42:12,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 19:42:12,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 19:42:12,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:12,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:42:14,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:42:14,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:42:14,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616718155] [2025-03-03 19:42:14,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616718155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:42:14,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:42:14,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:42:14,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947842111] [2025-03-03 19:42:14,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:42:14,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:42:14,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:42:14,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:42:14,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:42:14,598 INFO L87 Difference]: Start difference. First operand 204 states and 294 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:15,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:42:15,577 INFO L93 Difference]: Finished difference Result 434 states and 619 transitions. [2025-03-03 19:42:15,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 19:42:15,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2025-03-03 19:42:15,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:42:15,581 INFO L225 Difference]: With dead ends: 434 [2025-03-03 19:42:15,581 INFO L226 Difference]: Without dead ends: 233 [2025-03-03 19:42:15,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:42:15,582 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 60 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 19:42:15,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 689 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 19:42:15,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-03 19:42:15,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 171. [2025-03-03 19:42:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 127 states have (on average 1.3228346456692914) internal successors, (168), 129 states have internal predecessors, (168), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 19:42:15,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 246 transitions. [2025-03-03 19:42:15,600 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 246 transitions. Word has length 209 [2025-03-03 19:42:15,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:42:15,600 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 246 transitions. [2025-03-03 19:42:15,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:15,600 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 246 transitions. [2025-03-03 19:42:15,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 19:42:15,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:42:15,602 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:42:15,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:42:15,602 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:42:15,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:42:15,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1413743712, now seen corresponding path program 1 times [2025-03-03 19:42:15,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:42:15,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873024244] [2025-03-03 19:42:15,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:42:15,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:42:15,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 19:42:15,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 19:42:15,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:15,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:42:17,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:42:17,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:42:17,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873024244] [2025-03-03 19:42:17,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873024244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:42:17,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:42:17,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 19:42:17,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433138249] [2025-03-03 19:42:17,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:42:17,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:42:17,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:42:17,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:42:17,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:42:17,552 INFO L87 Difference]: Start difference. First operand 171 states and 246 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:18,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:42:18,299 INFO L93 Difference]: Finished difference Result 476 states and 673 transitions. [2025-03-03 19:42:18,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:42:18,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2025-03-03 19:42:18,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:42:18,301 INFO L225 Difference]: With dead ends: 476 [2025-03-03 19:42:18,301 INFO L226 Difference]: Without dead ends: 308 [2025-03-03 19:42:18,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:42:18,302 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 123 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:42:18,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 712 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:42:18,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-03 19:42:18,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 202. [2025-03-03 19:42:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 158 states have (on average 1.3354430379746836) internal successors, (211), 160 states have internal predecessors, (211), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 19:42:18,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 289 transitions. [2025-03-03 19:42:18,322 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 289 transitions. Word has length 210 [2025-03-03 19:42:18,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:42:18,323 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 289 transitions. [2025-03-03 19:42:18,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:18,323 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 289 transitions. [2025-03-03 19:42:18,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 19:42:18,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:42:18,324 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:42:18,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 19:42:18,324 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:42:18,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:42:18,324 INFO L85 PathProgramCache]: Analyzing trace with hash -383207647, now seen corresponding path program 1 times [2025-03-03 19:42:18,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:42:18,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000744226] [2025-03-03 19:42:18,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:42:18,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:42:18,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 19:42:18,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 19:42:18,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:18,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:42:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:42:21,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:42:21,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000744226] [2025-03-03 19:42:21,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000744226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:42:21,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:42:21,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 19:42:21,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061307203] [2025-03-03 19:42:21,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:42:21,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 19:42:21,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:42:21,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 19:42:21,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:42:21,529 INFO L87 Difference]: Start difference. First operand 202 states and 289 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:42:22,774 INFO L93 Difference]: Finished difference Result 483 states and 683 transitions. [2025-03-03 19:42:22,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 19:42:22,775 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2025-03-03 19:42:22,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:42:22,776 INFO L225 Difference]: With dead ends: 483 [2025-03-03 19:42:22,776 INFO L226 Difference]: Without dead ends: 284 [2025-03-03 19:42:22,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-03-03 19:42:22,777 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 116 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:42:22,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1056 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:42:22,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-03 19:42:22,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 206. [2025-03-03 19:42:22,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 162 states have (on average 1.3395061728395061) internal successors, (217), 164 states have internal predecessors, (217), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 19:42:22,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 295 transitions. [2025-03-03 19:42:22,792 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 295 transitions. Word has length 210 [2025-03-03 19:42:22,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:42:22,793 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 295 transitions. [2025-03-03 19:42:22,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:22,793 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 295 transitions. [2025-03-03 19:42:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 19:42:22,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:42:22,794 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:42:22,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 19:42:22,794 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:42:22,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:42:22,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1120340705, now seen corresponding path program 1 times [2025-03-03 19:42:22,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:42:22,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655865407] [2025-03-03 19:42:22,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:42:22,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:42:22,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 19:42:22,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 19:42:22,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:22,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:42:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:42:24,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:42:24,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655865407] [2025-03-03 19:42:24,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655865407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:42:24,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:42:24,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 19:42:24,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039266059] [2025-03-03 19:42:24,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:42:24,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:42:24,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:42:24,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:42:24,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:42:24,486 INFO L87 Difference]: Start difference. First operand 206 states and 295 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:25,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:42:25,682 INFO L93 Difference]: Finished difference Result 523 states and 734 transitions. [2025-03-03 19:42:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:42:25,682 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2025-03-03 19:42:25,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:42:25,684 INFO L225 Difference]: With dead ends: 523 [2025-03-03 19:42:25,684 INFO L226 Difference]: Without dead ends: 320 [2025-03-03 19:42:25,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:42:25,685 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 85 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:42:25,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 834 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:42:25,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-03 19:42:25,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 202. [2025-03-03 19:42:25,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 158 states have (on average 1.3354430379746836) internal successors, (211), 160 states have internal predecessors, (211), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 19:42:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 289 transitions. [2025-03-03 19:42:25,700 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 289 transitions. Word has length 210 [2025-03-03 19:42:25,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:42:25,701 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 289 transitions. [2025-03-03 19:42:25,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 289 transitions. [2025-03-03 19:42:25,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-03 19:42:25,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:42:25,702 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:42:25,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 19:42:25,702 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:42:25,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:42:25,703 INFO L85 PathProgramCache]: Analyzing trace with hash -679203177, now seen corresponding path program 1 times [2025-03-03 19:42:25,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:42:25,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809268079] [2025-03-03 19:42:25,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:42:25,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:42:25,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-03 19:42:25,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-03 19:42:25,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:25,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:42:25,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:42:25,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:42:25,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809268079] [2025-03-03 19:42:25,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809268079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:42:25,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:42:25,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:42:25,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946476466] [2025-03-03 19:42:25,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:42:25,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:42:25,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:42:25,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:42:25,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:42:25,767 INFO L87 Difference]: Start difference. First operand 202 states and 289 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:42:25,846 INFO L93 Difference]: Finished difference Result 472 states and 666 transitions. [2025-03-03 19:42:25,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:42:25,847 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2025-03-03 19:42:25,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:42:25,848 INFO L225 Difference]: With dead ends: 472 [2025-03-03 19:42:25,848 INFO L226 Difference]: Without dead ends: 273 [2025-03-03 19:42:25,849 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 19:42:25,850 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 45 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:42:25,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 262 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:42:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-03 19:42:25,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 193. [2025-03-03 19:42:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 151 states have (on average 1.3245033112582782) internal successors, (200), 152 states have internal predecessors, (200), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 19:42:25,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 274 transitions. [2025-03-03 19:42:25,865 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 274 transitions. Word has length 211 [2025-03-03 19:42:25,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:42:25,865 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 274 transitions. [2025-03-03 19:42:25,865 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:25,865 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 274 transitions. [2025-03-03 19:42:25,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-03 19:42:25,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:42:25,866 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:42:25,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 19:42:25,867 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:42:25,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:42:25,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1422909454, now seen corresponding path program 1 times [2025-03-03 19:42:25,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:42:25,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448107790] [2025-03-03 19:42:25,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:42:25,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:42:25,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-03 19:42:25,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-03 19:42:25,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:25,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:42:25,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:42:26,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:42:26,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448107790] [2025-03-03 19:42:26,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448107790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:42:26,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:42:26,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:42:26,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111254893] [2025-03-03 19:42:26,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:42:26,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:42:26,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:42:26,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:42:26,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:42:26,002 INFO L87 Difference]: Start difference. First operand 193 states and 274 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:26,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:42:26,167 INFO L93 Difference]: Finished difference Result 539 states and 767 transitions. [2025-03-03 19:42:26,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:42:26,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2025-03-03 19:42:26,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:42:26,169 INFO L225 Difference]: With dead ends: 539 [2025-03-03 19:42:26,169 INFO L226 Difference]: Without dead ends: 349 [2025-03-03 19:42:26,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:42:26,170 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 102 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:42:26,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 478 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:42:26,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-03 19:42:26,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 261. [2025-03-03 19:42:26,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 183 states have (on average 1.284153005464481) internal successors, (235), 184 states have internal predecessors, (235), 70 states have call successors, (70), 7 states have call predecessors, (70), 7 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 19:42:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 375 transitions. [2025-03-03 19:42:26,195 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 375 transitions. Word has length 211 [2025-03-03 19:42:26,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:42:26,195 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 375 transitions. [2025-03-03 19:42:26,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 375 transitions. [2025-03-03 19:42:26,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-03 19:42:26,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:42:26,196 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:42:26,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 19:42:26,196 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:42:26,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:42:26,196 INFO L85 PathProgramCache]: Analyzing trace with hash 544233616, now seen corresponding path program 1 times [2025-03-03 19:42:26,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:42:26,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721961087] [2025-03-03 19:42:26,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:42:26,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:42:26,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-03 19:42:26,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-03 19:42:26,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:26,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:42:26,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:42:26,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:42:26,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721961087] [2025-03-03 19:42:26,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721961087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:42:26,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:42:26,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:42:26,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74980739] [2025-03-03 19:42:26,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:42:26,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:42:26,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:42:26,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:42:26,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:42:26,240 INFO L87 Difference]: Start difference. First operand 261 states and 375 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:26,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:42:26,324 INFO L93 Difference]: Finished difference Result 493 states and 697 transitions. [2025-03-03 19:42:26,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:42:26,325 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2025-03-03 19:42:26,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:42:26,327 INFO L225 Difference]: With dead ends: 493 [2025-03-03 19:42:26,327 INFO L226 Difference]: Without dead ends: 303 [2025-03-03 19:42:26,327 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 19:42:26,327 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 39 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:42:26,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 247 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:42:26,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-03 19:42:26,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 261. [2025-03-03 19:42:26,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 183 states have (on average 1.2622950819672132) internal successors, (231), 184 states have internal predecessors, (231), 70 states have call successors, (70), 7 states have call predecessors, (70), 7 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 19:42:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 371 transitions. [2025-03-03 19:42:26,350 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 371 transitions. Word has length 211 [2025-03-03 19:42:26,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:42:26,350 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 371 transitions. [2025-03-03 19:42:26,350 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:26,350 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 371 transitions. [2025-03-03 19:42:26,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-03 19:42:26,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:42:26,351 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:42:26,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 19:42:26,352 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:42:26,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:42:26,352 INFO L85 PathProgramCache]: Analyzing trace with hash 87389497, now seen corresponding path program 1 times [2025-03-03 19:42:26,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:42:26,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278824403] [2025-03-03 19:42:26,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:42:26,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:42:26,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 19:42:26,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 19:42:26,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:26,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:42:29,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:42:29,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:42:29,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278824403] [2025-03-03 19:42:29,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278824403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:42:29,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:42:29,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 19:42:29,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113137391] [2025-03-03 19:42:29,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:42:29,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:42:29,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:42:29,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:42:29,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:42:29,174 INFO L87 Difference]: Start difference. First operand 261 states and 371 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:30,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:42:30,340 INFO L93 Difference]: Finished difference Result 548 states and 765 transitions. [2025-03-03 19:42:30,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:42:30,341 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2025-03-03 19:42:30,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:42:30,344 INFO L225 Difference]: With dead ends: 548 [2025-03-03 19:42:30,344 INFO L226 Difference]: Without dead ends: 358 [2025-03-03 19:42:30,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:42:30,346 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 103 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:42:30,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 770 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 19:42:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-03 19:42:30,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 288. [2025-03-03 19:42:30,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 210 states have (on average 1.2857142857142858) internal successors, (270), 211 states have internal predecessors, (270), 70 states have call successors, (70), 7 states have call predecessors, (70), 7 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 19:42:30,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 410 transitions. [2025-03-03 19:42:30,372 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 410 transitions. Word has length 212 [2025-03-03 19:42:30,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:42:30,372 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 410 transitions. [2025-03-03 19:42:30,372 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:30,372 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 410 transitions. [2025-03-03 19:42:30,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-03 19:42:30,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:42:30,373 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:42:30,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 19:42:30,374 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:42:30,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:42:30,374 INFO L85 PathProgramCache]: Analyzing trace with hash 216472216, now seen corresponding path program 1 times [2025-03-03 19:42:30,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:42:30,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408167923] [2025-03-03 19:42:30,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:42:30,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:42:30,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 19:42:30,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 19:42:30,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:30,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:42:34,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:42:34,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:42:34,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408167923] [2025-03-03 19:42:34,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408167923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:42:34,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:42:34,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 19:42:34,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331273011] [2025-03-03 19:42:34,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:42:34,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 19:42:34,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:42:34,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 19:42:34,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:42:34,302 INFO L87 Difference]: Start difference. First operand 288 states and 410 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:42:35,813 INFO L93 Difference]: Finished difference Result 581 states and 810 transitions. [2025-03-03 19:42:35,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 19:42:35,814 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), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2025-03-03 19:42:35,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:42:35,816 INFO L225 Difference]: With dead ends: 581 [2025-03-03 19:42:35,816 INFO L226 Difference]: Without dead ends: 364 [2025-03-03 19:42:35,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-03-03 19:42:35,818 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 111 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:42:35,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1084 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 19:42:35,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-03 19:42:35,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 288. [2025-03-03 19:42:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 210 states have (on average 1.2857142857142858) internal successors, (270), 211 states have internal predecessors, (270), 70 states have call successors, (70), 7 states have call predecessors, (70), 7 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 19:42:35,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 410 transitions. [2025-03-03 19:42:35,850 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 410 transitions. Word has length 212 [2025-03-03 19:42:35,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:42:35,851 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 410 transitions. [2025-03-03 19:42:35,851 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), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 410 transitions. [2025-03-03 19:42:35,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-03 19:42:35,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:42:35,852 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:42:35,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 19:42:35,852 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:42:35,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:42:35,852 INFO L85 PathProgramCache]: Analyzing trace with hash 571642462, now seen corresponding path program 1 times [2025-03-03 19:42:35,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:42:35,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771483419] [2025-03-03 19:42:35,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:42:35,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:42:35,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 19:42:35,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 19:42:35,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:35,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:42:35,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2122110149] [2025-03-03 19:42:35,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:42:35,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:42:35,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:42:35,901 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 19:42:35,903 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 19:42:35,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 19:42:36,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 19:42:36,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:36,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:42:36,048 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:42:36,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 19:42:36,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 19:42:36,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:36,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:42:36,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:42:36,232 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:42:36,233 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:42:36,242 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 19:42:36,435 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,SelfDestructingSolverStorable16 [2025-03-03 19:42:36,437 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:42:36,533 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:42:36,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:42:36 BoogieIcfgContainer [2025-03-03 19:42:36,536 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:42:36,536 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:42:36,536 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:42:36,536 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:42:36,537 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:41:50" (3/4) ... [2025-03-03 19:42:36,538 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:42:36,539 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:42:36,539 INFO L158 Benchmark]: Toolchain (without parser) took 46825.76ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 106.7MB in the beginning and 495.8MB in the end (delta: -389.1MB). Peak memory consumption was 104.7MB. Max. memory is 16.1GB. [2025-03-03 19:42:36,539 INFO L158 Benchmark]: CDTParser took 1.03ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:42:36,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.54ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 91.8MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:42:36,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.34ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 88.1MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:42:36,540 INFO L158 Benchmark]: Boogie Preprocessor took 48.08ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 83.5MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:42:36,540 INFO L158 Benchmark]: IcfgBuilder took 471.99ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 54.0MB in the end (delta: 29.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 19:42:36,540 INFO L158 Benchmark]: TraceAbstraction took 45990.63ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 53.4MB in the beginning and 495.9MB in the end (delta: -442.5MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. [2025-03-03 19:42:36,541 INFO L158 Benchmark]: Witness Printer took 2.65ms. Allocated memory is still 637.5MB. Free memory was 495.9MB in the beginning and 495.8MB in the end (delta: 132.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:42:36,542 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.03ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.54ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 91.8MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.34ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 88.1MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.08ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 83.5MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 471.99ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 54.0MB in the end (delta: 29.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 45990.63ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 53.4MB in the beginning and 495.9MB in the end (delta: -442.5MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. * Witness Printer took 2.65ms. Allocated memory is still 637.5MB. Free memory was 495.9MB in the beginning and 495.8MB in the end (delta: 132.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 135. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] signed long int var_1_22 = 0; [L42] signed long int var_1_23 = 100; [L43] signed long int var_1_24 = 2; [L44] unsigned char var_1_25 = 1; [L45] unsigned char var_1_26 = 1; [L46] unsigned char var_1_27 = 0; [L47] unsigned char var_1_28 = 1; [L48] unsigned char var_1_29 = 1; [L49] float var_1_30 = 2.5; [L50] float var_1_31 = 15.25; [L51] unsigned long int var_1_32 = 256; [L52] unsigned long int var_1_33 = 100; [L53] unsigned short int last_1_var_1_15 = 128; VAL [isInitial=0, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L162] isInitial = 1 [L163] FCALL initially() [L164] COND TRUE 1 [L165] CALL updateLastVariables() [L155] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L165] RET updateLastVariables() [L166] CALL updateVariables() [L104] var_1_3 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L105] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L106] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L106] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L107] var_1_4 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L108] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L109] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L109] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L110] var_1_5 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L111] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L112] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L112] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L113] var_1_7 = __VERIFIER_nondet_long() [L114] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L114] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L115] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L115] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L116] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L116] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L117] var_1_8 = __VERIFIER_nondet_long() [L118] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L118] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L119] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L119] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L120] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L120] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L121] var_1_10 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L122] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L123] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L123] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L124] var_1_11 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L125] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L126] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L126] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L127] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L127] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L128] var_1_16 = __VERIFIER_nondet_long() [L129] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L129] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L130] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L130] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L131] var_1_17 = __VERIFIER_nondet_ushort() [L132] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L132] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L133] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L133] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L134] var_1_21 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L135] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L136] var_1_23 = __VERIFIER_nondet_long() [L137] CALL assume_abort_if_not(var_1_23 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L137] RET assume_abort_if_not(var_1_23 >= -2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L138] CALL assume_abort_if_not(var_1_23 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L138] RET assume_abort_if_not(var_1_23 <= 2147483646) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L139] var_1_25 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L140] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L141] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L141] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L142] var_1_26 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L143] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L144] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L144] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L145] var_1_29 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L146] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L147] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L147] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L148] var_1_31 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L149] RET assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L150] var_1_33 = __VERIFIER_nondet_ulong() [L151] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L151] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L152] CALL assume_abort_if_not(var_1_33 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L152] RET assume_abort_if_not(var_1_33 <= 4294967294) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L166] RET updateVariables() [L167] CALL step() [L57] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L58] COND FALSE !(var_1_25 && var_1_26) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L63] var_1_27 = 0 [L64] var_1_28 = var_1_29 [L65] var_1_30 = var_1_31 [L66] var_1_32 = var_1_33 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L67] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L67] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L72] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L74] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L74] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L75] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L76] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L80] signed long int stepLocal_1 = -4; [L81] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L82] COND FALSE !(stepLocal_1 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L87] var_1_18 = var_1_17 [L88] var_1_19 = 0 [L89] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L90] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L93] COND TRUE var_1_3 <= var_1_1 [L94] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=16, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L98] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=32768, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=16, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L99] COND TRUE (~ var_1_3) < stepLocal_2 [L100] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L167] RET step() [L168] CALL, EXPR property() [L158] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L158] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L158] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L158] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L158] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L158] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L158-L159] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L168] RET, EXPR property() [L168] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.8s, OverallIterations: 17, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2159 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2159 mSDsluCounter, 10242 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7892 mSDsCounter, 248 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5365 IncrementalHoareTripleChecker+Invalid, 5613 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 248 mSolverCounterUnsat, 2350 mSDtfsCounter, 5365 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=15, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 1353 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 27.4s InterpolantComputationTime, 3988 NumberOfCodeBlocks, 3988 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3547 ConstructedInterpolants, 0 QuantifiedInterpolants, 16280 SizeOfPredicates, 0 NumberOfNonLiveVariables, 476 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 35840/35904 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 19:42:36,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.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 e1856ea979a515682843ea065e3d41725035a700c47302906a364d3e5d5e532f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:42:38,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:42:38,386 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:42:38,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:42:38,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:42:38,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:42:38,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:42:38,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:42:38,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:42:38,417 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:42:38,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:42:38,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:42:38,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:42:38,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:42:38,417 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:42:38,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:42:38,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:42:38,418 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:42:38,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:42:38,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:42:38,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:42:38,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:42:38,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:42:38,418 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:42:38,418 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:42:38,418 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:42:38,418 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:42:38,419 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:42:38,419 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:42:38,419 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:42:38,419 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:42:38,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:42:38,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:42:38,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:42:38,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:42:38,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:42:38,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:42:38,419 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:42:38,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:42:38,419 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:42:38,419 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:42:38,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:42:38,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:42:38,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:42:38,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:42:38,419 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 -> e1856ea979a515682843ea065e3d41725035a700c47302906a364d3e5d5e532f [2025-03-03 19:42:38,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:42:38,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:42:38,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:42:38,647 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:42:38,647 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:42:38,648 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2025-03-03 19:42:39,823 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a636c946/b28ce5efa5984b5998ebeba52e8ee306/FLAGc9ecb8a34 [2025-03-03 19:42:40,005 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:42:40,006 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2025-03-03 19:42:40,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a636c946/b28ce5efa5984b5998ebeba52e8ee306/FLAGc9ecb8a34 [2025-03-03 19:42:40,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a636c946/b28ce5efa5984b5998ebeba52e8ee306 [2025-03-03 19:42:40,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:42:40,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:42:40,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:42:40,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:42:40,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:42:40,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:42:40" (1/1) ... [2025-03-03 19:42:40,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bdda539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:40, skipping insertion in model container [2025-03-03 19:42:40,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:42:40" (1/1) ... [2025-03-03 19:42:40,044 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:42:40,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i[915,928] [2025-03-03 19:42:40,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:42:40,188 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:42:40,198 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i[915,928] [2025-03-03 19:42:40,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:42:40,242 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:42:40,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:40 WrapperNode [2025-03-03 19:42:40,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:42:40,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:42:40,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:42:40,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:42:40,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:40" (1/1) ... [2025-03-03 19:42:40,256 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:40" (1/1) ... [2025-03-03 19:42:40,277 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2025-03-03 19:42:40,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:42:40,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:42:40,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:42:40,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:42:40,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:40" (1/1) ... [2025-03-03 19:42:40,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:40" (1/1) ... [2025-03-03 19:42:40,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:40" (1/1) ... [2025-03-03 19:42:40,308 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 19:42:40,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:40" (1/1) ... [2025-03-03 19:42:40,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:40" (1/1) ... [2025-03-03 19:42:40,320 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:40" (1/1) ... [2025-03-03 19:42:40,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:40" (1/1) ... [2025-03-03 19:42:40,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:40" (1/1) ... [2025-03-03 19:42:40,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:40" (1/1) ... [2025-03-03 19:42:40,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:42:40,332 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:42:40,333 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:42:40,333 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:42:40,335 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:40" (1/1) ... [2025-03-03 19:42:40,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:42:40,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:42:40,364 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 19:42:40,367 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 19:42:40,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:42:40,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:42:40,386 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:42:40,386 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:42:40,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:42:40,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:42:40,462 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:42:40,464 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:42:40,808 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 19:42:40,808 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:42:40,816 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:42:40,816 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:42:40,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:42:40 BoogieIcfgContainer [2025-03-03 19:42:40,817 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:42:40,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:42:40,818 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:42:40,821 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:42:40,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:42:40" (1/3) ... [2025-03-03 19:42:40,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595e4b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:42:40, skipping insertion in model container [2025-03-03 19:42:40,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:40" (2/3) ... [2025-03-03 19:42:40,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595e4b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:42:40, skipping insertion in model container [2025-03-03 19:42:40,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:42:40" (3/3) ... [2025-03-03 19:42:40,823 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2025-03-03 19:42:40,832 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:42:40,833 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-84.i that has 2 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:42:40,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:42:40,887 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;@4c11b65f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:42:40,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:42:40,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 19:42:40,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-03 19:42:40,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:42:40,903 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:42:40,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:42:40,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:42:40,907 INFO L85 PathProgramCache]: Analyzing trace with hash 192525605, now seen corresponding path program 1 times [2025-03-03 19:42:40,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:42:40,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297386677] [2025-03-03 19:42:40,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:42:40,915 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 19:42:40,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:42:40,917 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 19:42:40,918 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 19:42:41,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 19:42:41,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 19:42:41,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:41,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:42:41,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:42:41,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:42:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2025-03-03 19:42:41,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:42:41,215 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:42:41,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297386677] [2025-03-03 19:42:41,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297386677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:42:41,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:42:41,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:42:41,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785629053] [2025-03-03 19:42:41,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:42:41,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:42:41,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:42:41,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:42:41,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:42:41,239 INFO L87 Difference]: Start difference. First operand has 82 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 19:42:41,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:42:41,259 INFO L93 Difference]: Finished difference Result 158 states and 280 transitions. [2025-03-03 19:42:41,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:42:41,261 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 202 [2025-03-03 19:42:41,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:42:41,265 INFO L225 Difference]: With dead ends: 158 [2025-03-03 19:42:41,265 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 19:42:41,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 201 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 19:42:41,269 INFO L435 NwaCegarLoop]: 121 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, 121 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 19:42:41,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:42:41,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 19:42:41,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-03 19:42:41,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 19:42:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2025-03-03 19:42:41,310 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 202 [2025-03-03 19:42:41,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:42:41,310 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2025-03-03 19:42:41,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 19:42:41,312 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2025-03-03 19:42:41,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-03 19:42:41,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:42:41,316 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:42:41,325 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 19:42:41,516 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 19:42:41,517 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:42:41,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:42:41,518 INFO L85 PathProgramCache]: Analyzing trace with hash 712762790, now seen corresponding path program 1 times [2025-03-03 19:42:41,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:42:41,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549361319] [2025-03-03 19:42:41,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:42:41,519 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 19:42:41,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:42:41,520 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 19:42:41,522 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 19:42:41,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 19:42:41,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 19:42:41,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:41,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:42:41,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 19:42:41,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:42:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:42:41,764 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:42:41,765 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:42:41,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549361319] [2025-03-03 19:42:41,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549361319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:42:41,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:42:41,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:42:41,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261171655] [2025-03-03 19:42:41,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:42:41,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:42:41,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:42:41,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:42:41,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:42:41,770 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:42:41,860 INFO L93 Difference]: Finished difference Result 155 states and 239 transitions. [2025-03-03 19:42:41,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:42:41,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 202 [2025-03-03 19:42:41,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:42:41,871 INFO L225 Difference]: With dead ends: 155 [2025-03-03 19:42:41,872 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 19:42:41,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 200 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 19:42:41,873 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 118 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:42:41,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 118 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:42:41,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 19:42:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-03 19:42:41,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 19:42:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 120 transitions. [2025-03-03 19:42:41,883 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 120 transitions. Word has length 202 [2025-03-03 19:42:41,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:42:41,884 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 120 transitions. [2025-03-03 19:42:41,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:42:41,884 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 120 transitions. [2025-03-03 19:42:41,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-03 19:42:41,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:42:41,886 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:42:41,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 19:42:42,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:42:42,087 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:42:42,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:42:42,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1839394171, now seen corresponding path program 1 times [2025-03-03 19:42:42,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:42:42,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958165403] [2025-03-03 19:42:42,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:42:42,088 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 19:42:42,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:42:42,090 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:42:42,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 19:42:42,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 19:42:42,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 19:42:42,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:42,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:42:42,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 19:42:42,279 INFO L279 TraceCheckSpWp]: Computing forward predicates...