./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.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 2b25a2230e8cd5e14dc98a853cb32c06f85de9122996251da70e4b6160e146c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:54:45,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:54:45,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:54:45,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:54:45,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:54:45,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:54:45,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:54:45,587 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:54:45,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:54:45,588 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:54:45,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:54:45,588 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:54:45,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:54:45,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:54:45,589 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:54:45,589 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:54:45,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:54:45,589 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:54:45,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:54:45,590 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:54:45,590 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:54:45,590 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:54:45,590 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:54:45,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:54:45,590 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:54:45,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:54:45,590 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:54:45,590 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:54:45,590 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:54:45,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:54:45,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:54:45,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:54:45,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:54:45,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:54:45,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:54:45,591 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:54:45,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:54:45,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:54:45,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:54:45,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:54:45,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:54:45,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:54:45,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:54:45,592 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 -> 2b25a2230e8cd5e14dc98a853cb32c06f85de9122996251da70e4b6160e146c4 [2025-03-03 20:54:45,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:54:45,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:54:45,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:54:45,830 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:54:45,830 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:54:45,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2025-03-03 20:54:46,936 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63aa98275/3c6768ef92b148828e952b9d912d01d0/FLAG9d6e4587a [2025-03-03 20:54:47,170 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:54:47,172 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2025-03-03 20:54:47,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63aa98275/3c6768ef92b148828e952b9d912d01d0/FLAG9d6e4587a [2025-03-03 20:54:47,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63aa98275/3c6768ef92b148828e952b9d912d01d0 [2025-03-03 20:54:47,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:54:47,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:54:47,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:54:47,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:54:47,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:54:47,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:54:47" (1/1) ... [2025-03-03 20:54:47,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71432b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:54:47, skipping insertion in model container [2025-03-03 20:54:47,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:54:47" (1/1) ... [2025-03-03 20:54:47,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:54:47,615 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i[919,932] [2025-03-03 20:54:47,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:54:47,677 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:54:47,685 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i[919,932] [2025-03-03 20:54:47,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:54:47,729 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:54:47,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:54:47 WrapperNode [2025-03-03 20:54:47,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:54:47,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:54:47,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:54:47,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:54:47,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:54:47" (1/1) ... [2025-03-03 20:54:47,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:54:47" (1/1) ... [2025-03-03 20:54:47,790 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 282 [2025-03-03 20:54:47,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:54:47,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:54:47,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:54:47,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:54:47,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:54:47" (1/1) ... [2025-03-03 20:54:47,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:54:47" (1/1) ... [2025-03-03 20:54:47,804 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:54:47" (1/1) ... [2025-03-03 20:54:47,823 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:54:47,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:54:47" (1/1) ... [2025-03-03 20:54:47,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:54:47" (1/1) ... [2025-03-03 20:54:47,833 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:54:47" (1/1) ... [2025-03-03 20:54:47,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:54:47" (1/1) ... [2025-03-03 20:54:47,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:54:47" (1/1) ... [2025-03-03 20:54:47,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:54:47" (1/1) ... [2025-03-03 20:54:47,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:54:47,844 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:54:47,845 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:54:47,845 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:54:47,845 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:54:47" (1/1) ... [2025-03-03 20:54:47,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:54:47,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:54:47,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:54:47,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:54:47,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:54:47,892 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:54:47,892 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:54:47,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:54:47,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:54:47,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:54:47,966 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:54:47,967 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:54:48,289 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L206: havoc property_#t~bitwise29#1;havoc property_#t~bitwise30#1;havoc property_#t~short31#1; [2025-03-03 20:54:48,331 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-03 20:54:48,331 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:54:48,349 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:54:48,350 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:54:48,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:54:48 BoogieIcfgContainer [2025-03-03 20:54:48,351 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:54:48,352 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:54:48,353 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:54:48,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:54:48,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:54:47" (1/3) ... [2025-03-03 20:54:48,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af74f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:54:48, skipping insertion in model container [2025-03-03 20:54:48,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:54:47" (2/3) ... [2025-03-03 20:54:48,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af74f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:54:48, skipping insertion in model container [2025-03-03 20:54:48,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:54:48" (3/3) ... [2025-03-03 20:54:48,358 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2025-03-03 20:54:48,368 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:54:48,369 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i that has 2 procedures, 115 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:54:48,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:54:48,423 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;@67d3e321, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:54:48,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:54:48,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 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 20:54:48,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-03 20:54:48,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:54:48,439 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, 1, 1] [2025-03-03 20:54:48,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:54:48,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:54:48,444 INFO L85 PathProgramCache]: Analyzing trace with hash -2134388140, now seen corresponding path program 1 times [2025-03-03 20:54:48,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:54:48,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618048975] [2025-03-03 20:54:48,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:54:48,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:54:48,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 20:54:48,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 20:54:48,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:54:48,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:54:48,755 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 20:54:48,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:54:48,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618048975] [2025-03-03 20:54:48,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618048975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:54:48,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239114071] [2025-03-03 20:54:48,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:54:48,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:54:48,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:54:48,767 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:54:48,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:54:48,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 20:54:48,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 20:54:48,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:54:48,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:54:48,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:54:48,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:54:48,983 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 20:54:48,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:54:48,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239114071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:54:48,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:54:48,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:54:48,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608973831] [2025-03-03 20:54:48,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:54:48,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:54:48,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:54:49,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:54:49,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:54:49,005 INFO L87 Difference]: Start difference. First operand has 115 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 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 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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 20:54:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:54:49,035 INFO L93 Difference]: Finished difference Result 224 states and 383 transitions. [2025-03-03 20:54:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:54:49,036 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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 216 [2025-03-03 20:54:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:54:49,043 INFO L225 Difference]: With dead ends: 224 [2025-03-03 20:54:49,044 INFO L226 Difference]: Without dead ends: 112 [2025-03-03 20:54:49,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:54:49,049 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:54:49,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:54:49,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-03 20:54:49,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-03 20:54:49,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 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 20:54:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2025-03-03 20:54:49,080 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 216 [2025-03-03 20:54:49,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:54:49,080 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2025-03-03 20:54:49,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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 20:54:49,080 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2025-03-03 20:54:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-03 20:54:49,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:54:49,082 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, 1, 1] [2025-03-03 20:54:49,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:54:49,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:54:49,283 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:54:49,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:54:49,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1661015894, now seen corresponding path program 1 times [2025-03-03 20:54:49,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:54:49,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505763577] [2025-03-03 20:54:49,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:54:49,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:54:49,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 20:54:49,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 20:54:49,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:54:49,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:54:49,518 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 20:54:49,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:54:49,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505763577] [2025-03-03 20:54:49,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505763577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:54:49,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:54:49,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:54:49,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724406579] [2025-03-03 20:54:49,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:54:49,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:54:49,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:54:49,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:54:49,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:54:49,523 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 20:54:49,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:54:49,591 INFO L93 Difference]: Finished difference Result 269 states and 418 transitions. [2025-03-03 20:54:49,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:54:49,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 216 [2025-03-03 20:54:49,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:54:49,596 INFO L225 Difference]: With dead ends: 269 [2025-03-03 20:54:49,596 INFO L226 Difference]: Without dead ends: 160 [2025-03-03 20:54:49,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:54:49,599 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 65 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:54:49,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 363 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:54:49,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-03 20:54:49,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 125. [2025-03-03 20:54:49,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 91 states have internal predecessors, (128), 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 20:54:49,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 192 transitions. [2025-03-03 20:54:49,617 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 192 transitions. Word has length 216 [2025-03-03 20:54:49,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:54:49,619 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 192 transitions. [2025-03-03 20:54:49,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 20:54:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 192 transitions. [2025-03-03 20:54:49,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-03 20:54:49,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:54:49,624 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, 1, 1] [2025-03-03 20:54:49,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:54:49,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:54:49,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:54:49,625 INFO L85 PathProgramCache]: Analyzing trace with hash -954138422, now seen corresponding path program 1 times [2025-03-03 20:54:49,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:54:49,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629282750] [2025-03-03 20:54:49,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:54:49,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:54:49,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 20:54:49,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 20:54:49,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:54:49,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:54:50,673 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 20:54:50,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:54:50,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629282750] [2025-03-03 20:54:50,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629282750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:54:50,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:54:50,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:54:50,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850238541] [2025-03-03 20:54:50,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:54:50,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:54:50,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:54:50,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:54:50,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:54:50,680 INFO L87 Difference]: Start difference. First operand 125 states and 192 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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 20:54:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:54:51,108 INFO L93 Difference]: Finished difference Result 508 states and 783 transitions. [2025-03-03 20:54:51,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:54:51,109 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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 216 [2025-03-03 20:54:51,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:54:51,112 INFO L225 Difference]: With dead ends: 508 [2025-03-03 20:54:51,112 INFO L226 Difference]: Without dead ends: 386 [2025-03-03 20:54:51,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:54:51,114 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 558 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:54:51,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 717 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:54:51,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-03 20:54:51,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 301. [2025-03-03 20:54:51,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 234 states have (on average 1.4401709401709402) internal successors, (337), 234 states have internal predecessors, (337), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 20:54:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 465 transitions. [2025-03-03 20:54:51,151 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 465 transitions. Word has length 216 [2025-03-03 20:54:51,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:54:51,152 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 465 transitions. [2025-03-03 20:54:51,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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 20:54:51,152 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 465 transitions. [2025-03-03 20:54:51,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-03 20:54:51,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:54:51,155 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, 1, 1] [2025-03-03 20:54:51,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:54:51,156 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:54:51,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:54:51,157 INFO L85 PathProgramCache]: Analyzing trace with hash -887131669, now seen corresponding path program 1 times [2025-03-03 20:54:51,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:54:51,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413864693] [2025-03-03 20:54:51,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:54:51,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:54:51,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 20:54:51,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 20:54:51,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:54:51,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:54:51,450 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 20:54:51,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:54:51,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413864693] [2025-03-03 20:54:51,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413864693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:54:51,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:54:51,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:54:51,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133970250] [2025-03-03 20:54:51,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:54:51,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:54:51,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:54:51,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:54:51,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:54:51,453 INFO L87 Difference]: Start difference. First operand 301 states and 465 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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 20:54:51,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:54:51,787 INFO L93 Difference]: Finished difference Result 826 states and 1283 transitions. [2025-03-03 20:54:51,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:54:51,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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 216 [2025-03-03 20:54:51,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:54:51,791 INFO L225 Difference]: With dead ends: 826 [2025-03-03 20:54:51,791 INFO L226 Difference]: Without dead ends: 528 [2025-03-03 20:54:51,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:54:51,792 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 326 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:54:51,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 431 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:54:51,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-03 20:54:51,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 376. [2025-03-03 20:54:51,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 309 states have (on average 1.4660194174757282) internal successors, (453), 309 states have internal predecessors, (453), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 20:54:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 581 transitions. [2025-03-03 20:54:51,830 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 581 transitions. Word has length 216 [2025-03-03 20:54:51,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:54:51,831 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 581 transitions. [2025-03-03 20:54:51,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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 20:54:51,831 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 581 transitions. [2025-03-03 20:54:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 20:54:51,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:54:51,833 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, 1, 1, 1] [2025-03-03 20:54:51,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:54:51,834 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:54:51,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:54:51,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1614786617, now seen corresponding path program 1 times [2025-03-03 20:54:51,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:54:51,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221589910] [2025-03-03 20:54:51,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:54:51,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:54:51,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 20:54:51,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 20:54:51,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:54:51,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:54:52,301 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 20:54:52,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:54:52,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221589910] [2025-03-03 20:54:52,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221589910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:54:52,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:54:52,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:54:52,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460866304] [2025-03-03 20:54:52,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:54:52,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:54:52,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:54:52,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:54:52,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:54:52,303 INFO L87 Difference]: Start difference. First operand 376 states and 581 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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 20:54:52,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:54:52,602 INFO L93 Difference]: Finished difference Result 976 states and 1502 transitions. [2025-03-03 20:54:52,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:54:52,603 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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 217 [2025-03-03 20:54:52,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:54:52,606 INFO L225 Difference]: With dead ends: 976 [2025-03-03 20:54:52,606 INFO L226 Difference]: Without dead ends: 603 [2025-03-03 20:54:52,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:54:52,607 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 439 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:54:52,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 552 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:54:52,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-03 20:54:52,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 441. [2025-03-03 20:54:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 374 states have (on average 1.4786096256684491) internal successors, (553), 374 states have internal predecessors, (553), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 20:54:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 681 transitions. [2025-03-03 20:54:52,636 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 681 transitions. Word has length 217 [2025-03-03 20:54:52,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:54:52,636 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 681 transitions. [2025-03-03 20:54:52,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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 20:54:52,637 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 681 transitions. [2025-03-03 20:54:52,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 20:54:52,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:54:52,639 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, 1, 1, 1] [2025-03-03 20:54:52,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:54:52,639 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:54:52,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:54:52,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1333387578, now seen corresponding path program 1 times [2025-03-03 20:54:52,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:54:52,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368843702] [2025-03-03 20:54:52,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:54:52,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:54:52,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 20:54:52,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 20:54:52,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:54:52,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:54:52,763 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 20:54:52,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:54:52,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368843702] [2025-03-03 20:54:52,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368843702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:54:52,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:54:52,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:54:52,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664839223] [2025-03-03 20:54:52,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:54:52,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:54:52,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:54:52,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:54:52,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:54:52,765 INFO L87 Difference]: Start difference. First operand 441 states and 681 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 20:54:52,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:54:52,843 INFO L93 Difference]: Finished difference Result 1192 states and 1848 transitions. [2025-03-03 20:54:52,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:54:52,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 217 [2025-03-03 20:54:52,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:54:52,848 INFO L225 Difference]: With dead ends: 1192 [2025-03-03 20:54:52,848 INFO L226 Difference]: Without dead ends: 754 [2025-03-03 20:54:52,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:54:52,850 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 140 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:54:52,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 348 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:54:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-03 20:54:52,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 546. [2025-03-03 20:54:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 479 states have (on average 1.498956158663883) internal successors, (718), 479 states have internal predecessors, (718), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 20:54:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 846 transitions. [2025-03-03 20:54:52,896 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 846 transitions. Word has length 217 [2025-03-03 20:54:52,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:54:52,897 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 846 transitions. [2025-03-03 20:54:52,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 20:54:52,897 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 846 transitions. [2025-03-03 20:54:52,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 20:54:52,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:54:52,903 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, 1, 1, 1] [2025-03-03 20:54:52,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:54:52,903 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:54:52,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:54:52,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1742845542, now seen corresponding path program 1 times [2025-03-03 20:54:52,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:54:52,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142055126] [2025-03-03 20:54:52,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:54:52,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:54:52,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 20:54:52,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 20:54:52,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:54:52,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:54:53,255 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 20:54:53,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:54:53,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142055126] [2025-03-03 20:54:53,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142055126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:54:53,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:54:53,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:54:53,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155216189] [2025-03-03 20:54:53,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:54:53,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:54:53,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:54:53,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:54:53,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:54:53,257 INFO L87 Difference]: Start difference. First operand 546 states and 846 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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 20:54:53,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:54:53,669 INFO L93 Difference]: Finished difference Result 1351 states and 2092 transitions. [2025-03-03 20:54:53,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:54:53,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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 217 [2025-03-03 20:54:53,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:54:53,673 INFO L225 Difference]: With dead ends: 1351 [2025-03-03 20:54:53,673 INFO L226 Difference]: Without dead ends: 805 [2025-03-03 20:54:53,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:54:53,675 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 138 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:54:53,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1093 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:54:53,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-03-03 20:54:53,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 652. [2025-03-03 20:54:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 585 states have (on average 1.5179487179487179) internal successors, (888), 585 states have internal predecessors, (888), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 20:54:53,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 1016 transitions. [2025-03-03 20:54:53,744 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 1016 transitions. Word has length 217 [2025-03-03 20:54:53,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:54:53,744 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 1016 transitions. [2025-03-03 20:54:53,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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 20:54:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 1016 transitions. [2025-03-03 20:54:53,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 20:54:53,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:54:53,748 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, 1, 1, 1, 1] [2025-03-03 20:54:53,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:54:53,748 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:54:53,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:54:53,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1315957613, now seen corresponding path program 1 times [2025-03-03 20:54:53,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:54:53,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581993386] [2025-03-03 20:54:53,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:54:53,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:54:53,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 20:54:53,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 20:54:53,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:54:53,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:54:53,873 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 20:54:53,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:54:53,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581993386] [2025-03-03 20:54:53,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581993386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:54:53,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:54:53,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:54:53,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681171615] [2025-03-03 20:54:53,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:54:53,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:54:53,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:54:53,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:54:53,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:54:53,875 INFO L87 Difference]: Start difference. First operand 652 states and 1016 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 20:54:54,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:54:54,357 INFO L93 Difference]: Finished difference Result 1639 states and 2567 transitions. [2025-03-03 20:54:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:54:54,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 218 [2025-03-03 20:54:54,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:54:54,362 INFO L225 Difference]: With dead ends: 1639 [2025-03-03 20:54:54,362 INFO L226 Difference]: Without dead ends: 990 [2025-03-03 20:54:54,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:54:54,364 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 295 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:54:54,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 463 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:54:54,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-03-03 20:54:54,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 696. [2025-03-03 20:54:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 629 states have (on average 1.5262321144674087) internal successors, (960), 629 states have internal predecessors, (960), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 20:54:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1088 transitions. [2025-03-03 20:54:54,421 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1088 transitions. Word has length 218 [2025-03-03 20:54:54,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:54:54,421 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 1088 transitions. [2025-03-03 20:54:54,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 20:54:54,421 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1088 transitions. [2025-03-03 20:54:54,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 20:54:54,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:54:54,424 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, 1, 1, 1, 1] [2025-03-03 20:54:54,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:54:54,425 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:54:54,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:54:54,425 INFO L85 PathProgramCache]: Analyzing trace with hash 805423436, now seen corresponding path program 1 times [2025-03-03 20:54:54,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:54:54,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494608735] [2025-03-03 20:54:54,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:54:54,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:54:54,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 20:54:54,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 20:54:54,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:54:54,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:54:54,849 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 20:54:54,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:54:54,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494608735] [2025-03-03 20:54:54,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494608735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:54:54,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:54:54,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:54:54,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868463210] [2025-03-03 20:54:54,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:54:54,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:54:54,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:54:54,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:54:54,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:54:54,851 INFO L87 Difference]: Start difference. First operand 696 states and 1088 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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 20:54:55,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:54:55,967 INFO L93 Difference]: Finished difference Result 1554 states and 2417 transitions. [2025-03-03 20:54:55,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:54:55,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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 218 [2025-03-03 20:54:55,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:54:55,971 INFO L225 Difference]: With dead ends: 1554 [2025-03-03 20:54:55,972 INFO L226 Difference]: Without dead ends: 861 [2025-03-03 20:54:55,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:54:55,975 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 425 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:54:55,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 686 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:54:55,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2025-03-03 20:54:56,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 596. [2025-03-03 20:54:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 529 states have (on average 1.4763705103969755) internal successors, (781), 529 states have internal predecessors, (781), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 20:54:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 909 transitions. [2025-03-03 20:54:56,028 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 909 transitions. Word has length 218 [2025-03-03 20:54:56,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:54:56,028 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 909 transitions. [2025-03-03 20:54:56,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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 20:54:56,029 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 909 transitions. [2025-03-03 20:54:56,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 20:54:56,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:54:56,031 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, 1, 1, 1, 1] [2025-03-03 20:54:56,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:54:56,031 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:54:56,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:54:56,031 INFO L85 PathProgramCache]: Analyzing trace with hash 319651533, now seen corresponding path program 1 times [2025-03-03 20:54:56,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:54:56,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300962744] [2025-03-03 20:54:56,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:54:56,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:54:56,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 20:54:56,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 20:54:56,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:54:56,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:54:56,438 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 20:54:56,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:54:56,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300962744] [2025-03-03 20:54:56,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300962744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:54:56,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:54:56,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:54:56,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583009153] [2025-03-03 20:54:56,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:54:56,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:54:56,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:54:56,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:54:56,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:54:56,439 INFO L87 Difference]: Start difference. First operand 596 states and 909 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 20:54:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:54:56,615 INFO L93 Difference]: Finished difference Result 1346 states and 2048 transitions. [2025-03-03 20:54:56,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:54:56,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 218 [2025-03-03 20:54:56,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:54:56,621 INFO L225 Difference]: With dead ends: 1346 [2025-03-03 20:54:56,621 INFO L226 Difference]: Without dead ends: 1087 [2025-03-03 20:54:56,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:54:56,622 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 83 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:54:56,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 488 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:54:56,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2025-03-03 20:54:56,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1083. [2025-03-03 20:54:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1010 states have (on average 1.493069306930693) internal successors, (1508), 1012 states have internal predecessors, (1508), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 20:54:56,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1644 transitions. [2025-03-03 20:54:56,674 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1644 transitions. Word has length 218 [2025-03-03 20:54:56,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:54:56,674 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1644 transitions. [2025-03-03 20:54:56,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 20:54:56,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1644 transitions. [2025-03-03 20:54:56,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 20:54:56,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:54:56,678 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, 1, 1, 1, 1] [2025-03-03 20:54:56,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:54:56,678 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:54:56,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:54:56,679 INFO L85 PathProgramCache]: Analyzing trace with hash -678056419, now seen corresponding path program 1 times [2025-03-03 20:54:56,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:54:56,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298588303] [2025-03-03 20:54:56,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:54:56,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:54:56,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 20:54:56,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 20:54:56,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:54:56,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:54:57,039 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 20:54:57,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:54:57,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298588303] [2025-03-03 20:54:57,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298588303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:54:57,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:54:57,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:54:57,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674662153] [2025-03-03 20:54:57,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:54:57,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:54:57,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:54:57,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:54:57,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:54:57,041 INFO L87 Difference]: Start difference. First operand 1083 states and 1644 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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 20:54:57,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:54:57,364 INFO L93 Difference]: Finished difference Result 2857 states and 4330 transitions. [2025-03-03 20:54:57,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:54:57,365 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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 218 [2025-03-03 20:54:57,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:54:57,372 INFO L225 Difference]: With dead ends: 2857 [2025-03-03 20:54:57,372 INFO L226 Difference]: Without dead ends: 1777 [2025-03-03 20:54:57,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:54:57,375 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 189 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:54:57,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 740 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:54:57,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2025-03-03 20:54:57,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1171. [2025-03-03 20:54:57,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 1098 states have (on average 1.506375227686703) internal successors, (1654), 1100 states have internal predecessors, (1654), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 20:54:57,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1790 transitions. [2025-03-03 20:54:57,438 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1790 transitions. Word has length 218 [2025-03-03 20:54:57,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:54:57,439 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1790 transitions. [2025-03-03 20:54:57,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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 20:54:57,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1790 transitions. [2025-03-03 20:54:57,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 20:54:57,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:54:57,442 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, 1, 1, 1, 1] [2025-03-03 20:54:57,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:54:57,442 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:54:57,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:54:57,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1690452308, now seen corresponding path program 1 times [2025-03-03 20:54:57,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:54:57,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587019186] [2025-03-03 20:54:57,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:54:57,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:54:57,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 20:54:57,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 20:54:57,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:54:57,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:54:57,905 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 20:54:57,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:54:57,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587019186] [2025-03-03 20:54:57,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587019186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:54:57,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:54:57,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 20:54:57,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844434378] [2025-03-03 20:54:57,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:54:57,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 20:54:57,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:54:57,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 20:54:57,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:54:57,908 INFO L87 Difference]: Start difference. First operand 1171 states and 1790 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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 20:54:59,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:54:59,414 INFO L93 Difference]: Finished difference Result 3597 states and 5482 transitions. [2025-03-03 20:54:59,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 20:54:59,415 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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 218 [2025-03-03 20:54:59,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:54:59,423 INFO L225 Difference]: With dead ends: 3597 [2025-03-03 20:54:59,424 INFO L226 Difference]: Without dead ends: 2429 [2025-03-03 20:54:59,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:54:59,427 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 928 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 528 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 528 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:54:59,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1464 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [528 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 20:54:59,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2025-03-03 20:54:59,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 1897. [2025-03-03 20:54:59,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1758 states have (on average 1.505688282138794) internal successors, (2647), 1760 states have internal predecessors, (2647), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 20:54:59,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2911 transitions. [2025-03-03 20:54:59,534 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2911 transitions. Word has length 218 [2025-03-03 20:54:59,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:54:59,534 INFO L471 AbstractCegarLoop]: Abstraction has 1897 states and 2911 transitions. [2025-03-03 20:54:59,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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 20:54:59,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2911 transitions. [2025-03-03 20:54:59,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 20:54:59,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:54:59,538 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, 1, 1, 1, 1] [2025-03-03 20:54:59,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:54:59,538 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:54:59,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:54:59,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2093980811, now seen corresponding path program 1 times [2025-03-03 20:54:59,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:54:59,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884435433] [2025-03-03 20:54:59,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:54:59,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:54:59,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 20:54:59,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 20:54:59,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:54:59,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:54:59,976 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 20:54:59,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:54:59,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884435433] [2025-03-03 20:54:59,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884435433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:54:59,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:54:59,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 20:54:59,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316131246] [2025-03-03 20:54:59,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:54:59,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 20:54:59,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:54:59,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 20:54:59,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:54:59,977 INFO L87 Difference]: Start difference. First operand 1897 states and 2911 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 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 20:55:01,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:55:01,389 INFO L93 Difference]: Finished difference Result 4089 states and 6256 transitions. [2025-03-03 20:55:01,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:55:01,389 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 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 218 [2025-03-03 20:55:01,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:55:01,397 INFO L225 Difference]: With dead ends: 4089 [2025-03-03 20:55:01,397 INFO L226 Difference]: Without dead ends: 2195 [2025-03-03 20:55:01,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:55:01,401 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 583 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:55:01,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1566 Invalid, 1617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 20:55:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2025-03-03 20:55:01,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 1897. [2025-03-03 20:55:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1758 states have (on average 1.505688282138794) internal successors, (2647), 1760 states have internal predecessors, (2647), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 20:55:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2911 transitions. [2025-03-03 20:55:01,492 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2911 transitions. Word has length 218 [2025-03-03 20:55:01,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:55:01,493 INFO L471 AbstractCegarLoop]: Abstraction has 1897 states and 2911 transitions. [2025-03-03 20:55:01,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 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 20:55:01,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2911 transitions. [2025-03-03 20:55:01,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:55:01,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:55:01,496 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, 1, 1, 1, 1, 1] [2025-03-03 20:55:01,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:55:01,496 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:55:01,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:55:01,497 INFO L85 PathProgramCache]: Analyzing trace with hash -345364677, now seen corresponding path program 1 times [2025-03-03 20:55:01,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:55:01,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187562082] [2025-03-03 20:55:01,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:55:01,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:55:01,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:55:01,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:55:01,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:01,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:55:01,819 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 20:55:01,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:55:01,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187562082] [2025-03-03 20:55:01,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187562082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:55:01,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:55:01,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 20:55:01,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772593800] [2025-03-03 20:55:01,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:55:01,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 20:55:01,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:55:01,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 20:55:01,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:55:01,820 INFO L87 Difference]: Start difference. First operand 1897 states and 2911 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 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 20:55:02,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:55:02,739 INFO L93 Difference]: Finished difference Result 4995 states and 7542 transitions. [2025-03-03 20:55:02,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 20:55:02,740 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 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 219 [2025-03-03 20:55:02,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:55:02,750 INFO L225 Difference]: With dead ends: 4995 [2025-03-03 20:55:02,750 INFO L226 Difference]: Without dead ends: 3101 [2025-03-03 20:55:02,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-03-03 20:55:02,754 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 539 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:55:02,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 975 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:55:02,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2025-03-03 20:55:02,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 1985. [2025-03-03 20:55:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1985 states, 1842 states have (on average 1.49728555917481) internal successors, (2758), 1844 states have internal predecessors, (2758), 132 states have call successors, (132), 10 states have call predecessors, (132), 10 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 20:55:02,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 3022 transitions. [2025-03-03 20:55:02,888 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 3022 transitions. Word has length 219 [2025-03-03 20:55:02,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:55:02,889 INFO L471 AbstractCegarLoop]: Abstraction has 1985 states and 3022 transitions. [2025-03-03 20:55:02,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 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 20:55:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 3022 transitions. [2025-03-03 20:55:02,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:55:02,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:55:02,891 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, 1, 1, 1, 1, 1] [2025-03-03 20:55:02,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 20:55:02,892 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:55:02,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:55:02,892 INFO L85 PathProgramCache]: Analyzing trace with hash -855898854, now seen corresponding path program 1 times [2025-03-03 20:55:02,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:55:02,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174433659] [2025-03-03 20:55:02,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:55:02,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:55:02,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:55:02,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:55:02,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:02,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:55:03,136 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 20:55:03,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:55:03,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174433659] [2025-03-03 20:55:03,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174433659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:55:03,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:55:03,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 20:55:03,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221269967] [2025-03-03 20:55:03,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:55:03,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:55:03,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:55:03,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:55:03,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:55:03,138 INFO L87 Difference]: Start difference. First operand 1985 states and 3022 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 20:55:04,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:55:04,058 INFO L93 Difference]: Finished difference Result 5016 states and 7574 transitions. [2025-03-03 20:55:04,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 20:55:04,059 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 219 [2025-03-03 20:55:04,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:55:04,069 INFO L225 Difference]: With dead ends: 5016 [2025-03-03 20:55:04,069 INFO L226 Difference]: Without dead ends: 3034 [2025-03-03 20:55:04,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:55:04,073 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 542 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:55:04,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 753 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:55:04,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3034 states. [2025-03-03 20:55:04,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3034 to 1968. [2025-03-03 20:55:04,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1968 states, 1825 states have (on average 1.496986301369863) internal successors, (2732), 1827 states have internal predecessors, (2732), 132 states have call successors, (132), 10 states have call predecessors, (132), 10 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 20:55:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 2996 transitions. [2025-03-03 20:55:04,239 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 2996 transitions. Word has length 219 [2025-03-03 20:55:04,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:55:04,239 INFO L471 AbstractCegarLoop]: Abstraction has 1968 states and 2996 transitions. [2025-03-03 20:55:04,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 20:55:04,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2996 transitions. [2025-03-03 20:55:04,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:55:04,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:55:04,242 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, 1, 1, 1, 1, 1] [2025-03-03 20:55:04,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 20:55:04,242 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:55:04,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:55:04,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1007945020, now seen corresponding path program 1 times [2025-03-03 20:55:04,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:55:04,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772569985] [2025-03-03 20:55:04,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:55:04,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:55:04,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:55:04,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:55:04,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:04,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:55:04,591 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 20:55:04,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:55:04,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772569985] [2025-03-03 20:55:04,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772569985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:55:04,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:55:04,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 20:55:04,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160563772] [2025-03-03 20:55:04,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:55:04,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:55:04,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:55:04,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:55:04,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:55:04,593 INFO L87 Difference]: Start difference. First operand 1968 states and 2996 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 20:55:05,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:55:05,464 INFO L93 Difference]: Finished difference Result 5135 states and 7762 transitions. [2025-03-03 20:55:05,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 20:55:05,465 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 219 [2025-03-03 20:55:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:55:05,474 INFO L225 Difference]: With dead ends: 5135 [2025-03-03 20:55:05,475 INFO L226 Difference]: Without dead ends: 3170 [2025-03-03 20:55:05,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:55:05,478 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 434 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:55:05,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1553 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:55:05,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2025-03-03 20:55:05,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 2069. [2025-03-03 20:55:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 1926 states have (on average 1.4994807892004154) internal successors, (2888), 1928 states have internal predecessors, (2888), 132 states have call successors, (132), 10 states have call predecessors, (132), 10 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 20:55:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 3152 transitions. [2025-03-03 20:55:05,605 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 3152 transitions. Word has length 219 [2025-03-03 20:55:05,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:55:05,605 INFO L471 AbstractCegarLoop]: Abstraction has 2069 states and 3152 transitions. [2025-03-03 20:55:05,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 20:55:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 3152 transitions. [2025-03-03 20:55:05,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:55:05,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:55:05,608 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, 1, 1, 1, 1, 1] [2025-03-03 20:55:05,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 20:55:05,608 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:55:05,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:55:05,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1210932184, now seen corresponding path program 1 times [2025-03-03 20:55:05,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:55:05,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130327869] [2025-03-03 20:55:05,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:55:05,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:55:05,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:55:05,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:55:05,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:05,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:55:05,852 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 20:55:05,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:55:05,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130327869] [2025-03-03 20:55:05,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130327869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:55:05,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:55:05,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:55:05,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922656441] [2025-03-03 20:55:05,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:55:05,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:55:05,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:55:05,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:55:05,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:55:05,854 INFO L87 Difference]: Start difference. First operand 2069 states and 3152 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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 20:55:06,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:55:06,213 INFO L93 Difference]: Finished difference Result 4999 states and 7585 transitions. [2025-03-03 20:55:06,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:55:06,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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 219 [2025-03-03 20:55:06,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:55:06,226 INFO L225 Difference]: With dead ends: 4999 [2025-03-03 20:55:06,227 INFO L226 Difference]: Without dead ends: 2933 [2025-03-03 20:55:06,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:55:06,229 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 149 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:55:06,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1182 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:55:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2025-03-03 20:55:06,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 2025. [2025-03-03 20:55:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2025 states, 1882 states have (on average 1.4872476089266737) internal successors, (2799), 1884 states have internal predecessors, (2799), 132 states have call successors, (132), 10 states have call predecessors, (132), 10 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 20:55:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 3063 transitions. [2025-03-03 20:55:06,330 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 3063 transitions. Word has length 219 [2025-03-03 20:55:06,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:55:06,331 INFO L471 AbstractCegarLoop]: Abstraction has 2025 states and 3063 transitions. [2025-03-03 20:55:06,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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 20:55:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 3063 transitions. [2025-03-03 20:55:06,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:55:06,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:55:06,333 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, 1, 1, 1, 1, 1] [2025-03-03 20:55:06,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 20:55:06,333 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:55:06,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:55:06,334 INFO L85 PathProgramCache]: Analyzing trace with hash -235300548, now seen corresponding path program 1 times [2025-03-03 20:55:06,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:55:06,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415523859] [2025-03-03 20:55:06,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:55:06,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:55:06,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:55:06,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:55:06,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:06,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:55:06,594 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 20:55:06,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:55:06,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415523859] [2025-03-03 20:55:06,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415523859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:55:06,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:55:06,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:55:06,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988493549] [2025-03-03 20:55:06,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:55:06,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:55:06,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:55:06,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:55:06,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:55:06,596 INFO L87 Difference]: Start difference. First operand 2025 states and 3063 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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 20:55:07,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:55:07,376 INFO L93 Difference]: Finished difference Result 4590 states and 6864 transitions. [2025-03-03 20:55:07,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:55:07,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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 219 [2025-03-03 20:55:07,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:55:07,392 INFO L225 Difference]: With dead ends: 4590 [2025-03-03 20:55:07,392 INFO L226 Difference]: Without dead ends: 3331 [2025-03-03 20:55:07,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:55:07,395 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 509 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:55:07,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1230 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:55:07,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2025-03-03 20:55:07,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 2087. [2025-03-03 20:55:07,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2087 states, 1944 states have (on average 1.4912551440329218) internal successors, (2899), 1946 states have internal predecessors, (2899), 132 states have call successors, (132), 10 states have call predecessors, (132), 10 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 20:55:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 3163 transitions. [2025-03-03 20:55:07,514 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 3163 transitions. Word has length 219 [2025-03-03 20:55:07,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:55:07,515 INFO L471 AbstractCegarLoop]: Abstraction has 2087 states and 3163 transitions. [2025-03-03 20:55:07,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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 20:55:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 3163 transitions. [2025-03-03 20:55:07,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:55:07,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:55:07,518 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, 1, 1, 1, 1, 1] [2025-03-03 20:55:07,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 20:55:07,519 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:55:07,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:55:07,519 INFO L85 PathProgramCache]: Analyzing trace with hash -745834725, now seen corresponding path program 1 times [2025-03-03 20:55:07,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:55:07,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291660241] [2025-03-03 20:55:07,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:55:07,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:55:07,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:55:07,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:55:07,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:07,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:55:07,738 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 20:55:07,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:55:07,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291660241] [2025-03-03 20:55:07,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291660241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:55:07,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:55:07,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:55:07,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571035123] [2025-03-03 20:55:07,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:55:07,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:55:07,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:55:07,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:55:07,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:55:07,740 INFO L87 Difference]: Start difference. First operand 2087 states and 3163 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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 20:55:08,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:55:08,306 INFO L93 Difference]: Finished difference Result 3958 states and 5949 transitions. [2025-03-03 20:55:08,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:55:08,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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 219 [2025-03-03 20:55:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:55:08,313 INFO L225 Difference]: With dead ends: 3958 [2025-03-03 20:55:08,313 INFO L226 Difference]: Without dead ends: 2637 [2025-03-03 20:55:08,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:55:08,315 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 289 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:55:08,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1330 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:55:08,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2025-03-03 20:55:08,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 2087. [2025-03-03 20:55:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2087 states, 1944 states have (on average 1.4912551440329218) internal successors, (2899), 1946 states have internal predecessors, (2899), 132 states have call successors, (132), 10 states have call predecessors, (132), 10 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 20:55:08,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 3163 transitions. [2025-03-03 20:55:08,419 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 3163 transitions. Word has length 219 [2025-03-03 20:55:08,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:55:08,420 INFO L471 AbstractCegarLoop]: Abstraction has 2087 states and 3163 transitions. [2025-03-03 20:55:08,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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 20:55:08,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 3163 transitions. [2025-03-03 20:55:08,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:55:08,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:55:08,423 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, 1, 1, 1, 1, 1] [2025-03-03 20:55:08,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 20:55:08,423 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:55:08,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:55:08,424 INFO L85 PathProgramCache]: Analyzing trace with hash 703931615, now seen corresponding path program 1 times [2025-03-03 20:55:08,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:55:08,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587161293] [2025-03-03 20:55:08,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:55:08,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:55:08,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:55:08,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:55:08,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:08,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:55:09,033 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 20:55:09,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:55:09,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587161293] [2025-03-03 20:55:09,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587161293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:55:09,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:55:09,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 20:55:09,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505071820] [2025-03-03 20:55:09,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:55:09,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:55:09,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:55:09,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:55:09,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:55:09,035 INFO L87 Difference]: Start difference. First operand 2087 states and 3163 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 20:55:09,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:55:09,698 INFO L93 Difference]: Finished difference Result 4709 states and 7089 transitions. [2025-03-03 20:55:09,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:55:09,698 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 219 [2025-03-03 20:55:09,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:55:09,708 INFO L225 Difference]: With dead ends: 4709 [2025-03-03 20:55:09,709 INFO L226 Difference]: Without dead ends: 2625 [2025-03-03 20:55:09,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:55:09,712 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 495 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:55:09,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 888 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:55:09,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2025-03-03 20:55:09,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2093. [2025-03-03 20:55:09,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 1950 states have (on average 1.4912820512820513) internal successors, (2908), 1952 states have internal predecessors, (2908), 132 states have call successors, (132), 10 states have call predecessors, (132), 10 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 20:55:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 3172 transitions. [2025-03-03 20:55:09,817 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 3172 transitions. Word has length 219 [2025-03-03 20:55:09,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:55:09,818 INFO L471 AbstractCegarLoop]: Abstraction has 2093 states and 3172 transitions. [2025-03-03 20:55:09,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 20:55:09,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 3172 transitions. [2025-03-03 20:55:09,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:55:09,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:55:09,820 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, 1, 1, 1, 1, 1] [2025-03-03 20:55:09,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 20:55:09,820 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:55:09,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:55:09,821 INFO L85 PathProgramCache]: Analyzing trace with hash -989078812, now seen corresponding path program 1 times [2025-03-03 20:55:09,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:55:09,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987097426] [2025-03-03 20:55:09,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:55:09,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:55:09,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:55:09,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:55:09,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:09,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:55:09,867 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 20:55:09,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:55:09,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987097426] [2025-03-03 20:55:09,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987097426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:55:09,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:55:09,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:55:09,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206467999] [2025-03-03 20:55:09,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:55:09,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:55:09,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:55:09,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:55:09,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:55:09,868 INFO L87 Difference]: Start difference. First operand 2093 states and 3172 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 20:55:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:55:10,084 INFO L93 Difference]: Finished difference Result 4577 states and 6872 transitions. [2025-03-03 20:55:10,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:55:10,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 219 [2025-03-03 20:55:10,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:55:10,094 INFO L225 Difference]: With dead ends: 4577 [2025-03-03 20:55:10,095 INFO L226 Difference]: Without dead ends: 2487 [2025-03-03 20:55:10,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:55:10,099 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 142 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:55:10,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 318 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:55:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2025-03-03 20:55:10,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2129. [2025-03-03 20:55:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2129 states, 1986 states have (on average 1.445115810674723) internal successors, (2870), 1988 states have internal predecessors, (2870), 132 states have call successors, (132), 10 states have call predecessors, (132), 10 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 20:55:10,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 3134 transitions. [2025-03-03 20:55:10,206 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 3134 transitions. Word has length 219 [2025-03-03 20:55:10,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:55:10,207 INFO L471 AbstractCegarLoop]: Abstraction has 2129 states and 3134 transitions. [2025-03-03 20:55:10,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 20:55:10,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 3134 transitions. [2025-03-03 20:55:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:55:10,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:55:10,209 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, 1, 1, 1, 1, 1] [2025-03-03 20:55:10,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 20:55:10,209 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:55:10,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:55:10,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1905570230, now seen corresponding path program 1 times [2025-03-03 20:55:10,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:55:10,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350989537] [2025-03-03 20:55:10,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:55:10,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:55:10,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:55:10,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:55:10,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:10,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:55:10,269 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 20:55:10,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:55:10,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350989537] [2025-03-03 20:55:10,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350989537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:55:10,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:55:10,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:55:10,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472366074] [2025-03-03 20:55:10,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:55:10,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:55:10,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:55:10,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:55:10,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:55:10,271 INFO L87 Difference]: Start difference. First operand 2129 states and 3134 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 20:55:10,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:55:10,493 INFO L93 Difference]: Finished difference Result 4577 states and 6718 transitions. [2025-03-03 20:55:10,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:55:10,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 219 [2025-03-03 20:55:10,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:55:10,499 INFO L225 Difference]: With dead ends: 4577 [2025-03-03 20:55:10,499 INFO L226 Difference]: Without dead ends: 2451 [2025-03-03 20:55:10,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:55:10,503 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 126 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:55:10,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 431 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:55:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2025-03-03 20:55:10,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 1997. [2025-03-03 20:55:10,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1854 states have (on average 1.436353829557713) internal successors, (2663), 1856 states have internal predecessors, (2663), 132 states have call successors, (132), 10 states have call predecessors, (132), 10 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 20:55:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2927 transitions. [2025-03-03 20:55:10,610 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2927 transitions. Word has length 219 [2025-03-03 20:55:10,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:55:10,610 INFO L471 AbstractCegarLoop]: Abstraction has 1997 states and 2927 transitions. [2025-03-03 20:55:10,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 20:55:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2927 transitions. [2025-03-03 20:55:10,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:55:10,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:55:10,612 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, 1, 1, 1, 1, 1] [2025-03-03 20:55:10,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 20:55:10,612 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:55:10,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:55:10,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1853607967, now seen corresponding path program 1 times [2025-03-03 20:55:10,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:55:10,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130890614] [2025-03-03 20:55:10,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:55:10,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:55:10,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:55:10,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:55:10,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:10,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:55:10,985 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 20:55:10,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:55:10,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130890614] [2025-03-03 20:55:10,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130890614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:55:10,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:55:10,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 20:55:10,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899158033] [2025-03-03 20:55:10,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:55:10,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:55:10,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:55:10,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:55:10,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:55:10,987 INFO L87 Difference]: Start difference. First operand 1997 states and 2927 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 20:55:11,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:55:11,781 INFO L93 Difference]: Finished difference Result 3968 states and 5804 transitions. [2025-03-03 20:55:11,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:55:11,784 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 219 [2025-03-03 20:55:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:55:11,788 INFO L225 Difference]: With dead ends: 3968 [2025-03-03 20:55:11,788 INFO L226 Difference]: Without dead ends: 1909 [2025-03-03 20:55:11,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:55:11,791 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 350 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:55:11,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1046 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:55:11,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2025-03-03 20:55:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1840. [2025-03-03 20:55:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1697 states have (on average 1.4278137890394815) internal successors, (2423), 1699 states have internal predecessors, (2423), 132 states have call successors, (132), 10 states have call predecessors, (132), 10 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 20:55:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2687 transitions. [2025-03-03 20:55:11,899 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2687 transitions. Word has length 219 [2025-03-03 20:55:11,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:55:11,899 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2687 transitions. [2025-03-03 20:55:11,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 20:55:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2687 transitions. [2025-03-03 20:55:11,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 20:55:11,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:55:11,901 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, 1, 1, 1, 1, 1, 1] [2025-03-03 20:55:11,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 20:55:11,901 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:55:11,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:55:11,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1954671190, now seen corresponding path program 1 times [2025-03-03 20:55:11,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:55:11,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130588808] [2025-03-03 20:55:11,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:55:11,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:55:11,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 20:55:11,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 20:55:11,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:11,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:55:12,135 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 20:55:12,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:55:12,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130588808] [2025-03-03 20:55:12,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130588808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:55:12,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:55:12,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 20:55:12,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071669952] [2025-03-03 20:55:12,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:55:12,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:55:12,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:55:12,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:55:12,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:55:12,136 INFO L87 Difference]: Start difference. First operand 1840 states and 2687 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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 20:55:12,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:55:12,897 INFO L93 Difference]: Finished difference Result 4440 states and 6469 transitions. [2025-03-03 20:55:12,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:55:12,897 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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 220 [2025-03-03 20:55:12,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:55:12,903 INFO L225 Difference]: With dead ends: 4440 [2025-03-03 20:55:12,903 INFO L226 Difference]: Without dead ends: 2603 [2025-03-03 20:55:12,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:55:12,906 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 393 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:55:12,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1698 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:55:12,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2025-03-03 20:55:13,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 1775. [2025-03-03 20:55:13,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1632 states have (on average 1.4166666666666667) internal successors, (2312), 1634 states have internal predecessors, (2312), 132 states have call successors, (132), 10 states have call predecessors, (132), 10 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 20:55:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2576 transitions. [2025-03-03 20:55:13,032 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2576 transitions. Word has length 220 [2025-03-03 20:55:13,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:55:13,033 INFO L471 AbstractCegarLoop]: Abstraction has 1775 states and 2576 transitions. [2025-03-03 20:55:13,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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 20:55:13,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2576 transitions. [2025-03-03 20:55:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 20:55:13,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:55:13,034 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, 1, 1, 1, 1, 1, 1] [2025-03-03 20:55:13,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 20:55:13,035 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:55:13,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:55:13,035 INFO L85 PathProgramCache]: Analyzing trace with hash 316837547, now seen corresponding path program 1 times [2025-03-03 20:55:13,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:55:13,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380688309] [2025-03-03 20:55:13,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:55:13,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:55:13,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 20:55:13,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 20:55:13,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:13,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:55:13,170 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 20:55:13,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:55:13,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380688309] [2025-03-03 20:55:13,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380688309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:55:13,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:55:13,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:55:13,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501792095] [2025-03-03 20:55:13,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:55:13,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:55:13,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:55:13,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:55:13,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:55:13,172 INFO L87 Difference]: Start difference. First operand 1775 states and 2576 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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 20:55:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:55:13,848 INFO L93 Difference]: Finished difference Result 4179 states and 6032 transitions. [2025-03-03 20:55:13,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:55:13,850 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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 220 [2025-03-03 20:55:13,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:55:13,855 INFO L225 Difference]: With dead ends: 4179 [2025-03-03 20:55:13,855 INFO L226 Difference]: Without dead ends: 2389 [2025-03-03 20:55:13,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:55:13,858 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 410 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:55:13,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1464 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:55:13,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2389 states. [2025-03-03 20:55:13,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2389 to 1675. [2025-03-03 20:55:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1532 states have (on average 1.402088772845953) internal successors, (2148), 1534 states have internal predecessors, (2148), 132 states have call successors, (132), 10 states have call predecessors, (132), 10 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 20:55:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2412 transitions. [2025-03-03 20:55:13,967 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2412 transitions. Word has length 220 [2025-03-03 20:55:13,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:55:13,968 INFO L471 AbstractCegarLoop]: Abstraction has 1675 states and 2412 transitions. [2025-03-03 20:55:13,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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 20:55:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2412 transitions. [2025-03-03 20:55:13,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 20:55:13,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:55:13,970 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, 1, 1, 1, 1, 1, 1] [2025-03-03 20:55:13,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 20:55:13,970 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:55:13,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:55:13,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2125833385, now seen corresponding path program 1 times [2025-03-03 20:55:13,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:55:13,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599812569] [2025-03-03 20:55:13,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:55:13,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:55:13,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 20:55:13,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 20:55:13,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:13,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:55:14,402 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 20:55:14,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:55:14,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599812569] [2025-03-03 20:55:14,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599812569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:55:14,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:55:14,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 20:55:14,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034435796] [2025-03-03 20:55:14,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:55:14,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 20:55:14,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:55:14,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 20:55:14,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:55:14,404 INFO L87 Difference]: Start difference. First operand 1675 states and 2412 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 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 20:55:15,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:55:15,040 INFO L93 Difference]: Finished difference Result 3712 states and 5342 transitions. [2025-03-03 20:55:15,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 20:55:15,040 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 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 220 [2025-03-03 20:55:15,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:55:15,046 INFO L225 Difference]: With dead ends: 3712 [2025-03-03 20:55:15,046 INFO L226 Difference]: Without dead ends: 2566 [2025-03-03 20:55:15,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:55:15,048 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 385 mSDsluCounter, 1427 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:55:15,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1717 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:55:15,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2025-03-03 20:55:15,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 1658. [2025-03-03 20:55:15,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1515 states have (on average 1.3993399339933994) internal successors, (2120), 1517 states have internal predecessors, (2120), 132 states have call successors, (132), 10 states have call predecessors, (132), 10 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 20:55:15,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2384 transitions. [2025-03-03 20:55:15,157 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2384 transitions. Word has length 220 [2025-03-03 20:55:15,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:55:15,157 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2384 transitions. [2025-03-03 20:55:15,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 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 20:55:15,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2384 transitions. [2025-03-03 20:55:15,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 20:55:15,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:55:15,159 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, 1, 1, 1, 1, 1, 1] [2025-03-03 20:55:15,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 20:55:15,159 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:55:15,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:55:15,159 INFO L85 PathProgramCache]: Analyzing trace with hash -568217388, now seen corresponding path program 1 times [2025-03-03 20:55:15,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:55:15,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262802566] [2025-03-03 20:55:15,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:55:15,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:55:15,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 20:55:15,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 20:55:15,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:15,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:55:16,162 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 20:55:16,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:55:16,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262802566] [2025-03-03 20:55:16,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262802566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:55:16,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:55:16,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 20:55:16,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842656505] [2025-03-03 20:55:16,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:55:16,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:55:16,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:55:16,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:55:16,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:55:16,164 INFO L87 Difference]: Start difference. First operand 1658 states and 2384 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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 20:55:18,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:55:18,786 INFO L93 Difference]: Finished difference Result 5785 states and 8266 transitions. [2025-03-03 20:55:18,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 20:55:18,787 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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 220 [2025-03-03 20:55:18,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:55:18,796 INFO L225 Difference]: With dead ends: 5785 [2025-03-03 20:55:18,797 INFO L226 Difference]: Without dead ends: 4130 [2025-03-03 20:55:18,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:55:18,800 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1019 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:55:18,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 938 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 20:55:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4130 states. [2025-03-03 20:55:19,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4130 to 2730. [2025-03-03 20:55:19,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2730 states, 2529 states have (on average 1.4116251482799524) internal successors, (3570), 2537 states have internal predecessors, (3570), 184 states have call successors, (184), 16 states have call predecessors, (184), 16 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-03-03 20:55:19,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 3938 transitions. [2025-03-03 20:55:19,023 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 3938 transitions. Word has length 220 [2025-03-03 20:55:19,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:55:19,023 INFO L471 AbstractCegarLoop]: Abstraction has 2730 states and 3938 transitions. [2025-03-03 20:55:19,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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 20:55:19,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 3938 transitions. [2025-03-03 20:55:19,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 20:55:19,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:55:19,025 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, 1, 1, 1, 1, 1, 1] [2025-03-03 20:55:19,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 20:55:19,026 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:55:19,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:55:19,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1565289741, now seen corresponding path program 1 times [2025-03-03 20:55:19,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:55:19,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455726347] [2025-03-03 20:55:19,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:55:19,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:55:19,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 20:55:19,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 20:55:19,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:19,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:55:19,336 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 20:55:19,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:55:19,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455726347] [2025-03-03 20:55:19,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455726347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:55:19,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:55:19,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 20:55:19,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910522125] [2025-03-03 20:55:19,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:55:19,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:55:19,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:55:19,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:55:19,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:55:19,337 INFO L87 Difference]: Start difference. First operand 2730 states and 3938 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 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 20:55:20,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:55:20,635 INFO L93 Difference]: Finished difference Result 6073 states and 8715 transitions. [2025-03-03 20:55:20,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 20:55:20,635 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 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 220 [2025-03-03 20:55:20,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:55:20,654 INFO L225 Difference]: With dead ends: 6073 [2025-03-03 20:55:20,654 INFO L226 Difference]: Without dead ends: 3346 [2025-03-03 20:55:20,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:55:20,657 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 467 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:55:20,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 657 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:55:20,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2025-03-03 20:55:20,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2718. [2025-03-03 20:55:20,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2718 states, 2517 states have (on average 1.4088200238379023) internal successors, (3546), 2525 states have internal predecessors, (3546), 184 states have call successors, (184), 16 states have call predecessors, (184), 16 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-03-03 20:55:20,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 3914 transitions. [2025-03-03 20:55:20,892 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 3914 transitions. Word has length 220 [2025-03-03 20:55:20,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:55:20,892 INFO L471 AbstractCegarLoop]: Abstraction has 2718 states and 3914 transitions. [2025-03-03 20:55:20,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 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 20:55:20,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 3914 transitions. [2025-03-03 20:55:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 20:55:20,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:55:20,894 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, 1, 1, 1, 1, 1, 1] [2025-03-03 20:55:20,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 20:55:20,895 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:55:20,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:55:20,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1412689259, now seen corresponding path program 1 times [2025-03-03 20:55:20,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:55:20,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546830189] [2025-03-03 20:55:20,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:55:20,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:55:20,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 20:55:20,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 20:55:20,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:20,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:55:21,081 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 20:55:21,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:55:21,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546830189] [2025-03-03 20:55:21,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546830189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:55:21,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:55:21,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:55:21,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223017569] [2025-03-03 20:55:21,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:55:21,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:55:21,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:55:21,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:55:21,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:55:21,083 INFO L87 Difference]: Start difference. First operand 2718 states and 3914 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 20:55:21,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:55:21,523 INFO L93 Difference]: Finished difference Result 5295 states and 7625 transitions. [2025-03-03 20:55:21,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:55:21,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 220 [2025-03-03 20:55:21,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:55:21,529 INFO L225 Difference]: With dead ends: 5295 [2025-03-03 20:55:21,529 INFO L226 Difference]: Without dead ends: 3450 [2025-03-03 20:55:21,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:55:21,531 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 127 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:55:21,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 544 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:55:21,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2025-03-03 20:55:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 2782. [2025-03-03 20:55:21,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2782 states, 2547 states have (on average 1.404004711425206) internal successors, (3576), 2555 states have internal predecessors, (3576), 216 states have call successors, (216), 18 states have call predecessors, (216), 18 states have return successors, (216), 208 states have call predecessors, (216), 216 states have call successors, (216) [2025-03-03 20:55:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2782 states and 4008 transitions. [2025-03-03 20:55:21,872 INFO L78 Accepts]: Start accepts. Automaton has 2782 states and 4008 transitions. Word has length 220 [2025-03-03 20:55:21,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:55:21,873 INFO L471 AbstractCegarLoop]: Abstraction has 2782 states and 4008 transitions. [2025-03-03 20:55:21,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 20:55:21,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2782 states and 4008 transitions. [2025-03-03 20:55:21,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 20:55:21,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:55:21,875 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, 1, 1, 1, 1, 1, 1] [2025-03-03 20:55:21,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 20:55:21,875 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:55:21,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:55:21,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1853429334, now seen corresponding path program 1 times [2025-03-03 20:55:21,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:55:21,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287597513] [2025-03-03 20:55:21,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:55:21,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:55:21,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 20:55:21,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 20:55:21,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:21,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:55:21,957 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 20:55:21,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 20:55:22,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 20:55:22,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:22,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:55:22,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 20:55:22,125 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 20:55:22,126 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 20:55:22,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 20:55:22,131 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:55:22,249 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 20:55:22,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 08:55:22 BoogieIcfgContainer [2025-03-03 20:55:22,255 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 20:55:22,256 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 20:55:22,256 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 20:55:22,256 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 20:55:22,257 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:54:48" (3/4) ... [2025-03-03 20:55:22,259 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 20:55:22,260 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 20:55:22,261 INFO L158 Benchmark]: Toolchain (without parser) took 34748.92ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 130.1MB in the beginning and 63.5MB in the end (delta: 66.6MB). Peak memory consumption was 103.4MB. Max. memory is 16.1GB. [2025-03-03 20:55:22,261 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:55:22,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.22ms. Allocated memory is still 167.8MB. Free memory was 130.1MB in the beginning and 113.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 20:55:22,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.83ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 108.8MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:55:22,262 INFO L158 Benchmark]: Boogie Preprocessor took 52.56ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 103.1MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 20:55:22,262 INFO L158 Benchmark]: IcfgBuilder took 506.49ms. Allocated memory is still 167.8MB. Free memory was 103.1MB in the beginning and 70.5MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 20:55:22,262 INFO L158 Benchmark]: TraceAbstraction took 33902.42ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 69.6MB in the beginning and 63.5MB in the end (delta: 6.1MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2025-03-03 20:55:22,262 INFO L158 Benchmark]: Witness Printer took 4.00ms. Allocated memory is still 201.3MB. Free memory was 63.5MB in the beginning and 63.5MB in the end (delta: 60.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 20:55:22,263 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.20ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.22ms. Allocated memory is still 167.8MB. Free memory was 130.1MB in the beginning and 113.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.83ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 108.8MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.56ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 103.1MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 506.49ms. Allocated memory is still 167.8MB. Free memory was 103.1MB in the beginning and 70.5MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 33902.42ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 69.6MB in the beginning and 63.5MB in the end (delta: 6.1MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. * Witness Printer took 4.00ms. Allocated memory is still 201.3MB. Free memory was 63.5MB in the beginning and 63.5MB in the end (delta: 60.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 206, overapproximation of someUnaryDOUBLEoperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 206, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 181, overapproximation of someBinaryDOUBLEComparisonOperation at line 167, overapproximation of someBinaryDOUBLEComparisonOperation at line 137, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 161, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 163. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] unsigned char var_1_33 = 8; [L44] unsigned char var_1_38 = 8; [L45] unsigned char var_1_39 = 10; [L46] double var_1_40 = 8.35; [L47] double var_1_41 = 63.75; [L48] double var_1_42 = -0.125; [L49] double var_1_43 = -0.8; [L50] double var_1_44 = -0.5; [L51] unsigned short int var_1_45 = 50; [L52] unsigned char var_1_46 = 0; [L53] unsigned char var_1_47 = 5; [L54] unsigned char var_1_48 = 1; [L55] signed char var_1_49 = -16; [L56] signed char var_1_50 = 2; [L57] signed char var_1_51 = 16; [L58] signed char var_1_52 = 0; [L59] signed long int var_1_53 = 256; [L60] double var_1_54 = 1.25; [L61] unsigned long int var_1_55 = 5; [L62] signed long int last_1_var_1_1 = 64; [L63] unsigned char last_1_var_1_13 = 64; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L210] isInitial = 1 [L211] FCALL initially() [L212] COND TRUE 1 [L213] CALL updateLastVariables() [L202] last_1_var_1_1 = var_1_1 [L203] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L213] RET updateLastVariables() [L214] CALL updateVariables() [L147] var_1_7 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L148] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L149] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L149] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L150] var_1_15 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L151] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L152] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L152] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L153] var_1_16 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L154] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L155] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L155] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L156] var_1_18 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L157] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L158] var_1_19 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L159] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L160] var_1_20 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L161] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L162] var_1_21 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L164] var_1_22 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L165] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] var_1_23 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L167] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L168] var_1_27 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L169] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L170] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L170] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L171] var_1_28 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L172] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L173] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L173] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L174] var_1_38 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L175] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L176] CALL assume_abort_if_not(var_1_38 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L176] RET assume_abort_if_not(var_1_38 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L177] var_1_39 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L178] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L179] CALL assume_abort_if_not(var_1_39 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L179] RET assume_abort_if_not(var_1_39 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L180] var_1_41 = __VERIFIER_nondet_double() [L181] CALL assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L181] RET assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L182] var_1_42 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_42 >= -922337.2036854765600e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L183] RET assume_abort_if_not((var_1_42 >= -922337.2036854765600e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L184] var_1_43 = __VERIFIER_nondet_double() [L185] CALL assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L185] RET assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L186] var_1_44 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_44 >= -461168.6018427382800e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L187] RET assume_abort_if_not((var_1_44 >= -461168.6018427382800e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L188] var_1_47 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_47 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L189] RET assume_abort_if_not(var_1_47 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L190] CALL assume_abort_if_not(var_1_47 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L190] RET assume_abort_if_not(var_1_47 <= 127) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L191] var_1_50 = __VERIFIER_nondet_char() [L192] CALL assume_abort_if_not(var_1_50 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L192] RET assume_abort_if_not(var_1_50 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L193] CALL assume_abort_if_not(var_1_50 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L193] RET assume_abort_if_not(var_1_50 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L194] var_1_51 = __VERIFIER_nondet_char() [L195] CALL assume_abort_if_not(var_1_51 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L195] RET assume_abort_if_not(var_1_51 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L196] CALL assume_abort_if_not(var_1_51 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L196] RET assume_abort_if_not(var_1_51 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L197] var_1_52 = __VERIFIER_nondet_char() [L198] CALL assume_abort_if_not(var_1_52 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L198] RET assume_abort_if_not(var_1_52 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L199] CALL assume_abort_if_not(var_1_52 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L199] RET assume_abort_if_not(var_1_52 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L214] RET updateVariables() [L215] CALL step() [L67] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L68] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L71] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L72] COND FALSE !(\read(var_1_7)) [L75] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L77] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L80] var_1_32 = var_1_16 [L81] var_1_30 = var_1_32 [L82] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L83] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L83] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L84] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L86] COND TRUE var_1_11 >= var_1_30 [L87] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L89] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L89] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L90] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L98] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L99] COND TRUE ! var_1_7 [L100] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L108] EXPR var_1_1 ^ var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L108] EXPR var_1_13 | var_1_31 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L108] COND TRUE (var_1_1 ^ var_1_32) < (var_1_13 | var_1_31) [L109] var_1_33 = ((((var_1_38) > (var_1_39)) ? (var_1_38) : (var_1_39))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L113] COND TRUE (-32 & var_1_38) > var_1_31 [L114] var_1_40 = ((((var_1_41) > (var_1_42)) ? (var_1_41) : (var_1_42))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L118] COND TRUE var_1_44 >= ((((var_1_41) < 0 ) ? -(var_1_41) : (var_1_41))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L119] COND FALSE !(var_1_1 > var_1_32) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L129] COND FALSE !(var_1_44 > (var_1_43 + var_1_41)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L136] var_1_48 = var_1_39 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=4, var_1_49=-16, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L137] COND TRUE var_1_41 < var_1_29 [L138] var_1_49 = ((var_1_50 - var_1_51) + var_1_52) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=4, var_1_49=-1, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L142] var_1_53 = var_1_32 [L143] var_1_54 = var_1_44 [L144] var_1_55 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=4, var_1_49=-1, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=0, var_1_54=506, var_1_55=64, var_1_7=0] [L215] RET step() [L216] CALL, EXPR property() [L206] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=4, var_1_49=-1, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=0, var_1_54=506, var_1_55=64, var_1_7=0] [L206] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=4, var_1_49=-1, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=0, var_1_54=506, var_1_55=64, var_1_7=0] [L206] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=4, var_1_49=-1, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=0, var_1_54=506, var_1_55=64, var_1_7=0] [L206] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=4, var_1_49=-1, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=0, var_1_54=506, var_1_55=64, var_1_7=0] [L206-L207] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L216] RET, EXPR property() [L216] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=4, var_1_49=-1, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=0, var_1_54=506, var_1_55=64, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=4, var_1_49=-1, var_1_50=62, var_1_51=0, var_1_52=-63, var_1_53=0, var_1_54=506, var_1_55=64, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.7s, OverallIterations: 30, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10545 SdHoareTripleChecker+Valid, 12.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10545 mSDsluCounter, 25802 SdHoareTripleChecker+Invalid, 10.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18836 mSDsCounter, 2494 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15889 IncrementalHoareTripleChecker+Invalid, 18383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2494 mSolverCounterUnsat, 6966 mSDtfsCounter, 15889 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 576 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2782occurred in iteration=29, InterpolantAutomatonStates: 213, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 29 MinimizatonAttempts, 15338 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 6769 NumberOfCodeBlocks, 6769 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 6519 ConstructedInterpolants, 0 QuantifiedInterpolants, 22537 SizeOfPredicates, 0 NumberOfNonLiveVariables, 507 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 30 InterpolantComputations, 29 PerfectInterpolantSequences, 59458/59520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 20:55:22,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.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 2b25a2230e8cd5e14dc98a853cb32c06f85de9122996251da70e4b6160e146c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:55:24,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:55:24,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 20:55:24,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:55:24,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:55:24,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:55:24,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:55:24,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:55:24,247 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:55:24,248 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:55:24,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:55:24,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:55:24,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:55:24,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:55:24,248 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:55:24,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:55:24,248 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:55:24,248 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:55:24,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:55:24,248 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:55:24,248 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:55:24,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:55:24,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:55:24,248 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 20:55:24,249 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 20:55:24,249 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 20:55:24,249 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:55:24,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:55:24,249 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:55:24,249 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:55:24,249 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:55:24,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:55:24,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:55:24,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:55:24,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:55:24,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:55:24,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:55:24,249 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:55:24,249 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:55:24,251 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 20:55:24,251 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 20:55:24,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:55:24,251 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:55:24,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:55:24,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:55:24,252 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 -> 2b25a2230e8cd5e14dc98a853cb32c06f85de9122996251da70e4b6160e146c4 [2025-03-03 20:55:24,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:55:24,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:55:24,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:55:24,514 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:55:24,514 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:55:24,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2025-03-03 20:55:25,661 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ec1b0afe/dcc8f528b53a4cabb6ef93a9d693b6a7/FLAG6b9f4cdca [2025-03-03 20:55:25,893 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:55:25,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2025-03-03 20:55:25,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ec1b0afe/dcc8f528b53a4cabb6ef93a9d693b6a7/FLAG6b9f4cdca [2025-03-03 20:55:26,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ec1b0afe/dcc8f528b53a4cabb6ef93a9d693b6a7 [2025-03-03 20:55:26,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:55:26,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:55:26,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:55:26,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:55:26,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:55:26,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:55:26" (1/1) ... [2025-03-03 20:55:26,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c7762b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:55:26, skipping insertion in model container [2025-03-03 20:55:26,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:55:26" (1/1) ... [2025-03-03 20:55:26,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:55:26,362 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i[919,932] [2025-03-03 20:55:26,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:55:26,436 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:55:26,443 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i[919,932] [2025-03-03 20:55:26,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:55:26,495 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:55:26,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:55:26 WrapperNode [2025-03-03 20:55:26,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:55:26,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:55:26,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:55:26,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:55:26,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:55:26" (1/1) ... [2025-03-03 20:55:26,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:55:26" (1/1) ... [2025-03-03 20:55:26,535 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 220 [2025-03-03 20:55:26,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:55:26,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:55:26,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:55:26,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:55:26,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:55:26" (1/1) ... [2025-03-03 20:55:26,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:55:26" (1/1) ... [2025-03-03 20:55:26,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:55:26" (1/1) ... [2025-03-03 20:55:26,556 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:55:26,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:55:26" (1/1) ... [2025-03-03 20:55:26,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:55:26" (1/1) ... [2025-03-03 20:55:26,565 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:55:26" (1/1) ... [2025-03-03 20:55:26,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:55:26" (1/1) ... [2025-03-03 20:55:26,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:55:26" (1/1) ... [2025-03-03 20:55:26,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:55:26" (1/1) ... [2025-03-03 20:55:26,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:55:26,575 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:55:26,575 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:55:26,575 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:55:26,576 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:55:26" (1/1) ... [2025-03-03 20:55:26,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:55:26,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:55:26,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:55:26,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:55:26,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:55:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 20:55:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:55:26,628 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:55:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:55:26,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:55:26,712 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:55:26,713 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:55:36,367 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 20:55:36,368 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:55:36,375 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:55:36,376 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:55:36,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:55:36 BoogieIcfgContainer [2025-03-03 20:55:36,376 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:55:36,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:55:36,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:55:36,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:55:36,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:55:26" (1/3) ... [2025-03-03 20:55:36,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ffbc86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:55:36, skipping insertion in model container [2025-03-03 20:55:36,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:55:26" (2/3) ... [2025-03-03 20:55:36,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ffbc86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:55:36, skipping insertion in model container [2025-03-03 20:55:36,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:55:36" (3/3) ... [2025-03-03 20:55:36,384 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2025-03-03 20:55:36,393 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:55:36,395 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:55:36,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:55:36,441 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;@434ea69b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:55:36,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:55:36,444 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 60 states have internal predecessors, (81), 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 20:55:36,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 20:55:36,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:55:36,453 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] [2025-03-03 20:55:36,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:55:36,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:55:36,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2035163737, now seen corresponding path program 1 times [2025-03-03 20:55:36,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:55:36,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312981282] [2025-03-03 20:55:36,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:55:36,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:55:36,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:55:36,480 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:55:36,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 20:55:36,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 20:55:36,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 20:55:36,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:36,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:55:36,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:55:36,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:55:36,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 942 proven. 0 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2025-03-03 20:55:36,985 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:55:36,986 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:55:36,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312981282] [2025-03-03 20:55:36,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312981282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:55:36,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:55:36,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 20:55:36,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130353421] [2025-03-03 20:55:36,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:55:36,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:55:36,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:55:37,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:55:37,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:55:37,004 INFO L87 Difference]: Start difference. First operand has 94 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 60 states have internal predecessors, (81), 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.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 20:55:37,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:55:37,029 INFO L93 Difference]: Finished difference Result 182 states and 317 transitions. [2025-03-03 20:55:37,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:55:37,031 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 208 [2025-03-03 20:55:37,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:55:37,036 INFO L225 Difference]: With dead ends: 182 [2025-03-03 20:55:37,036 INFO L226 Difference]: Without dead ends: 91 [2025-03-03 20:55:37,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:55:37,041 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:55:37,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:55:37,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-03 20:55:37,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-03 20:55:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 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 20:55:37,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 140 transitions. [2025-03-03 20:55:37,074 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 140 transitions. Word has length 208 [2025-03-03 20:55:37,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:55:37,074 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 140 transitions. [2025-03-03 20:55:37,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 20:55:37,075 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2025-03-03 20:55:37,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 20:55:37,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:55:37,077 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] [2025-03-03 20:55:37,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 20:55:37,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:55:37,278 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:55:37,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:55:37,279 INFO L85 PathProgramCache]: Analyzing trace with hash -529028611, now seen corresponding path program 1 times [2025-03-03 20:55:37,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:55:37,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208977700] [2025-03-03 20:55:37,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:55:37,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:55:37,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:55:37,284 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:55:37,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 20:55:37,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 20:55:37,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 20:55:37,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:37,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:55:37,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:55:37,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:55:39,970 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 20:55:39,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:55:39,970 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:55:39,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208977700] [2025-03-03 20:55:39,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208977700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:55:39,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:55:39,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:55:39,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330906348] [2025-03-03 20:55:39,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:55:39,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:55:39,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:55:39,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:55:39,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:55:39,974 INFO L87 Difference]: Start difference. First operand 91 states and 140 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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 20:55:44,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:55:48,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:55:48,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:55:48,677 INFO L93 Difference]: Finished difference Result 268 states and 415 transitions. [2025-03-03 20:55:48,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:55:48,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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 208 [2025-03-03 20:55:48,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:55:48,705 INFO L225 Difference]: With dead ends: 268 [2025-03-03 20:55:48,705 INFO L226 Difference]: Without dead ends: 180 [2025-03-03 20:55:48,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:55:48,707 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 87 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:55:48,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 455 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2025-03-03 20:55:48,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-03 20:55:48,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 151. [2025-03-03 20:55:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 84 states have internal predecessors, (103), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 20:55:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 231 transitions. [2025-03-03 20:55:48,730 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 231 transitions. Word has length 208 [2025-03-03 20:55:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:55:48,730 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 231 transitions. [2025-03-03 20:55:48,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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 20:55:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 231 transitions. [2025-03-03 20:55:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 20:55:48,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:55:48,732 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] [2025-03-03 20:55:48,748 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 20:55:48,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:55:48,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:55:48,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:55:48,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1727882396, now seen corresponding path program 1 times [2025-03-03 20:55:48,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:55:48,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047087100] [2025-03-03 20:55:48,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:55:48,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:55:48,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:55:48,936 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:55:48,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 20:55:48,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 20:55:49,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 20:55:49,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:49,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:55:49,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 20:55:49,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:55:49,388 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 20:55:49,389 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:55:49,389 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:55:49,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047087100] [2025-03-03 20:55:49,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047087100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:55:49,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:55:49,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:55:49,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939529472] [2025-03-03 20:55:49,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:55:49,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:55:49,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:55:49,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:55:49,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:55:49,393 INFO L87 Difference]: Start difference. First operand 151 states and 231 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 20:55:52,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:55:54,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:55:54,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:55:54,406 INFO L93 Difference]: Finished difference Result 266 states and 410 transitions. [2025-03-03 20:55:54,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:55:54,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 208 [2025-03-03 20:55:54,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:55:54,410 INFO L225 Difference]: With dead ends: 266 [2025-03-03 20:55:54,410 INFO L226 Difference]: Without dead ends: 178 [2025-03-03 20:55:54,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:55:54,411 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 34 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:55:54,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 289 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-03 20:55:54,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-03 20:55:54,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 159. [2025-03-03 20:55:54,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 92 states have internal predecessors, (114), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 20:55:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 242 transitions. [2025-03-03 20:55:54,425 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 242 transitions. Word has length 208 [2025-03-03 20:55:54,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:55:54,426 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 242 transitions. [2025-03-03 20:55:54,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 20:55:54,426 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 242 transitions. [2025-03-03 20:55:54,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 20:55:54,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:55:54,428 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] [2025-03-03 20:55:54,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 20:55:54,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:55:54,629 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:55:54,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:55:54,629 INFO L85 PathProgramCache]: Analyzing trace with hash 474586300, now seen corresponding path program 1 times [2025-03-03 20:55:54,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:55:54,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080850846] [2025-03-03 20:55:54,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:55:54,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:55:54,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:55:54,633 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:55:54,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 20:55:54,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 20:55:55,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 20:55:55,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:55:55,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:55:55,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 20:55:55,035 INFO L279 TraceCheckSpWp]: Computing forward predicates...