./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_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_fillercodestructure_filler-ps-ci_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 6871ab96a9f52a49c873d6506e9b30443151052bffac3c098c041f36f26e7383 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:44:11,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:44:11,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:44:11,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:44:11,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:44:11,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:44:11,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:44:11,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:44:11,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:44:11,567 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:44:11,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:44:11,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:44:11,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:44:11,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:44:11,568 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:44:11,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:44:11,569 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:44:11,569 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:44:11,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:44:11,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:44:11,570 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 -> 6871ab96a9f52a49c873d6506e9b30443151052bffac3c098c041f36f26e7383 [2025-03-03 21:44:11,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:44:11,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:44:11,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:44:11,832 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:44:11,832 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:44:11,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2025-03-03 21:44:13,023 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcfa20e4c/634e1fbf50bd4eb2bed8a35d4fcbf5fe/FLAGb59e561e7 [2025-03-03 21:44:13,299 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:44:13,300 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2025-03-03 21:44:13,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcfa20e4c/634e1fbf50bd4eb2bed8a35d4fcbf5fe/FLAGb59e561e7 [2025-03-03 21:44:13,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcfa20e4c/634e1fbf50bd4eb2bed8a35d4fcbf5fe [2025-03-03 21:44:13,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:44:13,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:44:13,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:44:13,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:44:13,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:44:13,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:44:13" (1/1) ... [2025-03-03 21:44:13,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294e1bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:13, skipping insertion in model container [2025-03-03 21:44:13,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:44:13" (1/1) ... [2025-03-03 21:44:13,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:44:13,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i[919,932] [2025-03-03 21:44:13,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:44:13,810 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:44:13,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_fillercodestructure_filler-ps-ci_file-84.i[919,932] [2025-03-03 21:44:13,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:44:13,879 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:44:13,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:13 WrapperNode [2025-03-03 21:44:13,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:44:13,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:44:13,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:44:13,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:44:13,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:13" (1/1) ... [2025-03-03 21:44:13,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:13" (1/1) ... [2025-03-03 21:44:13,935 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2025-03-03 21:44:13,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:44:13,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:44:13,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:44:13,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:44:13,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:13" (1/1) ... [2025-03-03 21:44:13,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:13" (1/1) ... [2025-03-03 21:44:13,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:13" (1/1) ... [2025-03-03 21:44:13,969 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:44:13,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:13" (1/1) ... [2025-03-03 21:44:13,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:13" (1/1) ... [2025-03-03 21:44:13,982 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:13" (1/1) ... [2025-03-03 21:44:13,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:13" (1/1) ... [2025-03-03 21:44:13,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:13" (1/1) ... [2025-03-03 21:44:13,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:13" (1/1) ... [2025-03-03 21:44:14,003 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:44:14,005 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:44:14,005 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:44:14,005 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:44:14,006 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:13" (1/1) ... [2025-03-03 21:44:14,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:44:14,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:44:14,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:44:14,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:44:14,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:44:14,053 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:44:14,053 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:44:14,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:44:14,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:44:14,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:44:14,121 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:44:14,123 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:44:14,523 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L189: havoc property_#t~bitwise22#1;havoc property_#t~short23#1;havoc property_#t~bitwise24#1;havoc property_#t~short25#1; [2025-03-03 21:44:14,562 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-03 21:44:14,563 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:44:14,582 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:44:14,583 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:44:14,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:14 BoogieIcfgContainer [2025-03-03 21:44:14,584 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:44:14,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:44:14,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:44:14,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:44:14,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:44:13" (1/3) ... [2025-03-03 21:44:14,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eeb942d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:44:14, skipping insertion in model container [2025-03-03 21:44:14,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:13" (2/3) ... [2025-03-03 21:44:14,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eeb942d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:44:14, skipping insertion in model container [2025-03-03 21:44:14,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:14" (3/3) ... [2025-03-03 21:44:14,592 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2025-03-03 21:44:14,602 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:44:14,604 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:44:14,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:44:14,653 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;@4f97738, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:44:14,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:44:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 75 states have internal predecessors, (108), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 21:44:14,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 21:44:14,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:14,668 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:14,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:14,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:14,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1177238325, now seen corresponding path program 1 times [2025-03-03 21:44:14,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:14,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630246128] [2025-03-03 21:44:14,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:14,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:14,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 21:44:14,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 21:44:14,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:14,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:14,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-03 21:44:14,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:14,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630246128] [2025-03-03 21:44:14,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630246128] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:44:14,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952924400] [2025-03-03 21:44:14,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:14,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:44:14,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:44:14,965 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:44:14,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:44:15,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 21:44:15,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 21:44:15,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:15,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:15,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:44:15,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:44:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-03 21:44:15,150 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:44:15,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952924400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:15,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:44:15,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:44:15,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285157107] [2025-03-03 21:44:15,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:15,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:44:15,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:15,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:44:15,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:44:15,175 INFO L87 Difference]: Start difference. First operand has 109 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 75 states have internal predecessors, (108), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 21:44:15,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:15,201 INFO L93 Difference]: Finished difference Result 212 states and 371 transitions. [2025-03-03 21:44:15,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:44:15,203 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 209 [2025-03-03 21:44:15,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:15,211 INFO L225 Difference]: With dead ends: 212 [2025-03-03 21:44:15,211 INFO L226 Difference]: Without dead ends: 106 [2025-03-03 21:44:15,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:44:15,217 INFO L435 NwaCegarLoop]: 163 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, 163 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 21:44:15,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:44:15,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-03 21:44:15,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-03 21:44:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 21:44:15,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 167 transitions. [2025-03-03 21:44:15,258 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 167 transitions. Word has length 209 [2025-03-03 21:44:15,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:15,259 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 167 transitions. [2025-03-03 21:44:15,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 21:44:15,260 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 167 transitions. [2025-03-03 21:44:15,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 21:44:15,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:15,262 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:15,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 21:44:15,463 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 21:44:15,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:15,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:15,464 INFO L85 PathProgramCache]: Analyzing trace with hash -126249261, now seen corresponding path program 1 times [2025-03-03 21:44:15,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:15,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029165067] [2025-03-03 21:44:15,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:15,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:15,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 21:44:15,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 21:44:15,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:15,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:15,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 21:44:15,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:15,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029165067] [2025-03-03 21:44:15,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029165067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:15,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:15,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:44:15,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010649249] [2025-03-03 21:44:15,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:15,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:44:15,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:15,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:44:15,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:44:15,719 INFO L87 Difference]: Start difference. First operand 106 states and 167 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:15,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:15,764 INFO L93 Difference]: Finished difference Result 206 states and 325 transitions. [2025-03-03 21:44:15,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:44:15,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 209 [2025-03-03 21:44:15,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:15,767 INFO L225 Difference]: With dead ends: 206 [2025-03-03 21:44:15,767 INFO L226 Difference]: Without dead ends: 103 [2025-03-03 21:44:15,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:44:15,769 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 148 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:15,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 147 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:44:15,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-03 21:44:15,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-03 21:44:15,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 21:44:15,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2025-03-03 21:44:15,783 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 209 [2025-03-03 21:44:15,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:15,784 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 157 transitions. [2025-03-03 21:44:15,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:15,785 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2025-03-03 21:44:15,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 21:44:15,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:15,787 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:15,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:44:15,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:15,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:15,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2143066550, now seen corresponding path program 1 times [2025-03-03 21:44:15,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:15,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514263907] [2025-03-03 21:44:15,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:15,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:15,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 21:44:15,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 21:44:15,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:15,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 21:44:18,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:18,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514263907] [2025-03-03 21:44:18,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514263907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:18,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:18,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:44:18,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642798018] [2025-03-03 21:44:18,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:18,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:44:18,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:18,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:44:18,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:44:18,432 INFO L87 Difference]: Start difference. First operand 103 states and 157 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:19,652 INFO L93 Difference]: Finished difference Result 238 states and 357 transitions. [2025-03-03 21:44:19,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:44:19,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 210 [2025-03-03 21:44:19,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:19,658 INFO L225 Difference]: With dead ends: 238 [2025-03-03 21:44:19,660 INFO L226 Difference]: Without dead ends: 138 [2025-03-03 21:44:19,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:44:19,663 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 41 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:19,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 634 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 21:44:19,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-03 21:44:19,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2025-03-03 21:44:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 97 states have internal predecessors, (128), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 21:44:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 200 transitions. [2025-03-03 21:44:19,683 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 200 transitions. Word has length 210 [2025-03-03 21:44:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:19,685 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 200 transitions. [2025-03-03 21:44:19,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:19,685 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 200 transitions. [2025-03-03 21:44:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-03 21:44:19,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:19,687 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:19,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:44:19,687 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:19,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:19,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1840123910, now seen corresponding path program 1 times [2025-03-03 21:44:19,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:19,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131033937] [2025-03-03 21:44:19,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:19,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:19,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-03 21:44:19,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-03 21:44:19,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:19,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 21:44:22,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:22,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131033937] [2025-03-03 21:44:22,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131033937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:22,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:22,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 21:44:22,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833228679] [2025-03-03 21:44:22,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:22,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:44:22,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:22,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:44:22,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:44:22,306 INFO L87 Difference]: Start difference. First operand 135 states and 200 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:23,494 INFO L93 Difference]: Finished difference Result 299 states and 438 transitions. [2025-03-03 21:44:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 21:44:23,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2025-03-03 21:44:23,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:23,497 INFO L225 Difference]: With dead ends: 299 [2025-03-03 21:44:23,497 INFO L226 Difference]: Without dead ends: 167 [2025-03-03 21:44:23,497 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 21:44:23,498 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 34 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:23,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 822 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 21:44:23,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-03 21:44:23,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2025-03-03 21:44:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 124 states have internal predecessors, (162), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 21:44:23,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 238 transitions. [2025-03-03 21:44:23,511 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 238 transitions. Word has length 211 [2025-03-03 21:44:23,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:23,512 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 238 transitions. [2025-03-03 21:44:23,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 238 transitions. [2025-03-03 21:44:23,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-03 21:44:23,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:23,514 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:23,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:44:23,514 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:23,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:23,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1334565285, now seen corresponding path program 1 times [2025-03-03 21:44:23,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:23,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100229747] [2025-03-03 21:44:23,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:23,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:23,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-03 21:44:23,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-03 21:44:23,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:23,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:25,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 21:44:25,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:25,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100229747] [2025-03-03 21:44:25,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100229747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:25,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:25,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 21:44:25,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738280578] [2025-03-03 21:44:25,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:25,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:44:25,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:25,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:44:25,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:44:25,604 INFO L87 Difference]: Start difference. First operand 164 states and 238 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:26,370 INFO L93 Difference]: Finished difference Result 332 states and 478 transitions. [2025-03-03 21:44:26,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 21:44:26,371 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2025-03-03 21:44:26,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:26,372 INFO L225 Difference]: With dead ends: 332 [2025-03-03 21:44:26,373 INFO L226 Difference]: Without dead ends: 171 [2025-03-03 21:44:26,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:44:26,374 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 60 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:26,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 727 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 21:44:26,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-03 21:44:26,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 139. [2025-03-03 21:44:26,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 100 states have internal predecessors, (130), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 21:44:26,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2025-03-03 21:44:26,393 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 211 [2025-03-03 21:44:26,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:26,394 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2025-03-03 21:44:26,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:26,395 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2025-03-03 21:44:26,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-03 21:44:26,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:26,398 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:26,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:44:26,398 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:26,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:26,401 INFO L85 PathProgramCache]: Analyzing trace with hash 873021256, now seen corresponding path program 1 times [2025-03-03 21:44:26,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:26,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558866652] [2025-03-03 21:44:26,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:26,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:26,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 21:44:26,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 21:44:26,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:26,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 21:44:28,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:28,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558866652] [2025-03-03 21:44:28,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558866652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:28,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:28,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 21:44:28,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552855142] [2025-03-03 21:44:28,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:28,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:44:28,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:28,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:44:28,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:44:28,190 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:28,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:28,821 INFO L93 Difference]: Finished difference Result 412 states and 585 transitions. [2025-03-03 21:44:28,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:44:28,823 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2025-03-03 21:44:28,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:28,824 INFO L225 Difference]: With dead ends: 412 [2025-03-03 21:44:28,824 INFO L226 Difference]: Without dead ends: 276 [2025-03-03 21:44:28,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:44:28,827 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 99 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:28,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 827 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:44:28,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-03 21:44:28,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 170. [2025-03-03 21:44:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 130 states have (on average 1.3307692307692307) internal successors, (173), 131 states have internal predecessors, (173), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 21:44:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 245 transitions. [2025-03-03 21:44:28,842 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 245 transitions. Word has length 212 [2025-03-03 21:44:28,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:28,843 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 245 transitions. [2025-03-03 21:44:28,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:28,843 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 245 transitions. [2025-03-03 21:44:28,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-03 21:44:28,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:28,845 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:28,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:44:28,845 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:28,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:28,846 INFO L85 PathProgramCache]: Analyzing trace with hash -923930103, now seen corresponding path program 1 times [2025-03-03 21:44:28,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:28,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032111313] [2025-03-03 21:44:28,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:28,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:28,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 21:44:28,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 21:44:28,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:28,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 21:44:30,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:30,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032111313] [2025-03-03 21:44:30,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032111313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:30,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:30,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 21:44:30,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056862994] [2025-03-03 21:44:30,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:30,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:44:30,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:30,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:44:30,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:44:30,842 INFO L87 Difference]: Start difference. First operand 170 states and 245 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:31,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:31,583 INFO L93 Difference]: Finished difference Result 419 states and 595 transitions. [2025-03-03 21:44:31,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 21:44:31,584 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2025-03-03 21:44:31,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:31,586 INFO L225 Difference]: With dead ends: 419 [2025-03-03 21:44:31,586 INFO L226 Difference]: Without dead ends: 252 [2025-03-03 21:44:31,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:44:31,587 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 100 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:31,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 919 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:44:31,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-03 21:44:31,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 170. [2025-03-03 21:44:31,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 130 states have (on average 1.3307692307692307) internal successors, (173), 131 states have internal predecessors, (173), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 21:44:31,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 245 transitions. [2025-03-03 21:44:31,600 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 245 transitions. Word has length 212 [2025-03-03 21:44:31,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:31,601 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 245 transitions. [2025-03-03 21:44:31,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:31,601 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 245 transitions. [2025-03-03 21:44:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-03 21:44:31,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:31,604 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:31,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:44:31,605 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:31,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:31,605 INFO L85 PathProgramCache]: Analyzing trace with hash 579618249, now seen corresponding path program 1 times [2025-03-03 21:44:31,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:31,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517748134] [2025-03-03 21:44:31,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:31,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:31,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 21:44:31,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 21:44:31,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:31,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:34,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 21:44:34,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:34,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517748134] [2025-03-03 21:44:34,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517748134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:34,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:34,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 21:44:34,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455296508] [2025-03-03 21:44:34,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:34,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:44:34,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:34,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:44:34,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:44:34,009 INFO L87 Difference]: Start difference. First operand 170 states and 245 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:35,446 INFO L93 Difference]: Finished difference Result 450 states and 635 transitions. [2025-03-03 21:44:35,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 21:44:35,447 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2025-03-03 21:44:35,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:35,449 INFO L225 Difference]: With dead ends: 450 [2025-03-03 21:44:35,449 INFO L226 Difference]: Without dead ends: 283 [2025-03-03 21:44:35,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:44:35,451 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 110 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:35,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1013 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 21:44:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-03 21:44:35,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 174. [2025-03-03 21:44:35,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 134 states have (on average 1.335820895522388) internal successors, (179), 135 states have internal predecessors, (179), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 21:44:35,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 251 transitions. [2025-03-03 21:44:35,462 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 251 transitions. Word has length 212 [2025-03-03 21:44:35,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:35,464 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 251 transitions. [2025-03-03 21:44:35,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 251 transitions. [2025-03-03 21:44:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-03 21:44:35,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:35,465 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:35,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 21:44:35,467 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:35,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:35,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1217333110, now seen corresponding path program 1 times [2025-03-03 21:44:35,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:35,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792586950] [2025-03-03 21:44:35,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:35,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:35,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 21:44:35,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 21:44:35,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:35,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 21:44:36,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:36,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792586950] [2025-03-03 21:44:36,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792586950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:36,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:36,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 21:44:36,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989577886] [2025-03-03 21:44:36,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:36,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:44:36,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:36,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:44:36,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:44:36,754 INFO L87 Difference]: Start difference. First operand 174 states and 251 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:37,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:37,397 INFO L93 Difference]: Finished difference Result 429 states and 607 transitions. [2025-03-03 21:44:37,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 21:44:37,397 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2025-03-03 21:44:37,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:37,399 INFO L225 Difference]: With dead ends: 429 [2025-03-03 21:44:37,399 INFO L226 Difference]: Without dead ends: 258 [2025-03-03 21:44:37,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:44:37,400 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 135 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:37,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 664 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:44:37,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-03 21:44:37,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 170. [2025-03-03 21:44:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 130 states have (on average 1.3307692307692307) internal successors, (173), 131 states have internal predecessors, (173), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 21:44:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 245 transitions. [2025-03-03 21:44:37,415 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 245 transitions. Word has length 212 [2025-03-03 21:44:37,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:37,416 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 245 transitions. [2025-03-03 21:44:37,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:37,416 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 245 transitions. [2025-03-03 21:44:37,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-03 21:44:37,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:37,418 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:37,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 21:44:37,419 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:37,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:37,419 INFO L85 PathProgramCache]: Analyzing trace with hash -261730129, now seen corresponding path program 1 times [2025-03-03 21:44:37,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:37,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993652624] [2025-03-03 21:44:37,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:37,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:37,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-03 21:44:37,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-03 21:44:37,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:37,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:37,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 21:44:37,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:37,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993652624] [2025-03-03 21:44:37,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993652624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:37,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:37,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:44:37,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12945835] [2025-03-03 21:44:37,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:37,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:44:37,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:37,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:44:37,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:44:37,486 INFO L87 Difference]: Start difference. First operand 170 states and 245 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:37,561 INFO L93 Difference]: Finished difference Result 404 states and 575 transitions. [2025-03-03 21:44:37,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:44:37,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2025-03-03 21:44:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:37,563 INFO L225 Difference]: With dead ends: 404 [2025-03-03 21:44:37,564 INFO L226 Difference]: Without dead ends: 237 [2025-03-03 21:44:37,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:44:37,564 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 45 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:37,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 277 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:44:37,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-03 21:44:37,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 214. [2025-03-03 21:44:37,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 171 states have (on average 1.3333333333333333) internal successors, (228), 173 states have internal predecessors, (228), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 21:44:37,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 304 transitions. [2025-03-03 21:44:37,581 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 304 transitions. Word has length 213 [2025-03-03 21:44:37,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:37,581 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 304 transitions. [2025-03-03 21:44:37,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:37,581 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 304 transitions. [2025-03-03 21:44:37,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-03 21:44:37,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:37,583 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:37,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 21:44:37,583 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:37,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:37,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1005436406, now seen corresponding path program 1 times [2025-03-03 21:44:37,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:37,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186781582] [2025-03-03 21:44:37,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:37,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:37,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-03 21:44:37,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-03 21:44:37,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:37,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 21:44:37,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:37,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186781582] [2025-03-03 21:44:37,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186781582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:37,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:37,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:44:37,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996523904] [2025-03-03 21:44:37,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:37,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:44:37,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:37,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:44:37,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:44:37,725 INFO L87 Difference]: Start difference. First operand 214 states and 304 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:37,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:37,885 INFO L93 Difference]: Finished difference Result 596 states and 848 transitions. [2025-03-03 21:44:37,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:44:37,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2025-03-03 21:44:37,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:37,888 INFO L225 Difference]: With dead ends: 596 [2025-03-03 21:44:37,888 INFO L226 Difference]: Without dead ends: 385 [2025-03-03 21:44:37,888 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 21:44:37,889 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 117 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:37,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 510 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:44:37,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-03 21:44:37,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 288. [2025-03-03 21:44:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 210 states have (on average 1.3047619047619048) internal successors, (274), 212 states have internal predecessors, (274), 70 states have call successors, (70), 7 states have call predecessors, (70), 7 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 21:44:37,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 414 transitions. [2025-03-03 21:44:37,917 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 414 transitions. Word has length 213 [2025-03-03 21:44:37,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:37,917 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 414 transitions. [2025-03-03 21:44:37,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:37,918 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 414 transitions. [2025-03-03 21:44:37,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-03 21:44:37,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:37,919 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:37,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 21:44:37,919 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:37,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:37,919 INFO L85 PathProgramCache]: Analyzing trace with hash 961706664, now seen corresponding path program 1 times [2025-03-03 21:44:37,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:37,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501734883] [2025-03-03 21:44:37,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:37,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:37,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-03 21:44:37,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-03 21:44:37,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:37,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:37,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 21:44:37,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:37,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501734883] [2025-03-03 21:44:37,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501734883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:37,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:37,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:44:37,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276659619] [2025-03-03 21:44:37,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:37,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:44:37,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:37,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:44:37,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:44:37,984 INFO L87 Difference]: Start difference. First operand 288 states and 414 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:38,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:38,063 INFO L93 Difference]: Finished difference Result 526 states and 745 transitions. [2025-03-03 21:44:38,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:44:38,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2025-03-03 21:44:38,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:38,065 INFO L225 Difference]: With dead ends: 526 [2025-03-03 21:44:38,065 INFO L226 Difference]: Without dead ends: 315 [2025-03-03 21:44:38,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:44:38,066 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 39 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:38,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 262 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:44:38,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-03 21:44:38,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 273. [2025-03-03 21:44:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 197 states have (on average 1.284263959390863) internal successors, (253), 198 states have internal predecessors, (253), 68 states have call successors, (68), 7 states have call predecessors, (68), 7 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 21:44:38,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 389 transitions. [2025-03-03 21:44:38,084 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 389 transitions. Word has length 213 [2025-03-03 21:44:38,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:38,084 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 389 transitions. [2025-03-03 21:44:38,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:38,084 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 389 transitions. [2025-03-03 21:44:38,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 21:44:38,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:38,085 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:38,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 21:44:38,086 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:38,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:38,086 INFO L85 PathProgramCache]: Analyzing trace with hash 144152097, now seen corresponding path program 1 times [2025-03-03 21:44:38,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:38,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422173166] [2025-03-03 21:44:38,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:38,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:38,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 21:44:38,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 21:44:38,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:38,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 21:44:39,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:39,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422173166] [2025-03-03 21:44:39,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422173166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:39,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:39,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 21:44:39,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479087446] [2025-03-03 21:44:39,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:39,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:44:39,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:39,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:44:39,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:44:39,444 INFO L87 Difference]: Start difference. First operand 273 states and 389 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:40,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:40,465 INFO L93 Difference]: Finished difference Result 606 states and 843 transitions. [2025-03-03 21:44:40,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:44:40,468 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2025-03-03 21:44:40,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:40,471 INFO L225 Difference]: With dead ends: 606 [2025-03-03 21:44:40,471 INFO L226 Difference]: Without dead ends: 410 [2025-03-03 21:44:40,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:44:40,472 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 93 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:40,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 890 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 21:44:40,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-03 21:44:40,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 300. [2025-03-03 21:44:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 225 states have internal predecessors, (292), 68 states have call successors, (68), 7 states have call predecessors, (68), 7 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 21:44:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 428 transitions. [2025-03-03 21:44:40,495 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 428 transitions. Word has length 214 [2025-03-03 21:44:40,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:40,496 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 428 transitions. [2025-03-03 21:44:40,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:40,496 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 428 transitions. [2025-03-03 21:44:40,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 21:44:40,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:40,497 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:40,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 21:44:40,498 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:40,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:40,498 INFO L85 PathProgramCache]: Analyzing trace with hash 273234816, now seen corresponding path program 1 times [2025-03-03 21:44:40,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:40,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705335369] [2025-03-03 21:44:40,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:40,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:40,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 21:44:40,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 21:44:40,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:40,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:42,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 21:44:42,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:42,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705335369] [2025-03-03 21:44:42,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705335369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:42,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:42,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 21:44:42,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527725101] [2025-03-03 21:44:42,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:42,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:44:42,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:42,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:44:42,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:44:42,425 INFO L87 Difference]: Start difference. First operand 300 states and 428 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:43,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:43,615 INFO L93 Difference]: Finished difference Result 611 states and 853 transitions. [2025-03-03 21:44:43,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 21:44:43,616 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2025-03-03 21:44:43,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:43,618 INFO L225 Difference]: With dead ends: 611 [2025-03-03 21:44:43,618 INFO L226 Difference]: Without dead ends: 388 [2025-03-03 21:44:43,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:44:43,619 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 118 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:43,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1150 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 21:44:43,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-03 21:44:43,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 300. [2025-03-03 21:44:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 225 states have internal predecessors, (292), 68 states have call successors, (68), 7 states have call predecessors, (68), 7 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 21:44:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 428 transitions. [2025-03-03 21:44:43,640 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 428 transitions. Word has length 214 [2025-03-03 21:44:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:43,640 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 428 transitions. [2025-03-03 21:44:43,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 428 transitions. [2025-03-03 21:44:43,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 21:44:43,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:43,642 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:43,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 21:44:43,642 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:43,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:43,642 INFO L85 PathProgramCache]: Analyzing trace with hash -361406528, now seen corresponding path program 1 times [2025-03-03 21:44:43,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:43,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786959073] [2025-03-03 21:44:43,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:43,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:43,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 21:44:43,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 21:44:43,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:43,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 21:44:44,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:44,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786959073] [2025-03-03 21:44:44,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786959073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:44,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:44,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 21:44:44,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503891809] [2025-03-03 21:44:44,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:44,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:44:44,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:44,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:44:44,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:44:44,701 INFO L87 Difference]: Start difference. First operand 300 states and 428 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:45,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:45,501 INFO L93 Difference]: Finished difference Result 639 states and 888 transitions. [2025-03-03 21:44:45,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 21:44:45,502 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2025-03-03 21:44:45,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:45,505 INFO L225 Difference]: With dead ends: 639 [2025-03-03 21:44:45,505 INFO L226 Difference]: Without dead ends: 416 [2025-03-03 21:44:45,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:44:45,506 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 104 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:45,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 923 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:44:45,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-03 21:44:45,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 304. [2025-03-03 21:44:45,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 228 states have (on average 1.3070175438596492) internal successors, (298), 229 states have internal predecessors, (298), 68 states have call successors, (68), 7 states have call predecessors, (68), 7 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 21:44:45,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 434 transitions. [2025-03-03 21:44:45,525 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 434 transitions. Word has length 214 [2025-03-03 21:44:45,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:45,525 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 434 transitions. [2025-03-03 21:44:45,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:45,525 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 434 transitions. [2025-03-03 21:44:45,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 21:44:45,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:45,526 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:45,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 21:44:45,527 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:45,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:45,527 INFO L85 PathProgramCache]: Analyzing trace with hash -232323809, now seen corresponding path program 1 times [2025-03-03 21:44:45,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:45,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324454590] [2025-03-03 21:44:45,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:45,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:45,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 21:44:45,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 21:44:45,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:45,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 21:44:47,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:47,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324454590] [2025-03-03 21:44:47,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324454590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:47,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:47,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 21:44:47,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583891914] [2025-03-03 21:44:47,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:47,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:44:47,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:47,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:44:47,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:44:47,563 INFO L87 Difference]: Start difference. First operand 304 states and 434 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:48,575 INFO L93 Difference]: Finished difference Result 607 states and 849 transitions. [2025-03-03 21:44:48,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 21:44:48,579 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2025-03-03 21:44:48,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:48,581 INFO L225 Difference]: With dead ends: 607 [2025-03-03 21:44:48,581 INFO L226 Difference]: Without dead ends: 380 [2025-03-03 21:44:48,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:44:48,582 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 116 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:48,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1027 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 21:44:48,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-03 21:44:48,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 300. [2025-03-03 21:44:48,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 225 states have internal predecessors, (292), 68 states have call successors, (68), 7 states have call predecessors, (68), 7 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 21:44:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 428 transitions. [2025-03-03 21:44:48,604 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 428 transitions. Word has length 214 [2025-03-03 21:44:48,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:48,604 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 428 transitions. [2025-03-03 21:44:48,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:44:48,605 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 428 transitions. [2025-03-03 21:44:48,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 21:44:48,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:48,606 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:48,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 21:44:48,606 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:48,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:48,606 INFO L85 PathProgramCache]: Analyzing trace with hash 628405062, now seen corresponding path program 1 times [2025-03-03 21:44:48,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:48,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726952492] [2025-03-03 21:44:48,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:48,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:48,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 21:44:48,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 21:44:48,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:48,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 78 proven. 102 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2025-03-03 21:44:49,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:49,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726952492] [2025-03-03 21:44:49,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726952492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:44:49,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324257452] [2025-03-03 21:44:49,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:49,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:44:49,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:44:49,164 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:44:49,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 21:44:49,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 21:44:49,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 21:44:49,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:49,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:49,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 21:44:49,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:44:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1120 proven. 102 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2025-03-03 21:44:50,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:44:52,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324257452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:44:52,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:44:52,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2025-03-03 21:44:52,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389059310] [2025-03-03 21:44:52,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:44:52,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 21:44:52,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:52,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 21:44:52,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-03-03 21:44:52,326 INFO L87 Difference]: Start difference. First operand 300 states and 428 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 6 states have call successors, (64), 4 states have call predecessors, (64), 7 states have return successors, (64), 6 states have call predecessors, (64), 6 states have call successors, (64) [2025-03-03 21:44:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:52,738 INFO L93 Difference]: Finished difference Result 559 states and 791 transitions. [2025-03-03 21:44:52,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 21:44:52,739 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 6 states have call successors, (64), 4 states have call predecessors, (64), 7 states have return successors, (64), 6 states have call predecessors, (64), 6 states have call successors, (64) Word has length 214 [2025-03-03 21:44:52,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:52,741 INFO L225 Difference]: With dead ends: 559 [2025-03-03 21:44:52,741 INFO L226 Difference]: Without dead ends: 334 [2025-03-03 21:44:52,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2025-03-03 21:44:52,742 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 45 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:52,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 559 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:44:52,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-03 21:44:52,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 308. [2025-03-03 21:44:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 230 states have (on average 1.291304347826087) internal successors, (297), 231 states have internal predecessors, (297), 68 states have call successors, (68), 9 states have call predecessors, (68), 9 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 21:44:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 433 transitions. [2025-03-03 21:44:52,761 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 433 transitions. Word has length 214 [2025-03-03 21:44:52,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:52,762 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 433 transitions. [2025-03-03 21:44:52,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 6 states have call successors, (64), 4 states have call predecessors, (64), 7 states have return successors, (64), 6 states have call predecessors, (64), 6 states have call successors, (64) [2025-03-03 21:44:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 433 transitions. [2025-03-03 21:44:52,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 21:44:52,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:52,763 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:52,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 21:44:52,963 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 21:44:52,964 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:52,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:52,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1448804281, now seen corresponding path program 1 times [2025-03-03 21:44:52,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:52,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116514048] [2025-03-03 21:44:52,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:52,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:52,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 21:44:53,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 21:44:53,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:53,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:44:53,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [481023605] [2025-03-03 21:44:53,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:53,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:44:53,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:44:53,036 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:44:53,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 21:44:53,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 21:44:53,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 21:44:53,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:53,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:53,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 21:44:53,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:44:53,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1011 proven. 51 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2025-03-03 21:44:53,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:44:53,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-03 21:44:53,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:53,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116514048] [2025-03-03 21:44:53,692 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 21:44:53,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481023605] [2025-03-03 21:44:53,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481023605] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:44:53,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:44:53,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2025-03-03 21:44:53,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562039227] [2025-03-03 21:44:53,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:44:53,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 21:44:53,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:53,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 21:44:53,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:44:53,693 INFO L87 Difference]: Start difference. First operand 308 states and 433 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-03 21:44:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:56,979 INFO L93 Difference]: Finished difference Result 1395 states and 1869 transitions. [2025-03-03 21:44:56,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 21:44:56,980 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 214 [2025-03-03 21:44:56,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:56,984 INFO L225 Difference]: With dead ends: 1395 [2025-03-03 21:44:56,984 INFO L226 Difference]: Without dead ends: 1172 [2025-03-03 21:44:56,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 420 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=370, Invalid=1036, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 21:44:56,986 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 736 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:56,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 734 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 21:44:56,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-03-03 21:44:57,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 532. [2025-03-03 21:44:57,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 452 states have (on average 1.3075221238938053) internal successors, (591), 453 states have internal predecessors, (591), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 21:44:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 727 transitions. [2025-03-03 21:44:57,016 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 727 transitions. Word has length 214 [2025-03-03 21:44:57,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:57,017 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 727 transitions. [2025-03-03 21:44:57,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-03 21:44:57,017 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 727 transitions. [2025-03-03 21:44:57,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 21:44:57,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:57,018 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:57,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 21:44:57,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 21:44:57,219 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:57,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:57,219 INFO L85 PathProgramCache]: Analyzing trace with hash 219687208, now seen corresponding path program 1 times [2025-03-03 21:44:57,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:57,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097140047] [2025-03-03 21:44:57,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:57,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:57,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 21:44:57,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 21:44:57,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:57,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:44:57,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1935019397] [2025-03-03 21:44:57,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:57,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:44:57,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:44:57,293 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:44:57,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 21:44:57,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 21:44:57,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 21:44:57,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:57,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:57,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 21:44:57,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:44:57,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1119 proven. 189 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2025-03-03 21:44:57,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:44:58,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:58,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097140047] [2025-03-03 21:44:58,312 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 21:44:58,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935019397] [2025-03-03 21:44:58,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935019397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:44:58,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:44:58,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-03 21:44:58,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733653534] [2025-03-03 21:44:58,313 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 21:44:58,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:44:58,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:58,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:44:58,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:44:58,314 INFO L87 Difference]: Start difference. First operand 532 states and 727 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 4 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-03 21:44:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:58,557 INFO L93 Difference]: Finished difference Result 902 states and 1217 transitions. [2025-03-03 21:44:58,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 21:44:58,557 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 4 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 214 [2025-03-03 21:44:58,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:58,559 INFO L225 Difference]: With dead ends: 902 [2025-03-03 21:44:58,559 INFO L226 Difference]: Without dead ends: 454 [2025-03-03 21:44:58,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:44:58,561 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 72 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:58,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 188 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:44:58,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-03 21:44:58,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 448. [2025-03-03 21:44:58,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 361 states have (on average 1.2742382271468145) internal successors, (460), 362 states have internal predecessors, (460), 68 states have call successors, (68), 18 states have call predecessors, (68), 18 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 21:44:58,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 596 transitions. [2025-03-03 21:44:58,586 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 596 transitions. Word has length 214 [2025-03-03 21:44:58,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:58,587 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 596 transitions. [2025-03-03 21:44:58,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 4 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-03 21:44:58,587 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 596 transitions. [2025-03-03 21:44:58,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 21:44:58,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:58,588 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:58,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 21:44:58,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:44:58,788 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:58,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:58,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1437488154, now seen corresponding path program 1 times [2025-03-03 21:44:58,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:58,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283288979] [2025-03-03 21:44:58,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:58,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:58,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 21:44:58,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 21:44:58,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:58,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:44:58,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [921597244] [2025-03-03 21:44:58,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:58,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:44:58,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:44:58,840 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:44:58,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 21:44:58,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 21:44:58,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 21:44:58,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:58,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:44:58,950 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:44:58,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 21:44:59,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 21:44:59,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:59,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:44:59,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:44:59,240 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:44:59,241 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:44:59,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 21:44:59,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:44:59,446 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:59,553 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:44:59,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:44:59 BoogieIcfgContainer [2025-03-03 21:44:59,558 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:44:59,558 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:44:59,558 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:44:59,558 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:44:59,559 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:14" (3/4) ... [2025-03-03 21:44:59,561 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:44:59,561 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:44:59,562 INFO L158 Benchmark]: Toolchain (without parser) took 45973.67ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 108.3MB in the beginning and 86.3MB in the end (delta: 22.1MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2025-03-03 21:44:59,562 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:44:59,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.52ms. Allocated memory is still 142.6MB. Free memory was 108.3MB in the beginning and 91.7MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:44:59,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.30ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 87.8MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:44:59,563 INFO L158 Benchmark]: Boogie Preprocessor took 67.69ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 81.1MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:44:59,563 INFO L158 Benchmark]: IcfgBuilder took 579.27ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 45.8MB in the end (delta: 35.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 21:44:59,563 INFO L158 Benchmark]: TraceAbstraction took 44972.17ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 45.8MB in the beginning and 86.3MB in the end (delta: -40.4MB). Peak memory consumption was 254.3MB. Max. memory is 16.1GB. [2025-03-03 21:44:59,564 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 167.8MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:44:59,565 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.52ms. Allocated memory is still 142.6MB. Free memory was 108.3MB in the beginning and 91.7MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.30ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 87.8MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.69ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 81.1MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 579.27ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 45.8MB in the end (delta: 35.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 44972.17ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 45.8MB in the beginning and 86.3MB in the end (delta: -40.4MB). Peak memory consumption was 254.3MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 167.8MB. Free memory is still 86.3MB. 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 someUnaryDOUBLEoperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 167, overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryDOUBLEComparisonOperation at line 181, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 189. 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_24 = 2; [L43] unsigned char var_1_27 = 0; [L44] unsigned char var_1_29 = 0; [L45] unsigned char var_1_30 = 0; [L46] unsigned char var_1_31 = 0; [L47] unsigned char var_1_32 = 1; [L48] unsigned char var_1_33 = 0; [L49] signed short int var_1_35 = 8; [L50] signed short int var_1_37 = -4; [L51] float var_1_38 = 15.875; [L52] double var_1_39 = 0.125; [L53] double var_1_40 = 3.8; [L54] signed char var_1_43 = -8; [L55] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-16, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L193] isInitial = 1 [L194] FCALL initially() [L195] COND TRUE 1 [L196] CALL updateLastVariables() [L186] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-16, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L196] RET updateLastVariables() [L197] CALL updateVariables() [L136] var_1_3 = __VERIFIER_nondet_char() [L137] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L137] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L138] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L138] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L139] var_1_4 = __VERIFIER_nondet_char() [L140] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L140] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L141] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L141] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L142] var_1_5 = __VERIFIER_nondet_char() [L143] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L143] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L144] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L144] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L145] var_1_7 = __VERIFIER_nondet_long() [L146] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-4, var_1_9=50] [L146] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-4, var_1_9=50] [L147] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-4, var_1_9=50] [L147] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-4, var_1_9=50] [L148] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-4, var_1_9=50] [L148] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-4, var_1_9=50] [L149] var_1_8 = __VERIFIER_nondet_long() [L150] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L150] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L151] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L151] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L152] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L152] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L153] var_1_10 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L154] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L155] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L155] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L156] var_1_11 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L157] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L158] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L158] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L159] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L159] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L160] var_1_16 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L161] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L162] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L162] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L163] var_1_17 = __VERIFIER_nondet_ushort() [L164] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L164] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L165] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L165] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L166] var_1_21 = __VERIFIER_nondet_double() [L167] 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=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L167] 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=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L168] var_1_29 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L169] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L170] CALL assume_abort_if_not(var_1_29 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L170] RET assume_abort_if_not(var_1_29 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L171] var_1_30 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L172] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L173] CALL assume_abort_if_not(var_1_30 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L173] RET assume_abort_if_not(var_1_30 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L174] var_1_31 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L175] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L176] CALL assume_abort_if_not(var_1_31 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L176] RET assume_abort_if_not(var_1_31 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L177] var_1_32 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L178] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L179] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L179] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L180] var_1_39 = __VERIFIER_nondet_double() [L181] CALL assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L181] RET assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L182] var_1_40 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L183] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L197] RET updateVariables() [L198] CALL step() [L59] var_1_22 = var_1_10 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L60] COND FALSE !(var_1_19 && var_1_19) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L65] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L76] COND TRUE var_1_10 != ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) [L77] var_1_33 = (5 + var_1_11) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L79] COND FALSE !((~ var_1_4) > (var_1_4 / var_1_11)) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L82] var_1_37 = ((((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) < (var_1_4)) ? (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L83] COND TRUE var_1_7 == var_1_11 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L84] COND TRUE (var_1_39 - var_1_40) < var_1_21 [L85] var_1_38 = ((((((((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) < 0 ) ? -((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) : ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) < 0 ) ? -(((((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) < 0 ) ? -((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) : ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) : (((((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) < 0 ) ? -((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) : ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L92] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L93] COND FALSE !(((var_1_11 + -128) % var_1_10) >= var_1_15) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L99] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L99] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L104] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L106] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L106] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L107] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L108] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L112] signed long int stepLocal_1 = -4; [L113] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L114] 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=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L119] var_1_18 = var_1_17 [L120] var_1_19 = 0 [L121] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L122] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L125] COND TRUE var_1_3 <= var_1_1 [L126] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=129, var_1_11=126, var_1_12=0, var_1_13=16, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L130] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=65534, var_1_10=129, var_1_11=126, var_1_12=0, var_1_13=16, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L131] COND TRUE (~ var_1_3) < stepLocal_2 [L132] 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=129, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L198] RET step() [L199] CALL, EXPR property() [L189] 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=129, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L189] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L189] 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=129, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L189] 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=129, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L189] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L189] 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=129, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L189-L190] 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)) ; [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.8s, OverallIterations: 20, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2244 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2212 mSDsluCounter, 12436 SdHoareTripleChecker+Invalid, 9.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9635 mSDsCounter, 219 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7083 IncrementalHoareTripleChecker+Invalid, 7302 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 219 mSolverCounterUnsat, 2801 mSDtfsCounter, 7083 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1540 GetRequests, 1336 SyntacticMatches, 1 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=532occurred in iteration=18, InterpolantAutomatonStates: 183, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 1647 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 26.1s InterpolantComputationTime, 5314 NumberOfCodeBlocks, 5314 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 4650 ConstructedInterpolants, 0 QuantifiedInterpolants, 21581 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1946 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 43091/43648 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 21:44:59,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_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 6871ab96a9f52a49c873d6506e9b30443151052bffac3c098c041f36f26e7383 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:45:01,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:45:01,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:45:01,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:45:01,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:45:01,522 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:45:01,523 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:45:01,523 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:45:01,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:45:01,524 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:45:01,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:45:01,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:45:01,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:45:01,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:45:01,524 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:45:01,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:45:01,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:45:01,524 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:45:01,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:45:01,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:45:01,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:45:01,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:45:01,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:45:01,525 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:45:01,525 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:45:01,525 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:45:01,525 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:45:01,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:45:01,525 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:45:01,525 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:45:01,525 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:45:01,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:45:01,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:45:01,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:45:01,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:45:01,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:45:01,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:45:01,526 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:45:01,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:45:01,526 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:45:01,526 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:45:01,526 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:45:01,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:45:01,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:45:01,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:45:01,526 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 -> 6871ab96a9f52a49c873d6506e9b30443151052bffac3c098c041f36f26e7383 [2025-03-03 21:45:01,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:45:01,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:45:01,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:45:01,775 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:45:01,775 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:45:01,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2025-03-03 21:45:03,029 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5608b6f26/f53bf57978bf4250908d0f9164701bca/FLAG4447286be [2025-03-03 21:45:03,195 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:45:03,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2025-03-03 21:45:03,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5608b6f26/f53bf57978bf4250908d0f9164701bca/FLAG4447286be [2025-03-03 21:45:03,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5608b6f26/f53bf57978bf4250908d0f9164701bca [2025-03-03 21:45:03,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:45:03,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:45:03,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:45:03,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:45:03,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:45:03,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34938247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03, skipping insertion in model container [2025-03-03 21:45:03,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:45:03,356 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i[919,932] [2025-03-03 21:45:03,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:45:03,456 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:45:03,469 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i[919,932] [2025-03-03 21:45:03,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:45:03,525 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:45:03,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03 WrapperNode [2025-03-03 21:45:03,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:45:03,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:45:03,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:45:03,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:45:03,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,544 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,580 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2025-03-03 21:45:03,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:45:03,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:45:03,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:45:03,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:45:03,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,623 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:45:03,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,624 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,642 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:45:03,656 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:45:03,657 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:45:03,657 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:45:03,658 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:45:03,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:45:03,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:45:03,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:45:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:45:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:45:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:45:03,711 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:45:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:45:03,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:45:03,778 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:45:03,780 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:45:04,823 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 21:45:04,824 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:45:04,836 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:45:04,836 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:45:04,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:45:04 BoogieIcfgContainer [2025-03-03 21:45:04,837 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:45:04,839 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:45:04,839 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:45:04,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:45:04,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:45:03" (1/3) ... [2025-03-03 21:45:04,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20125fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:45:04, skipping insertion in model container [2025-03-03 21:45:04,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (2/3) ... [2025-03-03 21:45:04,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20125fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:45:04, skipping insertion in model container [2025-03-03 21:45:04,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:45:04" (3/3) ... [2025-03-03 21:45:04,846 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2025-03-03 21:45:04,856 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:45:04,858 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:45:04,896 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:45:04,904 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;@577edd66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:45:04,904 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:45:04,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 21:45:04,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 21:45:04,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:45:04,917 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:45:04,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:45:04,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:45:04,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1909294699, now seen corresponding path program 1 times [2025-03-03 21:45:04,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:45:04,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875739084] [2025-03-03 21:45:04,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:04,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:45:04,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:45:04,931 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:45:04,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 21:45:05,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 21:45:05,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 21:45:05,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:05,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:45:05,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 21:45:05,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:45:06,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1068 proven. 135 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2025-03-03 21:45:06,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:45:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-03 21:45:07,284 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:45:07,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875739084] [2025-03-03 21:45:07,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875739084] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:45:07,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:45:07,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2025-03-03 21:45:07,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101182367] [2025-03-03 21:45:07,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:45:07,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:45:07,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:45:07,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:45:07,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:45:07,305 INFO L87 Difference]: Start difference. First operand has 91 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 4 states have call successors, (61), 3 states have call predecessors, (61), 6 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2025-03-03 21:45:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:45:08,219 INFO L93 Difference]: Finished difference Result 188 states and 329 transitions. [2025-03-03 21:45:08,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 21:45:08,229 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 4 states have call successors, (61), 3 states have call predecessors, (61), 6 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) Word has length 203 [2025-03-03 21:45:08,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:45:08,235 INFO L225 Difference]: With dead ends: 188 [2025-03-03 21:45:08,235 INFO L226 Difference]: Without dead ends: 100 [2025-03-03 21:45:08,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 394 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:45:08,239 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 106 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:45:08,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 235 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 21:45:08,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-03 21:45:08,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2025-03-03 21:45:08,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 60 states have internal predecessors, (80), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 21:45:08,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 144 transitions. [2025-03-03 21:45:08,279 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 144 transitions. Word has length 203 [2025-03-03 21:45:08,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:45:08,280 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 144 transitions. [2025-03-03 21:45:08,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 4 states have call successors, (61), 3 states have call predecessors, (61), 6 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2025-03-03 21:45:08,281 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 144 transitions. [2025-03-03 21:45:08,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 21:45:08,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:45:08,286 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:45:08,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 21:45:08,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:45:08,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:45:08,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:45:08,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1541200726, now seen corresponding path program 1 times [2025-03-03 21:45:08,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:45:08,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015680830] [2025-03-03 21:45:08,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:08,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:45:08,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:45:08,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:45:08,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 21:45:08,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 21:45:08,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 21:45:08,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:08,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:45:08,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 21:45:08,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:45:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 21:45:09,128 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:45:09,128 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:45:09,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015680830] [2025-03-03 21:45:09,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015680830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:45:09,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:45:09,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:45:09,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664930198] [2025-03-03 21:45:09,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:45:09,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:45:09,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:45:09,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:45:09,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:45:09,130 INFO L87 Difference]: Start difference. First operand 96 states and 144 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:45:09,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:45:09,197 INFO L93 Difference]: Finished difference Result 186 states and 279 transitions. [2025-03-03 21:45:09,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:45:09,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-03-03 21:45:09,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:45:09,208 INFO L225 Difference]: With dead ends: 186 [2025-03-03 21:45:09,208 INFO L226 Difference]: Without dead ends: 93 [2025-03-03 21:45:09,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:45:09,209 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:45:09,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 123 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:45:09,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-03 21:45:09,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-03 21:45:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 57 states have internal predecessors, (70), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 21:45:09,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 134 transitions. [2025-03-03 21:45:09,228 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 134 transitions. Word has length 203 [2025-03-03 21:45:09,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:45:09,229 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 134 transitions. [2025-03-03 21:45:09,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 21:45:09,229 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 134 transitions. [2025-03-03 21:45:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 21:45:09,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:45:09,233 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:45:09,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 21:45:09,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:45:09,434 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:45:09,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:45:09,434 INFO L85 PathProgramCache]: Analyzing trace with hash 183709612, now seen corresponding path program 1 times [2025-03-03 21:45:09,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:45:09,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598872870] [2025-03-03 21:45:09,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:09,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:45:09,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:45:09,438 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:45:09,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 21:45:09,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 21:45:09,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 21:45:09,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:09,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:45:09,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 21:45:09,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:45:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1080 proven. 147 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2025-03-03 21:45:11,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:45:13,296 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:45:13,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598872870] [2025-03-03 21:45:13,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598872870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:45:13,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1165753478] [2025-03-03 21:45:13,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:13,296 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:45:13,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:45:13,317 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:45:13,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-03 21:45:13,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 21:45:14,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 21:45:14,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:14,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:45:14,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 21:45:14,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:45:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1120 proven. 102 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2025-03-03 21:45:15,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:45:16,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1165753478] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:45:16,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:45:16,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2025-03-03 21:45:16,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892230827] [2025-03-03 21:45:16,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:45:16,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 21:45:16,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:45:16,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 21:45:16,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=208, Unknown=0, NotChecked=0, Total=342 [2025-03-03 21:45:16,927 INFO L87 Difference]: Start difference. First operand 93 states and 134 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 11 states have internal predecessors, (84), 5 states have call successors, (49), 5 states have call predecessors, (49), 7 states have return successors, (50), 5 states have call predecessors, (50), 5 states have call successors, (50) [2025-03-03 21:45:17,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:45:17,793 INFO L93 Difference]: Finished difference Result 277 states and 393 transitions. [2025-03-03 21:45:17,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 21:45:17,798 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 11 states have internal predecessors, (84), 5 states have call successors, (49), 5 states have call predecessors, (49), 7 states have return successors, (50), 5 states have call predecessors, (50), 5 states have call successors, (50) Word has length 204 [2025-03-03 21:45:17,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:45:17,800 INFO L225 Difference]: With dead ends: 277 [2025-03-03 21:45:17,800 INFO L226 Difference]: Without dead ends: 187 [2025-03-03 21:45:17,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=202, Invalid=304, Unknown=0, NotChecked=0, Total=506 [2025-03-03 21:45:17,802 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 53 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:45:17,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 509 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 21:45:17,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-03 21:45:17,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 177. [2025-03-03 21:45:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 103 states have (on average 1.1650485436893203) internal successors, (120), 103 states have internal predecessors, (120), 64 states have call successors, (64), 9 states have call predecessors, (64), 9 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 21:45:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 248 transitions. [2025-03-03 21:45:17,822 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 248 transitions. Word has length 204 [2025-03-03 21:45:17,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:45:17,823 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 248 transitions. [2025-03-03 21:45:17,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 11 states have internal predecessors, (84), 5 states have call successors, (49), 5 states have call predecessors, (49), 7 states have return successors, (50), 5 states have call predecessors, (50), 5 states have call successors, (50) [2025-03-03 21:45:17,823 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 248 transitions. [2025-03-03 21:45:17,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 21:45:17,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:45:17,825 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:45:17,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 21:45:18,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-03 21:45:18,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 21:45:18,225 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:45:18,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:45:18,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1691261421, now seen corresponding path program 1 times [2025-03-03 21:45:18,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:45:18,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750218746] [2025-03-03 21:45:18,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:18,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:45:18,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:45:18,229 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:45:18,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-03 21:45:18,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 21:45:18,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 21:45:18,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:18,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:45:18,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 21:45:18,624 INFO L279 TraceCheckSpWp]: Computing forward predicates...