./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/systemc/mem_slave_tlm.1.cil.c -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 c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:52:41,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:52:41,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:52:41,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:52:41,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:52:41,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:52:41,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:52:41,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:52:41,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:52:41,507 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:52:41,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:52:41,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:52:41,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:52:41,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:52:41,507 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:52:41,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:52:41,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:52:41,508 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:52:41,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:52:41,508 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:52:41,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:52:41,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:52:41,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:52:41,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:52:41,508 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:52:41,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:52:41,509 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:52:41,509 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:52:41,509 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:52:41,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:52:41,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:52:41,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:52:41,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:52:41,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:52:41,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:52:41,509 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:52:41,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:52:41,510 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:52:41,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:52:41,510 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:52:41,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:52:41,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:52:41,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:52:41,510 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 -> c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 [2025-03-08 05:52:41,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:52:41,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:52:41,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:52:41,738 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:52:41,738 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:52:41,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2025-03-08 05:52:42,867 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ca967a1/62b64fac83b44e858afe523832812aaa/FLAG731067f80 [2025-03-08 05:52:43,083 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:52:43,084 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2025-03-08 05:52:43,095 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ca967a1/62b64fac83b44e858afe523832812aaa/FLAG731067f80 [2025-03-08 05:52:43,438 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ca967a1/62b64fac83b44e858afe523832812aaa [2025-03-08 05:52:43,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:52:43,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:52:43,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:52:43,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:52:43,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:52:43,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a8c09f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43, skipping insertion in model container [2025-03-08 05:52:43,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:52:43,570 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/systemc/mem_slave_tlm.1.cil.c[646,659] [2025-03-08 05:52:43,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:52:43,670 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:52:43,677 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/systemc/mem_slave_tlm.1.cil.c[646,659] [2025-03-08 05:52:43,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:52:43,732 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:52:43,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43 WrapperNode [2025-03-08 05:52:43,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:52:43,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:52:43,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:52:43,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:52:43,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,768 INFO L138 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 808 [2025-03-08 05:52:43,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:52:43,769 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:52:43,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:52:43,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:52:43,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,788 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-08 05:52:43,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,794 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:52:43,799 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:52:43,800 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:52:43,800 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:52:43,800 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:52:43,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:43,823 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-08 05:52:43,826 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-08 05:52:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:52:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:52:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-08 05:52:43,845 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-08 05:52:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:52:43,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:52:43,906 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:52:43,907 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:52:44,533 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-08 05:52:44,533 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:52:44,550 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:52:44,550 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:52:44,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:52:44 BoogieIcfgContainer [2025-03-08 05:52:44,551 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:52:44,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:52:44,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:52:44,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:52:44,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:52:43" (1/3) ... [2025-03-08 05:52:44,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36608a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:52:44, skipping insertion in model container [2025-03-08 05:52:44,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (2/3) ... [2025-03-08 05:52:44,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36608a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:52:44, skipping insertion in model container [2025-03-08 05:52:44,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:52:44" (3/3) ... [2025-03-08 05:52:44,562 INFO L128 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2025-03-08 05:52:44,574 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:52:44,577 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mem_slave_tlm.1.cil.c that has 2 procedures, 248 locations, 1 initial locations, 12 loop locations, and 1 error locations. [2025-03-08 05:52:44,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:52:44,632 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;@69b3ccb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:52:44,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:52:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 248 states, 240 states have (on average 1.8791666666666667) internal successors, (451), 246 states have internal predecessors, (451), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 05:52:44,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 05:52:44,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:44,645 INFO L218 NwaCegarLoop]: trace 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] [2025-03-08 05:52:44,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:44,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:44,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1141263080, now seen corresponding path program 1 times [2025-03-08 05:52:44,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:44,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192823923] [2025-03-08 05:52:44,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:44,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:44,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 05:52:44,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 05:52:44,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:44,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:44,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:44,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192823923] [2025-03-08 05:52:44,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192823923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:44,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:44,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:52:44,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885889464] [2025-03-08 05:52:44,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:44,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:52:44,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:44,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:52:44,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:52:44,856 INFO L87 Difference]: Start difference. First operand has 248 states, 240 states have (on average 1.8791666666666667) internal successors, (451), 246 states have internal predecessors, (451), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:45,152 INFO L93 Difference]: Finished difference Result 643 states and 1197 transitions. [2025-03-08 05:52:45,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:52:45,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 05:52:45,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:45,160 INFO L225 Difference]: With dead ends: 643 [2025-03-08 05:52:45,161 INFO L226 Difference]: Without dead ends: 392 [2025-03-08 05:52:45,163 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-08 05:52:45,164 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 232 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:45,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 716 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:52:45,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-08 05:52:45,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 385. [2025-03-08 05:52:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 379 states have (on average 1.6517150395778364) internal successors, (626), 383 states have internal predecessors, (626), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 631 transitions. [2025-03-08 05:52:45,210 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 631 transitions. Word has length 25 [2025-03-08 05:52:45,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:45,210 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 631 transitions. [2025-03-08 05:52:45,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:45,210 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 631 transitions. [2025-03-08 05:52:45,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 05:52:45,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:45,212 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1] [2025-03-08 05:52:45,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:52:45,212 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:45,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:45,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1646374892, now seen corresponding path program 1 times [2025-03-08 05:52:45,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:45,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170569310] [2025-03-08 05:52:45,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:45,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:45,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 05:52:45,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 05:52:45,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:45,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:45,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:45,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:45,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170569310] [2025-03-08 05:52:45,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170569310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:45,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:45,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:52:45,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693876053] [2025-03-08 05:52:45,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:45,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:52:45,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:45,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:52:45,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:52:45,303 INFO L87 Difference]: Start difference. First operand 385 states and 631 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:45,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:45,667 INFO L93 Difference]: Finished difference Result 1234 states and 1979 transitions. [2025-03-08 05:52:45,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:52:45,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-08 05:52:45,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:45,670 INFO L225 Difference]: With dead ends: 1234 [2025-03-08 05:52:45,670 INFO L226 Difference]: Without dead ends: 860 [2025-03-08 05:52:45,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:45,672 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 682 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:45,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 958 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:52:45,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2025-03-08 05:52:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 708. [2025-03-08 05:52:45,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 702 states have (on average 1.6125356125356125) internal successors, (1132), 706 states have internal predecessors, (1132), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:45,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1137 transitions. [2025-03-08 05:52:45,713 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1137 transitions. Word has length 33 [2025-03-08 05:52:45,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:45,713 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 1137 transitions. [2025-03-08 05:52:45,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:45,714 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1137 transitions. [2025-03-08 05:52:45,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 05:52:45,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:45,715 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1] [2025-03-08 05:52:45,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:52:45,715 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:45,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:45,716 INFO L85 PathProgramCache]: Analyzing trace with hash 312014818, now seen corresponding path program 1 times [2025-03-08 05:52:45,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:45,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460690765] [2025-03-08 05:52:45,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:45,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:45,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 05:52:45,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 05:52:45,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:45,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:45,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:45,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460690765] [2025-03-08 05:52:45,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460690765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:45,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:45,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:52:45,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888964130] [2025-03-08 05:52:45,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:45,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:52:45,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:45,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:52:45,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:52:45,766 INFO L87 Difference]: Start difference. First operand 708 states and 1137 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:45,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:45,859 INFO L93 Difference]: Finished difference Result 1852 states and 3029 transitions. [2025-03-08 05:52:45,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:52:45,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-08 05:52:45,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:45,864 INFO L225 Difference]: With dead ends: 1852 [2025-03-08 05:52:45,867 INFO L226 Difference]: Without dead ends: 1157 [2025-03-08 05:52:45,869 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-08 05:52:45,869 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 294 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:45,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 937 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:45,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2025-03-08 05:52:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1150. [2025-03-08 05:52:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1144 states have (on average 1.6503496503496504) internal successors, (1888), 1148 states have internal predecessors, (1888), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1893 transitions. [2025-03-08 05:52:45,900 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1893 transitions. Word has length 33 [2025-03-08 05:52:45,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:45,901 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1893 transitions. [2025-03-08 05:52:45,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1893 transitions. [2025-03-08 05:52:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 05:52:45,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:45,903 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1] [2025-03-08 05:52:45,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:52:45,903 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:45,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:45,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1423445757, now seen corresponding path program 1 times [2025-03-08 05:52:45,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:45,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309624652] [2025-03-08 05:52:45,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:45,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:45,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 05:52:45,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 05:52:45,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:45,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:45,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:45,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:45,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309624652] [2025-03-08 05:52:45,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309624652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:45,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:45,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:52:45,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060875540] [2025-03-08 05:52:45,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:45,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:52:45,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:45,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:52:45,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:52:45,978 INFO L87 Difference]: Start difference. First operand 1150 states and 1893 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:46,028 INFO L93 Difference]: Finished difference Result 2846 states and 4713 transitions. [2025-03-08 05:52:46,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:52:46,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-08 05:52:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:46,035 INFO L225 Difference]: With dead ends: 2846 [2025-03-08 05:52:46,035 INFO L226 Difference]: Without dead ends: 1719 [2025-03-08 05:52:46,036 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-08 05:52:46,039 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 325 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:46,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 754 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:46,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2025-03-08 05:52:46,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1690. [2025-03-08 05:52:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1684 states have (on average 1.6585510688836105) internal successors, (2793), 1688 states have internal predecessors, (2793), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2798 transitions. [2025-03-08 05:52:46,079 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2798 transitions. Word has length 34 [2025-03-08 05:52:46,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:46,079 INFO L471 AbstractCegarLoop]: Abstraction has 1690 states and 2798 transitions. [2025-03-08 05:52:46,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:46,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2798 transitions. [2025-03-08 05:52:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 05:52:46,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:46,081 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:52:46,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:52:46,082 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:46,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:46,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1300769802, now seen corresponding path program 1 times [2025-03-08 05:52:46,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:46,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485918766] [2025-03-08 05:52:46,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:46,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:46,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 05:52:46,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 05:52:46,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:46,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:46,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:46,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485918766] [2025-03-08 05:52:46,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485918766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:46,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:46,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:52:46,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289633356] [2025-03-08 05:52:46,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:46,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:52:46,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:46,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:52:46,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:52:46,146 INFO L87 Difference]: Start difference. First operand 1690 states and 2798 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:46,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:46,562 INFO L93 Difference]: Finished difference Result 5939 states and 9849 transitions. [2025-03-08 05:52:46,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:52:46,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-08 05:52:46,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:46,576 INFO L225 Difference]: With dead ends: 5939 [2025-03-08 05:52:46,576 INFO L226 Difference]: Without dead ends: 4272 [2025-03-08 05:52:46,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:46,580 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 1069 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:46,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 1471 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:52:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2025-03-08 05:52:46,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 3442. [2025-03-08 05:52:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3442 states, 3436 states have (on average 1.6510477299185098) internal successors, (5673), 3440 states have internal predecessors, (5673), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:46,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 5678 transitions. [2025-03-08 05:52:46,690 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 5678 transitions. Word has length 40 [2025-03-08 05:52:46,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:46,690 INFO L471 AbstractCegarLoop]: Abstraction has 3442 states and 5678 transitions. [2025-03-08 05:52:46,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:46,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 5678 transitions. [2025-03-08 05:52:46,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 05:52:46,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:46,691 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:46,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:52:46,691 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:46,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:46,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1051320006, now seen corresponding path program 1 times [2025-03-08 05:52:46,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:46,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821799957] [2025-03-08 05:52:46,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:46,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:46,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 05:52:46,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 05:52:46,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:46,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:46,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:46,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:46,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821799957] [2025-03-08 05:52:46,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821799957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:46,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:46,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:52:46,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553014095] [2025-03-08 05:52:46,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:46,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:52:46,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:46,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:52:46,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:52:46,725 INFO L87 Difference]: Start difference. First operand 3442 states and 5678 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:46,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:46,818 INFO L93 Difference]: Finished difference Result 8123 states and 13383 transitions. [2025-03-08 05:52:46,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:52:46,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-08 05:52:46,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:46,848 INFO L225 Difference]: With dead ends: 8123 [2025-03-08 05:52:46,848 INFO L226 Difference]: Without dead ends: 4704 [2025-03-08 05:52:46,851 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-08 05:52:46,852 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 345 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:46,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 654 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:46,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4704 states. [2025-03-08 05:52:46,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4704 to 4460. [2025-03-08 05:52:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4460 states, 4454 states have (on average 1.6320161652447238) internal successors, (7269), 4458 states have internal predecessors, (7269), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4460 states to 4460 states and 7274 transitions. [2025-03-08 05:52:47,001 INFO L78 Accepts]: Start accepts. Automaton has 4460 states and 7274 transitions. Word has length 46 [2025-03-08 05:52:47,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:47,002 INFO L471 AbstractCegarLoop]: Abstraction has 4460 states and 7274 transitions. [2025-03-08 05:52:47,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:47,003 INFO L276 IsEmpty]: Start isEmpty. Operand 4460 states and 7274 transitions. [2025-03-08 05:52:47,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 05:52:47,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:47,004 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:47,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:52:47,004 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:47,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:47,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1303458080, now seen corresponding path program 1 times [2025-03-08 05:52:47,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:47,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212778845] [2025-03-08 05:52:47,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:47,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:47,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 05:52:47,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 05:52:47,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:47,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:47,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:47,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:47,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212778845] [2025-03-08 05:52:47,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212778845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:47,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:47,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:52:47,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812528132] [2025-03-08 05:52:47,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:47,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:52:47,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:47,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:52:47,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:52:47,067 INFO L87 Difference]: Start difference. First operand 4460 states and 7274 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:47,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:47,414 INFO L93 Difference]: Finished difference Result 10754 states and 17632 transitions. [2025-03-08 05:52:47,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:52:47,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-08 05:52:47,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:47,438 INFO L225 Difference]: With dead ends: 10754 [2025-03-08 05:52:47,439 INFO L226 Difference]: Without dead ends: 6317 [2025-03-08 05:52:47,446 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-08 05:52:47,447 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 223 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:47,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 821 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:52:47,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6317 states. [2025-03-08 05:52:47,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6317 to 5138. [2025-03-08 05:52:47,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5138 states, 5132 states have (on average 1.5748246297739672) internal successors, (8082), 5136 states have internal predecessors, (8082), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5138 states to 5138 states and 8087 transitions. [2025-03-08 05:52:47,632 INFO L78 Accepts]: Start accepts. Automaton has 5138 states and 8087 transitions. Word has length 48 [2025-03-08 05:52:47,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:47,633 INFO L471 AbstractCegarLoop]: Abstraction has 5138 states and 8087 transitions. [2025-03-08 05:52:47,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:47,633 INFO L276 IsEmpty]: Start isEmpty. Operand 5138 states and 8087 transitions. [2025-03-08 05:52:47,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 05:52:47,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:47,635 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:47,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:52:47,635 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:47,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:47,635 INFO L85 PathProgramCache]: Analyzing trace with hash 146421411, now seen corresponding path program 1 times [2025-03-08 05:52:47,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:47,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823424369] [2025-03-08 05:52:47,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:47,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:47,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 05:52:47,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 05:52:47,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:47,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:47,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:47,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823424369] [2025-03-08 05:52:47,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823424369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:47,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:47,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:52:47,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731367640] [2025-03-08 05:52:47,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:47,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:52:47,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:47,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:52:47,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:52:47,680 INFO L87 Difference]: Start difference. First operand 5138 states and 8087 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:47,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:47,809 INFO L93 Difference]: Finished difference Result 9944 states and 15826 transitions. [2025-03-08 05:52:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:52:47,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-08 05:52:47,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:47,833 INFO L225 Difference]: With dead ends: 9944 [2025-03-08 05:52:47,833 INFO L226 Difference]: Without dead ends: 4829 [2025-03-08 05:52:47,840 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-08 05:52:47,840 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 146 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:47,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 873 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:47,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4829 states. [2025-03-08 05:52:47,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4829 to 4158. [2025-03-08 05:52:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4158 states, 4152 states have (on average 1.605009633911368) internal successors, (6664), 4156 states have internal predecessors, (6664), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4158 states to 4158 states and 6669 transitions. [2025-03-08 05:52:47,976 INFO L78 Accepts]: Start accepts. Automaton has 4158 states and 6669 transitions. Word has length 50 [2025-03-08 05:52:47,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:47,977 INFO L471 AbstractCegarLoop]: Abstraction has 4158 states and 6669 transitions. [2025-03-08 05:52:47,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:47,977 INFO L276 IsEmpty]: Start isEmpty. Operand 4158 states and 6669 transitions. [2025-03-08 05:52:47,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 05:52:47,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:47,993 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:47,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:52:47,993 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:47,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:47,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1896886248, now seen corresponding path program 1 times [2025-03-08 05:52:47,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:47,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973221071] [2025-03-08 05:52:47,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:47,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:48,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 05:52:48,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 05:52:48,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:48,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:48,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:48,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:48,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973221071] [2025-03-08 05:52:48,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973221071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:48,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:48,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:52:48,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546225151] [2025-03-08 05:52:48,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:48,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:52:48,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:48,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:52:48,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:52:48,059 INFO L87 Difference]: Start difference. First operand 4158 states and 6669 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:48,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:48,183 INFO L93 Difference]: Finished difference Result 8055 states and 12962 transitions. [2025-03-08 05:52:48,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:52:48,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-08 05:52:48,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:48,196 INFO L225 Difference]: With dead ends: 8055 [2025-03-08 05:52:48,198 INFO L226 Difference]: Without dead ends: 4088 [2025-03-08 05:52:48,204 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-08 05:52:48,206 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 324 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:48,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 412 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:48,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4088 states. [2025-03-08 05:52:48,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4088 to 4088. [2025-03-08 05:52:48,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4088 states, 4082 states have (on average 1.5781479666829985) internal successors, (6442), 4086 states have internal predecessors, (6442), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4088 states to 4088 states and 6447 transitions. [2025-03-08 05:52:48,351 INFO L78 Accepts]: Start accepts. Automaton has 4088 states and 6447 transitions. Word has length 50 [2025-03-08 05:52:48,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:48,351 INFO L471 AbstractCegarLoop]: Abstraction has 4088 states and 6447 transitions. [2025-03-08 05:52:48,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:48,352 INFO L276 IsEmpty]: Start isEmpty. Operand 4088 states and 6447 transitions. [2025-03-08 05:52:48,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 05:52:48,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:48,353 INFO L218 NwaCegarLoop]: trace 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, 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-08 05:52:48,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:52:48,354 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:48,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:48,354 INFO L85 PathProgramCache]: Analyzing trace with hash 999222172, now seen corresponding path program 1 times [2025-03-08 05:52:48,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:48,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735986321] [2025-03-08 05:52:48,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:48,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:48,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 05:52:48,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 05:52:48,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:48,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:48,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:48,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735986321] [2025-03-08 05:52:48,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735986321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:48,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:48,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:52:48,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947025913] [2025-03-08 05:52:48,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:48,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:52:48,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:48,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:52:48,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:52:48,470 INFO L87 Difference]: Start difference. First operand 4088 states and 6447 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:48,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:48,898 INFO L93 Difference]: Finished difference Result 11781 states and 18684 transitions. [2025-03-08 05:52:48,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:52:48,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-08 05:52:48,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:48,915 INFO L225 Difference]: With dead ends: 11781 [2025-03-08 05:52:48,916 INFO L226 Difference]: Without dead ends: 7884 [2025-03-08 05:52:48,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:52:48,924 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 851 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 2200 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:48,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 2200 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:52:48,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7884 states. [2025-03-08 05:52:49,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7884 to 5514. [2025-03-08 05:52:49,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5514 states, 5508 states have (on average 1.5860566448801743) internal successors, (8736), 5512 states have internal predecessors, (8736), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:49,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5514 states to 5514 states and 8741 transitions. [2025-03-08 05:52:49,104 INFO L78 Accepts]: Start accepts. Automaton has 5514 states and 8741 transitions. Word has length 53 [2025-03-08 05:52:49,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:49,104 INFO L471 AbstractCegarLoop]: Abstraction has 5514 states and 8741 transitions. [2025-03-08 05:52:49,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:49,104 INFO L276 IsEmpty]: Start isEmpty. Operand 5514 states and 8741 transitions. [2025-03-08 05:52:49,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 05:52:49,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:49,105 INFO L218 NwaCegarLoop]: trace 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, 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-08 05:52:49,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:52:49,106 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:49,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:49,106 INFO L85 PathProgramCache]: Analyzing trace with hash 918268717, now seen corresponding path program 1 times [2025-03-08 05:52:49,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:49,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611221809] [2025-03-08 05:52:49,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:49,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:49,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 05:52:49,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 05:52:49,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:49,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:49,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:49,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611221809] [2025-03-08 05:52:49,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611221809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:49,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:49,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:52:49,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130034890] [2025-03-08 05:52:49,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:49,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:52:49,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:49,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:52:49,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:52:49,188 INFO L87 Difference]: Start difference. First operand 5514 states and 8741 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:49,436 INFO L93 Difference]: Finished difference Result 7881 states and 12377 transitions. [2025-03-08 05:52:49,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:52:49,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-08 05:52:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:49,453 INFO L225 Difference]: With dead ends: 7881 [2025-03-08 05:52:49,453 INFO L226 Difference]: Without dead ends: 7878 [2025-03-08 05:52:49,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:52:49,455 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 760 mSDsluCounter, 2229 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 2732 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:49,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 2732 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:49,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states. [2025-03-08 05:52:49,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 5830. [2025-03-08 05:52:49,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5830 states, 5824 states have (on average 1.5748626373626373) internal successors, (9172), 5828 states have internal predecessors, (9172), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:49,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5830 states to 5830 states and 9177 transitions. [2025-03-08 05:52:49,608 INFO L78 Accepts]: Start accepts. Automaton has 5830 states and 9177 transitions. Word has length 54 [2025-03-08 05:52:49,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:49,608 INFO L471 AbstractCegarLoop]: Abstraction has 5830 states and 9177 transitions. [2025-03-08 05:52:49,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:49,609 INFO L276 IsEmpty]: Start isEmpty. Operand 5830 states and 9177 transitions. [2025-03-08 05:52:49,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 05:52:49,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:49,610 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:52:49,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:52:49,611 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:49,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:49,611 INFO L85 PathProgramCache]: Analyzing trace with hash -580387765, now seen corresponding path program 1 times [2025-03-08 05:52:49,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:49,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415094229] [2025-03-08 05:52:49,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:49,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:49,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 05:52:49,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 05:52:49,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:49,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:49,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:49,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415094229] [2025-03-08 05:52:49,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415094229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:49,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:49,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:52:49,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597694519] [2025-03-08 05:52:49,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:49,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:52:49,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:49,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:52:49,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:52:49,642 INFO L87 Difference]: Start difference. First operand 5830 states and 9177 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:49,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:49,859 INFO L93 Difference]: Finished difference Result 12291 states and 19324 transitions. [2025-03-08 05:52:49,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:52:49,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-08 05:52:49,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:49,876 INFO L225 Difference]: With dead ends: 12291 [2025-03-08 05:52:49,876 INFO L226 Difference]: Without dead ends: 6482 [2025-03-08 05:52:49,885 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-08 05:52:49,886 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 117 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:49,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 755 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:49,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6482 states. [2025-03-08 05:52:50,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6482 to 6444. [2025-03-08 05:52:50,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6444 states, 6438 states have (on average 1.5672569120844984) internal successors, (10090), 6442 states have internal predecessors, (10090), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:50,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6444 states to 6444 states and 10095 transitions. [2025-03-08 05:52:50,057 INFO L78 Accepts]: Start accepts. Automaton has 6444 states and 10095 transitions. Word has length 67 [2025-03-08 05:52:50,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:50,057 INFO L471 AbstractCegarLoop]: Abstraction has 6444 states and 10095 transitions. [2025-03-08 05:52:50,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:50,058 INFO L276 IsEmpty]: Start isEmpty. Operand 6444 states and 10095 transitions. [2025-03-08 05:52:50,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 05:52:50,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:50,059 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:52:50,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:52:50,060 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:50,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:50,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1850599935, now seen corresponding path program 1 times [2025-03-08 05:52:50,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:50,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186355252] [2025-03-08 05:52:50,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:50,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:50,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 05:52:50,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 05:52:50,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:50,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:50,115 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:50,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:50,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186355252] [2025-03-08 05:52:50,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186355252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:50,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:50,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:52:50,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265504360] [2025-03-08 05:52:50,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:50,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:52:50,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:50,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:52:50,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:52:50,117 INFO L87 Difference]: Start difference. First operand 6444 states and 10095 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:50,595 INFO L93 Difference]: Finished difference Result 16581 states and 25756 transitions. [2025-03-08 05:52:50,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:52:50,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-08 05:52:50,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:50,619 INFO L225 Difference]: With dead ends: 16581 [2025-03-08 05:52:50,619 INFO L226 Difference]: Without dead ends: 10033 [2025-03-08 05:52:50,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:50,631 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 581 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:50,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1285 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:52:50,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10033 states. [2025-03-08 05:52:50,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10033 to 8881. [2025-03-08 05:52:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8881 states, 8875 states have (on average 1.5354366197183098) internal successors, (13627), 8879 states have internal predecessors, (13627), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8881 states to 8881 states and 13632 transitions. [2025-03-08 05:52:50,875 INFO L78 Accepts]: Start accepts. Automaton has 8881 states and 13632 transitions. Word has length 75 [2025-03-08 05:52:50,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:50,876 INFO L471 AbstractCegarLoop]: Abstraction has 8881 states and 13632 transitions. [2025-03-08 05:52:50,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:50,876 INFO L276 IsEmpty]: Start isEmpty. Operand 8881 states and 13632 transitions. [2025-03-08 05:52:50,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 05:52:50,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:50,878 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:52:50,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:52:50,879 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:50,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:50,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1114030829, now seen corresponding path program 1 times [2025-03-08 05:52:50,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:50,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060039610] [2025-03-08 05:52:50,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:50,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:50,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 05:52:50,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 05:52:50,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:50,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:50,929 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:50,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:50,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060039610] [2025-03-08 05:52:50,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060039610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:50,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:50,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:52:50,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392288320] [2025-03-08 05:52:50,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:50,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:52:50,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:50,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:52:50,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:52:50,930 INFO L87 Difference]: Start difference. First operand 8881 states and 13632 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:51,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:51,091 INFO L93 Difference]: Finished difference Result 12662 states and 19496 transitions. [2025-03-08 05:52:51,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:52:51,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-08 05:52:51,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:51,101 INFO L225 Difference]: With dead ends: 12662 [2025-03-08 05:52:51,102 INFO L226 Difference]: Without dead ends: 3789 [2025-03-08 05:52:51,106 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-08 05:52:51,107 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 316 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:51,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 467 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:51,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3789 states. [2025-03-08 05:52:51,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3789 to 3741. [2025-03-08 05:52:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 3735 states have (on average 1.4281124497991968) internal successors, (5334), 3739 states have internal predecessors, (5334), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:51,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 5339 transitions. [2025-03-08 05:52:51,182 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 5339 transitions. Word has length 81 [2025-03-08 05:52:51,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:51,184 INFO L471 AbstractCegarLoop]: Abstraction has 3741 states and 5339 transitions. [2025-03-08 05:52:51,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 5339 transitions. [2025-03-08 05:52:51,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 05:52:51,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:51,185 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:52:51,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:52:51,185 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:51,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:51,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2032869850, now seen corresponding path program 1 times [2025-03-08 05:52:51,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:51,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836047098] [2025-03-08 05:52:51,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:51,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:51,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 05:52:51,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 05:52:51,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:51,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:51,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:51,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836047098] [2025-03-08 05:52:51,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836047098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:51,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:51,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:52:51,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502974219] [2025-03-08 05:52:51,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:51,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:52:51,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:51,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:52:51,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:51,244 INFO L87 Difference]: Start difference. First operand 3741 states and 5339 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:51,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:51,410 INFO L93 Difference]: Finished difference Result 8750 states and 12504 transitions. [2025-03-08 05:52:51,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:52:51,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-08 05:52:51,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:51,420 INFO L225 Difference]: With dead ends: 8750 [2025-03-08 05:52:51,421 INFO L226 Difference]: Without dead ends: 5157 [2025-03-08 05:52:51,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:52:51,424 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 495 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 2173 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:51,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 2173 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:51,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5157 states. [2025-03-08 05:52:51,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5157 to 3743. [2025-03-08 05:52:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3743 states, 3737 states have (on average 1.4246721969494247) internal successors, (5324), 3741 states have internal predecessors, (5324), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5329 transitions. [2025-03-08 05:52:51,559 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5329 transitions. Word has length 85 [2025-03-08 05:52:51,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:51,559 INFO L471 AbstractCegarLoop]: Abstraction has 3743 states and 5329 transitions. [2025-03-08 05:52:51,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:51,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5329 transitions. [2025-03-08 05:52:51,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 05:52:51,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:51,561 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:52:51,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:52:51,561 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:51,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:51,561 INFO L85 PathProgramCache]: Analyzing trace with hash -35179305, now seen corresponding path program 1 times [2025-03-08 05:52:51,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:51,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534811169] [2025-03-08 05:52:51,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:51,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:51,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 05:52:51,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:52:51,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:51,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:51,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:51,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:51,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534811169] [2025-03-08 05:52:51,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534811169] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:51,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114972115] [2025-03-08 05:52:51,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:51,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:51,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:51,634 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-08 05:52:51,636 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-08 05:52:51,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 05:52:51,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:52:51,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:51,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:51,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:52:51,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:51,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 05:52:51,808 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:52:51,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114972115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:51,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:52:51,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:52:51,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83949581] [2025-03-08 05:52:51,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:51,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:52:51,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:51,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:52:51,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:52:51,809 INFO L87 Difference]: Start difference. First operand 3743 states and 5329 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:51,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:51,961 INFO L93 Difference]: Finished difference Result 4810 states and 6826 transitions. [2025-03-08 05:52:51,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:52:51,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-08 05:52:51,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:51,972 INFO L225 Difference]: With dead ends: 4810 [2025-03-08 05:52:51,972 INFO L226 Difference]: Without dead ends: 4806 [2025-03-08 05:52:51,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:52:51,975 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 213 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:51,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 736 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:51,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4806 states. [2025-03-08 05:52:52,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4806 to 4694. [2025-03-08 05:52:52,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4694 states, 4688 states have (on average 1.4251279863481228) internal successors, (6681), 4692 states have internal predecessors, (6681), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4694 states to 4694 states and 6686 transitions. [2025-03-08 05:52:52,107 INFO L78 Accepts]: Start accepts. Automaton has 4694 states and 6686 transitions. Word has length 87 [2025-03-08 05:52:52,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:52,107 INFO L471 AbstractCegarLoop]: Abstraction has 4694 states and 6686 transitions. [2025-03-08 05:52:52,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:52,107 INFO L276 IsEmpty]: Start isEmpty. Operand 4694 states and 6686 transitions. [2025-03-08 05:52:52,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 05:52:52,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:52,110 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:52:52,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:52:52,311 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,SelfDestructingSolverStorable15 [2025-03-08 05:52:52,312 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:52,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:52,314 INFO L85 PathProgramCache]: Analyzing trace with hash -165108190, now seen corresponding path program 1 times [2025-03-08 05:52:52,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:52,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565735351] [2025-03-08 05:52:52,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:52,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:52,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:52:52,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:52:52,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:52,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:52,409 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:52,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:52,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565735351] [2025-03-08 05:52:52,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565735351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:52,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395988159] [2025-03-08 05:52:52,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:52,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:52,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:52,411 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:52:52,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:52:52,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:52:52,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:52:52,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:52,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:52,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:52:52,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 05:52:52,591 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:52:52,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395988159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:52,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:52:52,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:52:52,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126313020] [2025-03-08 05:52:52,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:52,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:52:52,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:52,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:52:52,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:52:52,593 INFO L87 Difference]: Start difference. First operand 4694 states and 6686 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:52,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:52,686 INFO L93 Difference]: Finished difference Result 8315 states and 11909 transitions. [2025-03-08 05:52:52,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:52:52,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2025-03-08 05:52:52,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:52,697 INFO L225 Difference]: With dead ends: 8315 [2025-03-08 05:52:52,697 INFO L226 Difference]: Without dead ends: 3626 [2025-03-08 05:52:52,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:52:52,703 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 241 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:52,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 392 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:52,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2025-03-08 05:52:52,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 3322. [2025-03-08 05:52:52,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3322 states, 3316 states have (on average 1.3998793727382388) internal successors, (4642), 3320 states have internal predecessors, (4642), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3322 states to 3322 states and 4647 transitions. [2025-03-08 05:52:52,787 INFO L78 Accepts]: Start accepts. Automaton has 3322 states and 4647 transitions. Word has length 132 [2025-03-08 05:52:52,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:52,788 INFO L471 AbstractCegarLoop]: Abstraction has 3322 states and 4647 transitions. [2025-03-08 05:52:52,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:52,788 INFO L276 IsEmpty]: Start isEmpty. Operand 3322 states and 4647 transitions. [2025-03-08 05:52:52,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 05:52:52,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:52,790 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:52:52,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:52:52,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 05:52:52,990 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:52,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:52,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1066277190, now seen corresponding path program 1 times [2025-03-08 05:52:52,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:52,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760024924] [2025-03-08 05:52:52,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:52,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:53,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 05:52:53,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 05:52:53,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:53,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:53,047 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:52:53,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:53,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760024924] [2025-03-08 05:52:53,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760024924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:53,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:53,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:52:53,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131768841] [2025-03-08 05:52:53,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:53,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:52:53,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:53,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:52:53,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:52:53,048 INFO L87 Difference]: Start difference. First operand 3322 states and 4647 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:53,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:53,174 INFO L93 Difference]: Finished difference Result 3838 states and 5306 transitions. [2025-03-08 05:52:53,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:52:53,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2025-03-08 05:52:53,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:53,178 INFO L225 Difference]: With dead ends: 3838 [2025-03-08 05:52:53,178 INFO L226 Difference]: Without dead ends: 564 [2025-03-08 05:52:53,181 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-08 05:52:53,181 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 120 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:53,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 338 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:53,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-08 05:52:53,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 557. [2025-03-08 05:52:53,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 553 states have (on average 1.0904159132007234) internal successors, (603), 555 states have internal predecessors, (603), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:53,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 606 transitions. [2025-03-08 05:52:53,196 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 606 transitions. Word has length 135 [2025-03-08 05:52:53,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:53,196 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 606 transitions. [2025-03-08 05:52:53,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:53,196 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 606 transitions. [2025-03-08 05:52:53,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 05:52:53,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:53,197 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:52:53,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:52:53,198 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:53,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:53,199 INFO L85 PathProgramCache]: Analyzing trace with hash -658093149, now seen corresponding path program 1 times [2025-03-08 05:52:53,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:53,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156480563] [2025-03-08 05:52:53,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:53,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:53,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 05:52:53,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 05:52:53,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:53,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 05:52:53,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:53,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156480563] [2025-03-08 05:52:53,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156480563] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:53,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605274561] [2025-03-08 05:52:53,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:53,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:53,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:53,323 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:52:53,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:52:53,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 05:52:53,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 05:52:53,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:53,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:53,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 05:52:53,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 05:52:53,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:52:53,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605274561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:53,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:52:53,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-08 05:52:53,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830936331] [2025-03-08 05:52:53,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:53,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:52:53,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:53,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:52:53,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:52:53,531 INFO L87 Difference]: Start difference. First operand 557 states and 606 transitions. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:53,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:53,571 INFO L93 Difference]: Finished difference Result 815 states and 886 transitions. [2025-03-08 05:52:53,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:52:53,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2025-03-08 05:52:53,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:53,574 INFO L225 Difference]: With dead ends: 815 [2025-03-08 05:52:53,574 INFO L226 Difference]: Without dead ends: 473 [2025-03-08 05:52:53,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:52:53,575 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 205 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:53,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 382 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:53,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-08 05:52:53,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2025-03-08 05:52:53,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 469 states have (on average 1.0874200426439233) internal successors, (510), 471 states have internal predecessors, (510), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:53,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 513 transitions. [2025-03-08 05:52:53,588 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 513 transitions. Word has length 139 [2025-03-08 05:52:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:53,589 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 513 transitions. [2025-03-08 05:52:53,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:53,589 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 513 transitions. [2025-03-08 05:52:53,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 05:52:53,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:53,590 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:52:53,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:52:53,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:53,790 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:53,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:53,791 INFO L85 PathProgramCache]: Analyzing trace with hash 2096662112, now seen corresponding path program 1 times [2025-03-08 05:52:53,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:53,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592008044] [2025-03-08 05:52:53,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:53,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:53,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 05:52:53,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 05:52:53,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:53,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:52:53,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:53,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592008044] [2025-03-08 05:52:53,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592008044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:53,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:53,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:52:53,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579544486] [2025-03-08 05:52:53,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:53,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:52:53,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:53,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:52:53,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:52:53,901 INFO L87 Difference]: Start difference. First operand 473 states and 513 transitions. Second operand has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:53,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:53,972 INFO L93 Difference]: Finished difference Result 478 states and 517 transitions. [2025-03-08 05:52:53,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:52:53,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2025-03-08 05:52:53,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:53,975 INFO L225 Difference]: With dead ends: 478 [2025-03-08 05:52:53,975 INFO L226 Difference]: Without dead ends: 475 [2025-03-08 05:52:53,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:52:53,975 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 184 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:53,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1122 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:53,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-03-08 05:52:53,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 472. [2025-03-08 05:52:53,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 469 states have (on average 1.0831556503198294) internal successors, (508), 470 states have internal predecessors, (508), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:53,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 510 transitions. [2025-03-08 05:52:53,992 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 510 transitions. Word has length 140 [2025-03-08 05:52:53,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:53,992 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 510 transitions. [2025-03-08 05:52:53,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:53,992 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 510 transitions. [2025-03-08 05:52:53,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 05:52:53,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:53,993 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:52:53,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:52:53,994 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:53,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:53,994 INFO L85 PathProgramCache]: Analyzing trace with hash 579168489, now seen corresponding path program 1 times [2025-03-08 05:52:53,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:53,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023914063] [2025-03-08 05:52:53,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:53,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:54,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 05:52:54,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:52:54,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:54,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:52:54,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:54,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023914063] [2025-03-08 05:52:54,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023914063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:54,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:54,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:52:54,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395825568] [2025-03-08 05:52:54,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:54,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:52:54,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:54,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:52:54,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:54,074 INFO L87 Difference]: Start difference. First operand 472 states and 510 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:54,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:54,117 INFO L93 Difference]: Finished difference Result 560 states and 601 transitions. [2025-03-08 05:52:54,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:52:54,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2025-03-08 05:52:54,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:54,121 INFO L225 Difference]: With dead ends: 560 [2025-03-08 05:52:54,121 INFO L226 Difference]: Without dead ends: 466 [2025-03-08 05:52:54,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:52:54,122 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 141 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:54,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 714 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:54,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-03-08 05:52:54,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 465. [2025-03-08 05:52:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 463 states have (on average 1.0712742980561556) internal successors, (496), 463 states have internal predecessors, (496), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:54,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 497 transitions. [2025-03-08 05:52:54,136 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 497 transitions. Word has length 141 [2025-03-08 05:52:54,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:54,137 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 497 transitions. [2025-03-08 05:52:54,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:54,137 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 497 transitions. [2025-03-08 05:52:54,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-08 05:52:54,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:54,138 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:52:54,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:52:54,139 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:54,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:54,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1302231098, now seen corresponding path program 1 times [2025-03-08 05:52:54,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:54,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454763343] [2025-03-08 05:52:54,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:54,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:54,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 05:52:54,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 05:52:54,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:54,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:54,603 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:54,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:54,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454763343] [2025-03-08 05:52:54,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454763343] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:54,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836785826] [2025-03-08 05:52:54,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:54,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:54,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:54,605 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:52:54,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:52:54,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 05:52:54,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 05:52:54,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:54,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:54,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 05:52:54,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:55,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:52:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:55,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836785826] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:52:55,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:52:55,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 28 [2025-03-08 05:52:55,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560473726] [2025-03-08 05:52:55,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:52:55,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 05:52:55,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:55,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 05:52:55,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2025-03-08 05:52:55,389 INFO L87 Difference]: Start difference. First operand 465 states and 497 transitions. Second operand has 28 states, 28 states have (on average 10.821428571428571) internal successors, (303), 28 states have internal predecessors, (303), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:55,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:55,799 INFO L93 Difference]: Finished difference Result 468 states and 500 transitions. [2025-03-08 05:52:55,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 05:52:55,800 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 10.821428571428571) internal successors, (303), 28 states have internal predecessors, (303), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2025-03-08 05:52:55,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:55,802 INFO L225 Difference]: With dead ends: 468 [2025-03-08 05:52:55,802 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 05:52:55,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=1689, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 05:52:55,804 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 464 mSDsluCounter, 4590 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 4866 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:55,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 4866 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:52:55,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 05:52:55,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 05:52:55,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 05:52:55,806 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 195 [2025-03-08 05:52:55,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:55,806 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 05:52:55,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.821428571428571) internal successors, (303), 28 states have internal predecessors, (303), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:52:55,806 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 05:52:55,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 05:52:55,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:52:55,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:52:56,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:56,015 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] [2025-03-08 05:52:56,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 05:53:03,559 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:53:03,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:53:03 BoogieIcfgContainer [2025-03-08 05:53:03,582 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:53:03,582 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:53:03,582 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:53:03,582 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:53:03,583 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:52:44" (3/4) ... [2025-03-08 05:53:03,584 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 05:53:03,593 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure error [2025-03-08 05:53:03,603 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-08 05:53:03,607 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 05:53:03,607 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 05:53:03,608 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 05:53:03,730 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:53:03,730 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:53:03,730 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:53:03,731 INFO L158 Benchmark]: Toolchain (without parser) took 20288.55ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 113.9MB in the beginning and 826.7MB in the end (delta: -712.9MB). Peak memory consumption was 418.5MB. Max. memory is 16.1GB. [2025-03-08 05:53:03,731 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:53:03,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.52ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 94.2MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:53:03,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.84ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 91.4MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:53:03,731 INFO L158 Benchmark]: Boogie Preprocessor took 29.53ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 88.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:53:03,731 INFO L158 Benchmark]: IcfgBuilder took 751.25ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 107.7MB in the end (delta: -19.0MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2025-03-08 05:53:03,732 INFO L158 Benchmark]: TraceAbstraction took 19029.35ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 106.9MB in the beginning and 843.5MB in the end (delta: -736.6MB). Peak memory consumption was 649.2MB. Max. memory is 16.1GB. [2025-03-08 05:53:03,732 INFO L158 Benchmark]: Witness Printer took 147.94ms. Allocated memory is still 1.3GB. Free memory was 843.5MB in the beginning and 826.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:53:03,733 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.14ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.52ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 94.2MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.84ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 91.4MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.53ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 88.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 751.25ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 107.7MB in the end (delta: -19.0MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19029.35ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 106.9MB in the beginning and 843.5MB in the end (delta: -736.6MB). Peak memory consumption was 649.2MB. Max. memory is 16.1GB. * Witness Printer took 147.94ms. Allocated memory is still 1.3GB. Free memory was 843.5MB in the beginning and 826.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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 - PositiveResult [Line: 20]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 248 locations, 466 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8328 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8328 mSDsluCounter, 25758 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16530 mSDsCounter, 446 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2841 IncrementalHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 446 mSolverCounterUnsat, 9228 mSDtfsCounter, 2841 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 900 GetRequests, 784 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8881occurred in iteration=13, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 10616 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2296 NumberOfCodeBlocks, 2296 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2464 ConstructedInterpolants, 0 QuantifiedInterpolants, 6266 SizeOfPredicates, 10 NumberOfNonLiveVariables, 2029 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 255/386 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 638]: Location Invariant Derived location invariant: ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (0 <= a)) && (1 <= c_m_lock)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (0 <= a)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6))) || (((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || ((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) - InvariantResult [Line: 485]: Location Invariant Derived location invariant: (((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) || ((((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (c_req_d == 50))) - InvariantResult [Line: 528]: Location Invariant Derived location invariant: ((((((((((((((req_type___0 == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (s_run_st != 0)) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (c_req_d == 50)) - InvariantResult [Line: 860]: Location Invariant Derived location invariant: ((((((((((((s_run_st != 0) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (s_run_st != 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_st != 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) - InvariantResult [Line: 288]: Location Invariant Derived location invariant: (((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (0 <= a)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (0 <= a)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_req_d == 50))) || (((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((((2 <= c_write_req_ev) && (0 <= a)) && (1 <= c_m_lock)) && (s_run_st != 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (c_req_d == 50))) || ((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_req_type != 0))) - InvariantResult [Line: 134]: Location Invariant Derived location invariant: (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || ((((((((s_run_st != 0) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || ((((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a)) && (c_req_d == 50))) - InvariantResult [Line: 178]: Location Invariant Derived location invariant: (((((((((((req_a == 0) && (req_type != 0)) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && (s_run_pc == 0)) && (req_d == 50)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && (s_run_st != 0)) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 1255]: Location Invariant Derived location invariant: (((((((((((((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || ((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || ((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || ((((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (m_run_st == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_type != 0))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_tt_a == 0)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (m_run_st == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) - InvariantResult [Line: 495]: Location Invariant Derived location invariant: ((((((((((((((req_type___0 == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_a___0 == 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (c_req_d == 50)) - InvariantResult [Line: 1001]: Location Invariant Derived location invariant: (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) || ((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (s_memory0 == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) - InvariantResult [Line: 1119]: Location Invariant Derived location invariant: ((((((((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6))) || ((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_type != 0))) - InvariantResult [Line: 145]: Location Invariant Derived location invariant: ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (req_d == 50)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || ((((((((((req_a == 0) && (req_type != 0)) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-08 05:53:03,752 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 Writing output log to file Ultimate.log Result: TRUE