./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-551b009-m [2025-01-09 04:15:11,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:15:11,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:15:11,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:15:11,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:15:11,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:15:11,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:15:11,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:15:11,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:15:11,780 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:15:11,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:15:11,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:15:11,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:15:11,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:15:11,781 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:15:11,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:15:11,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:15:11,781 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:15:11,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:15:11,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:15:11,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:15:11,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:15:11,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:15:11,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:15:11,782 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:15:11,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:15:11,782 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:15:11,782 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:15:11,782 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:15:11,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:15:11,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:15:11,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:15:11,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:15:11,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:15:11,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:15:11,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:15:11,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:15:11,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:15:11,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:15:11,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:15:11,783 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:15:11,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:15:11,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:15:11,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:15:11,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:15:11,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:15:11,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:15:11,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:15:11,784 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-jdk21/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-01-09 04:15:12,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:15:12,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:15:12,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:15:12,031 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:15:12,031 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:15:12,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2025-01-09 04:15:13,320 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2432b3bfd/280c60c028294ecdbd18260c87eda820/FLAG10fa506d4 [2025-01-09 04:15:13,634 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:15:13,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2025-01-09 04:15:13,643 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2432b3bfd/280c60c028294ecdbd18260c87eda820/FLAG10fa506d4 [2025-01-09 04:15:13,658 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2432b3bfd/280c60c028294ecdbd18260c87eda820 [2025-01-09 04:15:13,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:15:13,662 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:15:13,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:15:13,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:15:13,666 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:15:13,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:15:13" (1/1) ... [2025-01-09 04:15:13,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2921bbc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:13, skipping insertion in model container [2025-01-09 04:15:13,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:15:13" (1/1) ... [2025-01-09 04:15:13,700 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:15:13,804 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[646,659] [2025-01-09 04:15:13,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:15:13,927 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:15:13,937 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[646,659] [2025-01-09 04:15:13,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:15:14,023 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:15:14,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:14 WrapperNode [2025-01-09 04:15:14,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:15:14,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:15:14,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:15:14,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:15:14,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:14" (1/1) ... [2025-01-09 04:15:14,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:14" (1/1) ... [2025-01-09 04:15:14,092 INFO L138 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 808 [2025-01-09 04:15:14,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:15:14,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:15:14,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:15:14,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:15:14,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:14" (1/1) ... [2025-01-09 04:15:14,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:14" (1/1) ... [2025-01-09 04:15:14,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:14" (1/1) ... [2025-01-09 04:15:14,128 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-01-09 04:15:14,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:14" (1/1) ... [2025-01-09 04:15:14,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:14" (1/1) ... [2025-01-09 04:15:14,142 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:14" (1/1) ... [2025-01-09 04:15:14,147 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:14" (1/1) ... [2025-01-09 04:15:14,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:14" (1/1) ... [2025-01-09 04:15:14,161 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:14" (1/1) ... [2025-01-09 04:15:14,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:14" (1/1) ... [2025-01-09 04:15:14,165 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:15:14,165 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:15:14,165 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:15:14,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:15:14,166 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:14" (1/1) ... [2025-01-09 04:15:14,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:15:14,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:14,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:15:14,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:15:14,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:15:14,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:15:14,230 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 04:15:14,231 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 04:15:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:15:14,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:15:14,284 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:15:14,285 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:15:14,856 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-01-09 04:15:14,856 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:15:14,872 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:15:14,875 INFO L312 CfgBuilder]: Removed 13 assume(true) statements. [2025-01-09 04:15:14,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:15:14 BoogieIcfgContainer [2025-01-09 04:15:14,875 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:15:14,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:15:14,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:15:14,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:15:14,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:15:13" (1/3) ... [2025-01-09 04:15:14,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3cde9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:15:14, skipping insertion in model container [2025-01-09 04:15:14,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:14" (2/3) ... [2025-01-09 04:15:14,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3cde9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:15:14, skipping insertion in model container [2025-01-09 04:15:14,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:15:14" (3/3) ... [2025-01-09 04:15:14,882 INFO L128 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2025-01-09 04:15:14,892 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:15:14,893 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mem_slave_tlm.1.cil.c that has 2 procedures, 259 locations, 1 initial locations, 13 loop locations, and 1 error locations. [2025-01-09 04:15:14,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:15:14,954 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;@2a3b69d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:15:14,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:15:14,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 259 states, 251 states have (on average 1.840637450199203) internal successors, (462), 257 states have internal predecessors, (462), 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-01-09 04:15:14,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 04:15:14,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:14,967 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] [2025-01-09 04:15:14,968 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:14,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:14,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1946671620, now seen corresponding path program 1 times [2025-01-09 04:15:14,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:14,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439776197] [2025-01-09 04:15:14,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:14,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:15,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 04:15:15,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 04:15:15,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:15,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:15,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:15,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439776197] [2025-01-09 04:15:15,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439776197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:15,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:15,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:15,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818173835] [2025-01-09 04:15:15,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:15,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:15,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:15,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:15,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:15,262 INFO L87 Difference]: Start difference. First operand has 259 states, 251 states have (on average 1.840637450199203) internal successors, (462), 257 states have internal predecessors, (462), 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.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-01-09 04:15:15,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:15,573 INFO L93 Difference]: Finished difference Result 676 states and 1230 transitions. [2025-01-09 04:15:15,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:15,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 26 [2025-01-09 04:15:15,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:15,590 INFO L225 Difference]: With dead ends: 676 [2025-01-09 04:15:15,590 INFO L226 Difference]: Without dead ends: 414 [2025-01-09 04:15:15,593 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-01-09 04:15:15,599 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 243 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 739 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.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:15,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 739 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:15:15,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-01-09 04:15:15,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 401. [2025-01-09 04:15:15,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 395 states have (on average 1.6253164556962025) internal successors, (642), 399 states have internal predecessors, (642), 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-01-09 04:15:15,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 647 transitions. [2025-01-09 04:15:15,651 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 647 transitions. Word has length 26 [2025-01-09 04:15:15,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:15,652 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 647 transitions. [2025-01-09 04:15:15,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-01-09 04:15:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 647 transitions. [2025-01-09 04:15:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 04:15:15,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:15,653 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-01-09 04:15:15,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:15:15,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:15,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:15,655 INFO L85 PathProgramCache]: Analyzing trace with hash -21687460, now seen corresponding path program 1 times [2025-01-09 04:15:15,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:15,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899880961] [2025-01-09 04:15:15,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:15,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:15,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 04:15:15,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 04:15:15,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:15,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:15,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:15,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:15,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899880961] [2025-01-09 04:15:15,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899880961] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:15,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:15,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:15,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074395255] [2025-01-09 04:15:15,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:15,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:15,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:15,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:15,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:15,735 INFO L87 Difference]: Start difference. First operand 401 states and 647 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-01-09 04:15:15,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:15,836 INFO L93 Difference]: Finished difference Result 1049 states and 1717 transitions. [2025-01-09 04:15:15,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:15,837 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-01-09 04:15:15,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:15,839 INFO L225 Difference]: With dead ends: 1049 [2025-01-09 04:15:15,840 INFO L226 Difference]: Without dead ends: 662 [2025-01-09 04:15:15,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-01-09 04:15:15,886 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 308 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 976 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-01-09 04:15:15,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 976 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:15:15,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-01-09 04:15:15,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 649. [2025-01-09 04:15:15,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 643 states have (on average 1.6609642301710732) internal successors, (1068), 647 states have internal predecessors, (1068), 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-01-09 04:15:15,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1073 transitions. [2025-01-09 04:15:15,940 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1073 transitions. Word has length 34 [2025-01-09 04:15:15,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:15,940 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 1073 transitions. [2025-01-09 04:15:15,940 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-01-09 04:15:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1073 transitions. [2025-01-09 04:15:15,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 04:15:15,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:15,942 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] [2025-01-09 04:15:15,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:15:15,942 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:15,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:15,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1409414147, now seen corresponding path program 1 times [2025-01-09 04:15:15,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:15,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516439222] [2025-01-09 04:15:15,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:15,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:15,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 04:15:15,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 04:15:15,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:15,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:16,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:16,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:16,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516439222] [2025-01-09 04:15:16,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516439222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:16,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:16,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:16,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407607686] [2025-01-09 04:15:16,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:16,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:16,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:16,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:16,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:16,023 INFO L87 Difference]: Start difference. First operand 649 states and 1073 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-01-09 04:15:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:16,058 INFO L93 Difference]: Finished difference Result 1629 states and 2704 transitions. [2025-01-09 04:15:16,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:16,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 35 [2025-01-09 04:15:16,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:16,062 INFO L225 Difference]: With dead ends: 1629 [2025-01-09 04:15:16,062 INFO L226 Difference]: Without dead ends: 1005 [2025-01-09 04:15:16,063 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-01-09 04:15:16,064 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 336 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 781 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-01-09 04:15:16,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 781 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:16,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2025-01-09 04:15:16,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 994. [2025-01-09 04:15:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 988 states have (on average 1.6619433198380567) internal successors, (1642), 992 states have internal predecessors, (1642), 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-01-09 04:15:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1647 transitions. [2025-01-09 04:15:16,086 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1647 transitions. Word has length 35 [2025-01-09 04:15:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:16,087 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1647 transitions. [2025-01-09 04:15:16,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-01-09 04:15:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1647 transitions. [2025-01-09 04:15:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 04:15:16,088 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:16,088 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] [2025-01-09 04:15:16,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:15:16,088 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:16,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:16,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1946873785, now seen corresponding path program 1 times [2025-01-09 04:15:16,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:16,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715104509] [2025-01-09 04:15:16,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:16,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:16,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 04:15:16,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 04:15:16,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:16,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:16,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:16,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715104509] [2025-01-09 04:15:16,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715104509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:16,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:16,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:15:16,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57586402] [2025-01-09 04:15:16,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:16,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:15:16,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:16,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:15:16,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:15:16,160 INFO L87 Difference]: Start difference. First operand 994 states and 1647 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-01-09 04:15:16,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:16,531 INFO L93 Difference]: Finished difference Result 2724 states and 4497 transitions. [2025-01-09 04:15:16,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:15:16,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 42 [2025-01-09 04:15:16,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:16,537 INFO L225 Difference]: With dead ends: 2724 [2025-01-09 04:15:16,537 INFO L226 Difference]: Without dead ends: 1755 [2025-01-09 04:15:16,538 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-01-09 04:15:16,538 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 556 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:16,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1474 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:15:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2025-01-09 04:15:16,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1534. [2025-01-09 04:15:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1534 states, 1528 states have (on average 1.638743455497382) internal successors, (2504), 1532 states have internal predecessors, (2504), 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-01-09 04:15:16,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 2509 transitions. [2025-01-09 04:15:16,572 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 2509 transitions. Word has length 42 [2025-01-09 04:15:16,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:16,572 INFO L471 AbstractCegarLoop]: Abstraction has 1534 states and 2509 transitions. [2025-01-09 04:15:16,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-01-09 04:15:16,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 2509 transitions. [2025-01-09 04:15:16,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 04:15:16,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:16,573 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] [2025-01-09 04:15:16,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:15:16,573 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:16,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:16,574 INFO L85 PathProgramCache]: Analyzing trace with hash 985207977, now seen corresponding path program 1 times [2025-01-09 04:15:16,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:16,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978870328] [2025-01-09 04:15:16,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:16,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:16,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 04:15:16,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 04:15:16,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:16,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:16,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:16,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978870328] [2025-01-09 04:15:16,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978870328] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:16,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:16,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:15:16,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483342668] [2025-01-09 04:15:16,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:16,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:15:16,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:16,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:15:16,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:15:16,641 INFO L87 Difference]: Start difference. First operand 1534 states and 2509 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-01-09 04:15:17,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:17,010 INFO L93 Difference]: Finished difference Result 4521 states and 7312 transitions. [2025-01-09 04:15:17,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:15:17,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 47 [2025-01-09 04:15:17,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:17,020 INFO L225 Difference]: With dead ends: 4521 [2025-01-09 04:15:17,020 INFO L226 Difference]: Without dead ends: 3006 [2025-01-09 04:15:17,022 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-01-09 04:15:17,024 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 700 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:17,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 979 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:15:17,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2025-01-09 04:15:17,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 2678. [2025-01-09 04:15:17,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2678 states, 2672 states have (on average 1.6119011976047903) internal successors, (4307), 2676 states have internal predecessors, (4307), 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-01-09 04:15:17,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2678 states to 2678 states and 4312 transitions. [2025-01-09 04:15:17,106 INFO L78 Accepts]: Start accepts. Automaton has 2678 states and 4312 transitions. Word has length 47 [2025-01-09 04:15:17,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:17,107 INFO L471 AbstractCegarLoop]: Abstraction has 2678 states and 4312 transitions. [2025-01-09 04:15:17,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-01-09 04:15:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2678 states and 4312 transitions. [2025-01-09 04:15:17,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 04:15:17,108 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:17,109 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] [2025-01-09 04:15:17,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:15:17,109 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:17,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:17,109 INFO L85 PathProgramCache]: Analyzing trace with hash -917629687, now seen corresponding path program 1 times [2025-01-09 04:15:17,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:17,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675016184] [2025-01-09 04:15:17,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:17,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:17,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 04:15:17,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 04:15:17,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:17,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:17,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:17,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:17,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675016184] [2025-01-09 04:15:17,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675016184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:17,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:17,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:17,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640258560] [2025-01-09 04:15:17,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:17,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:17,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:17,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:17,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:17,161 INFO L87 Difference]: Start difference. First operand 2678 states and 4312 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (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-01-09 04:15:17,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:17,265 INFO L93 Difference]: Finished difference Result 6241 states and 10029 transitions. [2025-01-09 04:15:17,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:17,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (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 47 [2025-01-09 04:15:17,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:17,276 INFO L225 Difference]: With dead ends: 6241 [2025-01-09 04:15:17,276 INFO L226 Difference]: Without dead ends: 3586 [2025-01-09 04:15:17,280 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-01-09 04:15:17,282 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 354 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 672 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-01-09 04:15:17,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 672 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3586 states. [2025-01-09 04:15:17,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3586 to 3430. [2025-01-09 04:15:17,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3430 states, 3424 states have (on average 1.5925817757009346) internal successors, (5453), 3428 states have internal predecessors, (5453), 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-01-09 04:15:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3430 states to 3430 states and 5458 transitions. [2025-01-09 04:15:17,408 INFO L78 Accepts]: Start accepts. Automaton has 3430 states and 5458 transitions. Word has length 47 [2025-01-09 04:15:17,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:17,408 INFO L471 AbstractCegarLoop]: Abstraction has 3430 states and 5458 transitions. [2025-01-09 04:15:17,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (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-01-09 04:15:17,409 INFO L276 IsEmpty]: Start isEmpty. Operand 3430 states and 5458 transitions. [2025-01-09 04:15:17,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 04:15:17,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:17,410 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] [2025-01-09 04:15:17,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:15:17,410 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:17,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:17,411 INFO L85 PathProgramCache]: Analyzing trace with hash 515364695, now seen corresponding path program 1 times [2025-01-09 04:15:17,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:17,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821962941] [2025-01-09 04:15:17,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:17,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:17,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 04:15:17,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 04:15:17,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:17,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:17,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:17,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:17,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821962941] [2025-01-09 04:15:17,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821962941] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:17,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:17,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:17,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074031591] [2025-01-09 04:15:17,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:17,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:17,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:17,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:17,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:17,457 INFO L87 Difference]: Start difference. First operand 3430 states and 5458 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-01-09 04:15:17,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:17,808 INFO L93 Difference]: Finished difference Result 8240 states and 13226 transitions. [2025-01-09 04:15:17,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:17,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 51 [2025-01-09 04:15:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:17,824 INFO L225 Difference]: With dead ends: 8240 [2025-01-09 04:15:17,824 INFO L226 Difference]: Without dead ends: 4833 [2025-01-09 04:15:17,830 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-01-09 04:15:17,830 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 231 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 829 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-01-09 04:15:17,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 829 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:15:17,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states. [2025-01-09 04:15:17,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 4156. [2025-01-09 04:15:17,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4156 states, 4150 states have (on average 1.5272289156626506) internal successors, (6338), 4154 states have internal predecessors, (6338), 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-01-09 04:15:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4156 states to 4156 states and 6343 transitions. [2025-01-09 04:15:17,972 INFO L78 Accepts]: Start accepts. Automaton has 4156 states and 6343 transitions. Word has length 51 [2025-01-09 04:15:17,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:17,972 INFO L471 AbstractCegarLoop]: Abstraction has 4156 states and 6343 transitions. [2025-01-09 04:15:17,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-01-09 04:15:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 4156 states and 6343 transitions. [2025-01-09 04:15:17,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 04:15:17,974 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:17,974 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-01-09 04:15:17,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:15:17,974 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:17,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:17,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1928173035, now seen corresponding path program 1 times [2025-01-09 04:15:17,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:17,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643305435] [2025-01-09 04:15:17,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:17,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:17,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 04:15:17,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 04:15:17,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:17,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:18,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:18,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643305435] [2025-01-09 04:15:18,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643305435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:18,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:18,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:18,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315352324] [2025-01-09 04:15:18,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:18,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:18,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:18,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:18,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:18,011 INFO L87 Difference]: Start difference. First operand 4156 states and 6343 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (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-01-09 04:15:18,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:18,110 INFO L93 Difference]: Finished difference Result 8163 states and 12471 transitions. [2025-01-09 04:15:18,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:18,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (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-01-09 04:15:18,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:18,121 INFO L225 Difference]: With dead ends: 8163 [2025-01-09 04:15:18,121 INFO L226 Difference]: Without dead ends: 4030 [2025-01-09 04:15:18,125 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-01-09 04:15:18,126 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 332 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 423 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-01-09 04:15:18,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 423 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:18,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4030 states. [2025-01-09 04:15:18,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4030 to 4030. [2025-01-09 04:15:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4030 states, 4024 states have (on average 1.5022365805168987) internal successors, (6045), 4028 states have internal predecessors, (6045), 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-01-09 04:15:18,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4030 states to 4030 states and 6050 transitions. [2025-01-09 04:15:18,214 INFO L78 Accepts]: Start accepts. Automaton has 4030 states and 6050 transitions. Word has length 53 [2025-01-09 04:15:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:18,214 INFO L471 AbstractCegarLoop]: Abstraction has 4030 states and 6050 transitions. [2025-01-09 04:15:18,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (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-01-09 04:15:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 4030 states and 6050 transitions. [2025-01-09 04:15:18,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 04:15:18,216 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:18,216 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-01-09 04:15:18,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:15:18,216 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:18,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:18,216 INFO L85 PathProgramCache]: Analyzing trace with hash 182275968, now seen corresponding path program 1 times [2025-01-09 04:15:18,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:18,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561931795] [2025-01-09 04:15:18,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:18,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:18,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 04:15:18,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 04:15:18,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:18,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:18,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:18,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561931795] [2025-01-09 04:15:18,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561931795] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:18,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:18,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:18,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801071971] [2025-01-09 04:15:18,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:18,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:18,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:18,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:18,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:18,267 INFO L87 Difference]: Start difference. First operand 4030 states and 6050 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (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-01-09 04:15:18,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:18,366 INFO L93 Difference]: Finished difference Result 7714 states and 11707 transitions. [2025-01-09 04:15:18,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:18,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (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-01-09 04:15:18,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:18,378 INFO L225 Difference]: With dead ends: 7714 [2025-01-09 04:15:18,378 INFO L226 Difference]: Without dead ends: 3707 [2025-01-09 04:15:18,382 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-01-09 04:15:18,384 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 145 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:18,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 854 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2025-01-09 04:15:18,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 3118. [2025-01-09 04:15:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3118 states, 3112 states have (on average 1.5260282776349614) internal successors, (4749), 3116 states have internal predecessors, (4749), 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-01-09 04:15:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 4754 transitions. [2025-01-09 04:15:18,460 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 4754 transitions. Word has length 53 [2025-01-09 04:15:18,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:18,460 INFO L471 AbstractCegarLoop]: Abstraction has 3118 states and 4754 transitions. [2025-01-09 04:15:18,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (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-01-09 04:15:18,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 4754 transitions. [2025-01-09 04:15:18,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:15:18,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:18,461 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, 1, 1] [2025-01-09 04:15:18,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:15:18,462 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:18,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:18,462 INFO L85 PathProgramCache]: Analyzing trace with hash 313036988, now seen corresponding path program 1 times [2025-01-09 04:15:18,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:18,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023898509] [2025-01-09 04:15:18,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:18,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:18,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:15:18,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:15:18,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:18,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:18,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:18,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023898509] [2025-01-09 04:15:18,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023898509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:18,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:18,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:15:18,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622624149] [2025-01-09 04:15:18,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:18,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:15:18,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:18,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:15:18,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:18,527 INFO L87 Difference]: Start difference. First operand 3118 states and 4754 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-01-09 04:15:18,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:18,935 INFO L93 Difference]: Finished difference Result 8499 states and 12916 transitions. [2025-01-09 04:15:18,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:15:18,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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 56 [2025-01-09 04:15:18,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:18,948 INFO L225 Difference]: With dead ends: 8499 [2025-01-09 04:15:18,948 INFO L226 Difference]: Without dead ends: 5582 [2025-01-09 04:15:18,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 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-01-09 04:15:18,950 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 900 mSDsluCounter, 1765 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 2293 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:18,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 2293 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:15:18,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5582 states. [2025-01-09 04:15:19,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5582 to 3888. [2025-01-09 04:15:19,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3888 states, 3882 states have (on average 1.522668727460072) internal successors, (5911), 3886 states have internal predecessors, (5911), 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-01-09 04:15:19,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3888 states to 3888 states and 5916 transitions. [2025-01-09 04:15:19,046 INFO L78 Accepts]: Start accepts. Automaton has 3888 states and 5916 transitions. Word has length 56 [2025-01-09 04:15:19,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:19,046 INFO L471 AbstractCegarLoop]: Abstraction has 3888 states and 5916 transitions. [2025-01-09 04:15:19,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-01-09 04:15:19,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3888 states and 5916 transitions. [2025-01-09 04:15:19,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 04:15:19,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:19,047 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, 1, 1, 1] [2025-01-09 04:15:19,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:15:19,047 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:19,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:19,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1125343048, now seen corresponding path program 1 times [2025-01-09 04:15:19,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:19,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109398346] [2025-01-09 04:15:19,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:19,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:19,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 04:15:19,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 04:15:19,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:19,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:19,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:19,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109398346] [2025-01-09 04:15:19,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109398346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:19,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:19,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:15:19,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196899403] [2025-01-09 04:15:19,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:19,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:15:19,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:19,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:15:19,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:15:19,108 INFO L87 Difference]: Start difference. First operand 3888 states and 5916 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-01-09 04:15:19,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:19,332 INFO L93 Difference]: Finished difference Result 5671 states and 8506 transitions. [2025-01-09 04:15:19,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:15:19,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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 57 [2025-01-09 04:15:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:19,342 INFO L225 Difference]: With dead ends: 5671 [2025-01-09 04:15:19,342 INFO L226 Difference]: Without dead ends: 5668 [2025-01-09 04:15:19,342 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-01-09 04:15:19,343 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 798 mSDsluCounter, 2296 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 2815 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:19,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 2815 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:15:19,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5668 states. [2025-01-09 04:15:19,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5668 to 4172. [2025-01-09 04:15:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4172 states, 4166 states have (on average 1.511521843494959) internal successors, (6297), 4170 states have internal predecessors, (6297), 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-01-09 04:15:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4172 states to 4172 states and 6302 transitions. [2025-01-09 04:15:19,489 INFO L78 Accepts]: Start accepts. Automaton has 4172 states and 6302 transitions. Word has length 57 [2025-01-09 04:15:19,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:19,489 INFO L471 AbstractCegarLoop]: Abstraction has 4172 states and 6302 transitions. [2025-01-09 04:15:19,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-01-09 04:15:19,489 INFO L276 IsEmpty]: Start isEmpty. Operand 4172 states and 6302 transitions. [2025-01-09 04:15:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:15:19,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:19,491 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, 1, 1, 1] [2025-01-09 04:15:19,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:15:19,491 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:19,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:19,492 INFO L85 PathProgramCache]: Analyzing trace with hash -282257455, now seen corresponding path program 1 times [2025-01-09 04:15:19,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:19,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866694514] [2025-01-09 04:15:19,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:19,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:19,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:15:19,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:15:19,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:19,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:19,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:19,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:19,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866694514] [2025-01-09 04:15:19,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866694514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:19,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:19,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:19,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882715281] [2025-01-09 04:15:19,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:19,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:19,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:19,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:19,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:19,520 INFO L87 Difference]: Start difference. First operand 4172 states and 6302 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-01-09 04:15:19,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:19,659 INFO L93 Difference]: Finished difference Result 8773 states and 13214 transitions. [2025-01-09 04:15:19,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:19,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 70 [2025-01-09 04:15:19,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:19,668 INFO L225 Difference]: With dead ends: 8773 [2025-01-09 04:15:19,668 INFO L226 Difference]: Without dead ends: 4622 [2025-01-09 04:15:19,672 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-01-09 04:15:19,672 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 121 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 777 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:19,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 777 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:19,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2025-01-09 04:15:19,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 4564. [2025-01-09 04:15:19,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4564 states, 4558 states have (on average 1.502632733655112) internal successors, (6849), 4562 states have internal predecessors, (6849), 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-01-09 04:15:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4564 states to 4564 states and 6854 transitions. [2025-01-09 04:15:19,826 INFO L78 Accepts]: Start accepts. Automaton has 4564 states and 6854 transitions. Word has length 70 [2025-01-09 04:15:19,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:19,826 INFO L471 AbstractCegarLoop]: Abstraction has 4564 states and 6854 transitions. [2025-01-09 04:15:19,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-01-09 04:15:19,826 INFO L276 IsEmpty]: Start isEmpty. Operand 4564 states and 6854 transitions. [2025-01-09 04:15:19,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 04:15:19,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:19,828 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 04:15:19,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:15:19,828 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:19,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:19,828 INFO L85 PathProgramCache]: Analyzing trace with hash 562108571, now seen corresponding path program 1 times [2025-01-09 04:15:19,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:19,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558892111] [2025-01-09 04:15:19,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:19,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:19,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 04:15:19,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 04:15:19,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:19,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:19,873 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:19,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:19,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558892111] [2025-01-09 04:15:19,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558892111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:19,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:19,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:15:19,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95490052] [2025-01-09 04:15:19,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:19,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:15:19,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:19,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:15:19,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:15:19,874 INFO L87 Difference]: Start difference. First operand 4564 states and 6854 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-01-09 04:15:20,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:20,206 INFO L93 Difference]: Finished difference Result 12121 states and 18075 transitions. [2025-01-09 04:15:20,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:15:20,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 80 [2025-01-09 04:15:20,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:20,220 INFO L225 Difference]: With dead ends: 12121 [2025-01-09 04:15:20,220 INFO L226 Difference]: Without dead ends: 7468 [2025-01-09 04:15:20,226 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-01-09 04:15:20,226 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 611 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1336 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:20,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1336 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:15:20,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7468 states. [2025-01-09 04:15:20,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7468 to 6693. [2025-01-09 04:15:20,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6693 states, 6687 states have (on average 1.480933153880664) internal successors, (9903), 6691 states have internal predecessors, (9903), 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-01-09 04:15:20,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6693 states to 6693 states and 9908 transitions. [2025-01-09 04:15:20,432 INFO L78 Accepts]: Start accepts. Automaton has 6693 states and 9908 transitions. Word has length 80 [2025-01-09 04:15:20,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:20,432 INFO L471 AbstractCegarLoop]: Abstraction has 6693 states and 9908 transitions. [2025-01-09 04:15:20,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-01-09 04:15:20,432 INFO L276 IsEmpty]: Start isEmpty. Operand 6693 states and 9908 transitions. [2025-01-09 04:15:20,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:15:20,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:20,434 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 04:15:20,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:15:20,434 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:20,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:20,435 INFO L85 PathProgramCache]: Analyzing trace with hash -343385143, now seen corresponding path program 1 times [2025-01-09 04:15:20,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:20,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660329484] [2025-01-09 04:15:20,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:20,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:20,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:15:20,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:15:20,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:20,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:20,474 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:20,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:20,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660329484] [2025-01-09 04:15:20,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660329484] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:20,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:20,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:20,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004554406] [2025-01-09 04:15:20,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:20,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:20,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:20,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:20,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:20,476 INFO L87 Difference]: Start difference. First operand 6693 states and 9908 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-01-09 04:15:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:20,577 INFO L93 Difference]: Finished difference Result 9656 states and 14349 transitions. [2025-01-09 04:15:20,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:20,578 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-01-09 04:15:20,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:20,585 INFO L225 Difference]: With dead ends: 9656 [2025-01-09 04:15:20,585 INFO L226 Difference]: Without dead ends: 2967 [2025-01-09 04:15:20,593 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-01-09 04:15:20,593 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 324 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 485 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-01-09 04:15:20,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 485 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:20,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2025-01-09 04:15:20,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2922. [2025-01-09 04:15:20,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2916 states have (on average 1.3868312757201646) internal successors, (4044), 2920 states have internal predecessors, (4044), 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-01-09 04:15:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 4049 transitions. [2025-01-09 04:15:20,662 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 4049 transitions. Word has length 87 [2025-01-09 04:15:20,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:20,662 INFO L471 AbstractCegarLoop]: Abstraction has 2922 states and 4049 transitions. [2025-01-09 04:15:20,662 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-01-09 04:15:20,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 4049 transitions. [2025-01-09 04:15:20,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 04:15:20,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:20,663 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:15:20,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:15:20,664 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:20,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:20,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1923573105, now seen corresponding path program 1 times [2025-01-09 04:15:20,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:20,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9303589] [2025-01-09 04:15:20,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:20,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:20,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 04:15:20,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 04:15:20,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:20,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:20,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:20,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9303589] [2025-01-09 04:15:20,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9303589] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:20,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:20,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:15:20,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689109207] [2025-01-09 04:15:20,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:20,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:15:20,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:20,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:15:20,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:15:20,717 INFO L87 Difference]: Start difference. First operand 2922 states and 4049 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-01-09 04:15:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:20,855 INFO L93 Difference]: Finished difference Result 6653 states and 9220 transitions. [2025-01-09 04:15:20,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:15:20,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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 90 [2025-01-09 04:15:20,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:20,862 INFO L225 Difference]: With dead ends: 6653 [2025-01-09 04:15:20,862 INFO L226 Difference]: Without dead ends: 3887 [2025-01-09 04:15:20,865 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-01-09 04:15:20,865 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 517 mSDsluCounter, 1582 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 2256 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:20,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 2256 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:15:20,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3887 states. [2025-01-09 04:15:20,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3887 to 2924. [2025-01-09 04:15:20,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2924 states, 2918 states have (on average 1.3845099383139137) internal successors, (4040), 2922 states have internal predecessors, (4040), 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-01-09 04:15:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2924 states and 4045 transitions. [2025-01-09 04:15:20,925 INFO L78 Accepts]: Start accepts. Automaton has 2924 states and 4045 transitions. Word has length 90 [2025-01-09 04:15:20,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:20,925 INFO L471 AbstractCegarLoop]: Abstraction has 2924 states and 4045 transitions. [2025-01-09 04:15:20,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-01-09 04:15:20,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 4045 transitions. [2025-01-09 04:15:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 04:15:20,926 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:20,927 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:15:20,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:15:20,927 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:20,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:20,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2074125002, now seen corresponding path program 1 times [2025-01-09 04:15:20,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:20,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248174108] [2025-01-09 04:15:20,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:20,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:20,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 04:15:20,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 04:15:20,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:20,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:20,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:20,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248174108] [2025-01-09 04:15:21,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248174108] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:21,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839863703] [2025-01-09 04:15:21,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:21,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:21,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:21,004 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:15:21,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:15:21,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 04:15:21,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 04:15:21,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:21,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:21,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 04:15:21,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:21,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:15:21,191 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:15:21,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839863703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:21,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:15:21,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 04:15:21,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142594964] [2025-01-09 04:15:21,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:21,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:21,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:21,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:21,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:21,192 INFO L87 Difference]: Start difference. First operand 2924 states and 4045 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-01-09 04:15:21,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:21,270 INFO L93 Difference]: Finished difference Result 3523 states and 4850 transitions. [2025-01-09 04:15:21,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:21,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 92 [2025-01-09 04:15:21,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:21,276 INFO L225 Difference]: With dead ends: 3523 [2025-01-09 04:15:21,276 INFO L226 Difference]: Without dead ends: 3519 [2025-01-09 04:15:21,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 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-01-09 04:15:21,277 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 219 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 757 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-01-09 04:15:21,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 757 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:21,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3519 states. [2025-01-09 04:15:21,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3519 to 3469. [2025-01-09 04:15:21,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3469 states, 3463 states have (on average 1.3765521224371933) internal successors, (4767), 3467 states have internal predecessors, (4767), 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-01-09 04:15:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 3469 states and 4772 transitions. [2025-01-09 04:15:21,434 INFO L78 Accepts]: Start accepts. Automaton has 3469 states and 4772 transitions. Word has length 92 [2025-01-09 04:15:21,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:21,434 INFO L471 AbstractCegarLoop]: Abstraction has 3469 states and 4772 transitions. [2025-01-09 04:15:21,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-01-09 04:15:21,434 INFO L276 IsEmpty]: Start isEmpty. Operand 3469 states and 4772 transitions. [2025-01-09 04:15:21,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 04:15:21,437 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:21,437 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, 1, 1, 1, 1] [2025-01-09 04:15:21,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:15:21,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 04:15:21,641 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:21,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:21,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1702151860, now seen corresponding path program 1 times [2025-01-09 04:15:21,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:21,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647492407] [2025-01-09 04:15:21,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:21,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:21,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 04:15:21,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 04:15:21,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:21,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:21,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:21,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647492407] [2025-01-09 04:15:21,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647492407] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:21,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325064513] [2025-01-09 04:15:21,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:21,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:21,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:21,752 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:15:21,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:15:21,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 04:15:21,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 04:15:21,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:21,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:21,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 04:15:21,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:21,947 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:15:21,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:15:21,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325064513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:21,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:15:21,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 04:15:21,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780828095] [2025-01-09 04:15:21,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:21,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:21,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:21,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:21,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:21,951 INFO L87 Difference]: Start difference. First operand 3469 states and 4772 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 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-01-09 04:15:22,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:22,067 INFO L93 Difference]: Finished difference Result 6192 states and 8554 transitions. [2025-01-09 04:15:22,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:22,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 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 139 [2025-01-09 04:15:22,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:22,074 INFO L225 Difference]: With dead ends: 6192 [2025-01-09 04:15:22,075 INFO L226 Difference]: Without dead ends: 2730 [2025-01-09 04:15:22,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 139 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-01-09 04:15:22,080 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 248 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 402 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-01-09 04:15:22,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 402 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:22,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2025-01-09 04:15:22,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 2537. [2025-01-09 04:15:22,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 2531 states have (on average 1.3472935598577638) internal successors, (3410), 2535 states have internal predecessors, (3410), 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-01-09 04:15:22,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 3415 transitions. [2025-01-09 04:15:22,190 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 3415 transitions. Word has length 139 [2025-01-09 04:15:22,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:22,191 INFO L471 AbstractCegarLoop]: Abstraction has 2537 states and 3415 transitions. [2025-01-09 04:15:22,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 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-01-09 04:15:22,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 3415 transitions. [2025-01-09 04:15:22,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:15:22,194 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:22,194 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:15:22,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 04:15:22,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 04:15:22,395 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:22,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:22,395 INFO L85 PathProgramCache]: Analyzing trace with hash -233534990, now seen corresponding path program 1 times [2025-01-09 04:15:22,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:22,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614902040] [2025-01-09 04:15:22,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:22,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:22,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:15:22,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:15:22,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:22,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:15:22,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:22,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614902040] [2025-01-09 04:15:22,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614902040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:22,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:22,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:22,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970382619] [2025-01-09 04:15:22,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:22,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:22,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:22,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:22,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:22,469 INFO L87 Difference]: Start difference. First operand 2537 states and 3415 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 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-01-09 04:15:22,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:22,622 INFO L93 Difference]: Finished difference Result 3075 states and 4096 transitions. [2025-01-09 04:15:22,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:22,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 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 142 [2025-01-09 04:15:22,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:22,626 INFO L225 Difference]: With dead ends: 3075 [2025-01-09 04:15:22,626 INFO L226 Difference]: Without dead ends: 588 [2025-01-09 04:15:22,628 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-01-09 04:15:22,629 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 124 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 354 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-01-09 04:15:22,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 354 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:15:22,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-01-09 04:15:22,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 580. [2025-01-09 04:15:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 576 states have (on average 1.0868055555555556) internal successors, (626), 578 states have internal predecessors, (626), 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-01-09 04:15:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 629 transitions. [2025-01-09 04:15:22,659 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 629 transitions. Word has length 142 [2025-01-09 04:15:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:22,660 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 629 transitions. [2025-01-09 04:15:22,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 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-01-09 04:15:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 629 transitions. [2025-01-09 04:15:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 04:15:22,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:22,661 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, 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] [2025-01-09 04:15:22,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:15:22,662 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:22,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:22,662 INFO L85 PathProgramCache]: Analyzing trace with hash 764619753, now seen corresponding path program 1 times [2025-01-09 04:15:22,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:22,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101759206] [2025-01-09 04:15:22,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:22,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:22,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 04:15:22,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 04:15:22,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:22,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:22,820 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 40 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:15:22,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:22,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101759206] [2025-01-09 04:15:22,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101759206] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:22,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868726390] [2025-01-09 04:15:22,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:22,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:22,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:22,826 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:15:22,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 04:15:22,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 04:15:22,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 04:15:22,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:22,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:22,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:15:22,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:23,100 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:15:23,101 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:15:23,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868726390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:23,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:15:23,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-09 04:15:23,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163165548] [2025-01-09 04:15:23,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:23,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:15:23,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:23,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:15:23,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:15:23,102 INFO L87 Difference]: Start difference. First operand 580 states and 629 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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-01-09 04:15:23,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:23,149 INFO L93 Difference]: Finished difference Result 848 states and 919 transitions. [2025-01-09 04:15:23,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:15:23,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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 146 [2025-01-09 04:15:23,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:23,152 INFO L225 Difference]: With dead ends: 848 [2025-01-09 04:15:23,152 INFO L226 Difference]: Without dead ends: 493 [2025-01-09 04:15:23,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 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-01-09 04:15:23,153 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 211 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:23,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 390 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:23,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-01-09 04:15:23,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2025-01-09 04:15:23,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 489 states have (on average 1.0838445807770962) internal successors, (530), 491 states have internal predecessors, (530), 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-01-09 04:15:23,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 533 transitions. [2025-01-09 04:15:23,170 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 533 transitions. Word has length 146 [2025-01-09 04:15:23,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:23,170 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 533 transitions. [2025-01-09 04:15:23,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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-01-09 04:15:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 533 transitions. [2025-01-09 04:15:23,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 04:15:23,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:23,172 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:15:23,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 04:15:23,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:23,376 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:23,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:23,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1162538365, now seen corresponding path program 1 times [2025-01-09 04:15:23,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:23,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328162590] [2025-01-09 04:15:23,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:23,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:23,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 04:15:23,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 04:15:23,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:23,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:15:23,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:23,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328162590] [2025-01-09 04:15:23,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328162590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:23,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:23,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:15:23,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549565682] [2025-01-09 04:15:23,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:23,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:15:23,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:23,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:15:23,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:15:23,482 INFO L87 Difference]: Start difference. First operand 493 states and 533 transitions. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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-01-09 04:15:23,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:23,565 INFO L93 Difference]: Finished difference Result 501 states and 540 transitions. [2025-01-09 04:15:23,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:15:23,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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 147 [2025-01-09 04:15:23,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:23,568 INFO L225 Difference]: With dead ends: 501 [2025-01-09 04:15:23,568 INFO L226 Difference]: Without dead ends: 498 [2025-01-09 04:15:23,569 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-01-09 04:15:23,569 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 193 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:23,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1153 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:23,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-01-09 04:15:23,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 492. [2025-01-09 04:15:23,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 489 states have (on average 1.0797546012269938) internal successors, (528), 490 states have internal predecessors, (528), 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-01-09 04:15:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 530 transitions. [2025-01-09 04:15:23,607 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 530 transitions. Word has length 147 [2025-01-09 04:15:23,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:23,607 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 530 transitions. [2025-01-09 04:15:23,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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-01-09 04:15:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 530 transitions. [2025-01-09 04:15:23,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 04:15:23,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:23,610 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:15:23,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:15:23,610 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:23,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:23,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1690081959, now seen corresponding path program 1 times [2025-01-09 04:15:23,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:23,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485618886] [2025-01-09 04:15:23,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:23,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:23,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 04:15:23,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 04:15:23,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:23,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:23,684 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:15:23,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:23,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485618886] [2025-01-09 04:15:23,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485618886] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:23,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:23,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:15:23,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463166726] [2025-01-09 04:15:23,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:23,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:15:23,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:23,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:15:23,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:15:23,686 INFO L87 Difference]: Start difference. First operand 492 states and 530 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 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-01-09 04:15:23,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:23,733 INFO L93 Difference]: Finished difference Result 585 states and 626 transitions. [2025-01-09 04:15:23,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:15:23,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 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 148 [2025-01-09 04:15:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:23,736 INFO L225 Difference]: With dead ends: 585 [2025-01-09 04:15:23,736 INFO L226 Difference]: Without dead ends: 487 [2025-01-09 04:15:23,736 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-01-09 04:15:23,737 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 147 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 740 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-01-09 04:15:23,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 740 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:23,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-01-09 04:15:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 485. [2025-01-09 04:15:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 483 states have (on average 1.0683229813664596) internal successors, (516), 483 states have internal predecessors, (516), 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-01-09 04:15:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 517 transitions. [2025-01-09 04:15:23,755 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 517 transitions. Word has length 148 [2025-01-09 04:15:23,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:23,755 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 517 transitions. [2025-01-09 04:15:23,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 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-01-09 04:15:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 517 transitions. [2025-01-09 04:15:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 04:15:23,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:23,757 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 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, 1, 1, 1, 1] [2025-01-09 04:15:23,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:15:23,757 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:23,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:23,758 INFO L85 PathProgramCache]: Analyzing trace with hash 801811175, now seen corresponding path program 1 times [2025-01-09 04:15:23,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:23,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288625582] [2025-01-09 04:15:23,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:23,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:23,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 04:15:23,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 04:15:23,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:23,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:23,823 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 04:15:23,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:23,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288625582] [2025-01-09 04:15:23,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288625582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:23,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:23,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:23,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880783452] [2025-01-09 04:15:23,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:23,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:23,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:23,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:23,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:23,824 INFO L87 Difference]: Start difference. First operand 485 states and 517 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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-01-09 04:15:23,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:23,847 INFO L93 Difference]: Finished difference Result 678 states and 718 transitions. [2025-01-09 04:15:23,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:23,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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 204 [2025-01-09 04:15:23,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:23,852 INFO L225 Difference]: With dead ends: 678 [2025-01-09 04:15:23,852 INFO L226 Difference]: Without dead ends: 426 [2025-01-09 04:15:23,852 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-01-09 04:15:23,853 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 7 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:23,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 362 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:23,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-01-09 04:15:23,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 345. [2025-01-09 04:15:23,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 343 states have (on average 1.0728862973760933) internal successors, (368), 343 states have internal predecessors, (368), 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-01-09 04:15:23,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 369 transitions. [2025-01-09 04:15:23,867 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 369 transitions. Word has length 204 [2025-01-09 04:15:23,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:23,867 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 369 transitions. [2025-01-09 04:15:23,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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-01-09 04:15:23,867 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 369 transitions. [2025-01-09 04:15:23,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 04:15:23,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:23,869 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 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, 1, 1, 1, 1] [2025-01-09 04:15:23,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:15:23,869 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:23,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:23,870 INFO L85 PathProgramCache]: Analyzing trace with hash 817329893, now seen corresponding path program 1 times [2025-01-09 04:15:23,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:23,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269947139] [2025-01-09 04:15:23,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:23,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:23,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 04:15:23,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 04:15:23,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:23,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:24,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:24,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269947139] [2025-01-09 04:15:24,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269947139] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:24,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210800128] [2025-01-09 04:15:24,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:24,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:24,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:24,372 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:15:24,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 04:15:24,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 04:15:24,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 04:15:24,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:24,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:24,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 04:15:24,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:24,834 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:24,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:15:25,149 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:25,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210800128] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:15:25,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:15:25,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 28 [2025-01-09 04:15:25,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089625180] [2025-01-09 04:15:25,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:15:25,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 04:15:25,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:25,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 04:15:25,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:15:25,151 INFO L87 Difference]: Start difference. First operand 345 states and 369 transitions. Second operand has 28 states, 28 states have (on average 11.321428571428571) internal successors, (317), 28 states have internal predecessors, (317), 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-01-09 04:15:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:25,573 INFO L93 Difference]: Finished difference Result 351 states and 375 transitions. [2025-01-09 04:15:25,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 04:15:25,573 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 11.321428571428571) internal successors, (317), 28 states have internal predecessors, (317), 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 204 [2025-01-09 04:15:25,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:25,575 INFO L225 Difference]: With dead ends: 351 [2025-01-09 04:15:25,575 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 04:15:25,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 400 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-01-09 04:15:25,576 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 460 mSDsluCounter, 4199 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 4450 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:25,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 4450 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:15:25,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 04:15:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 04:15:25,577 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-01-09 04:15:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 04:15:25,578 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 204 [2025-01-09 04:15:25,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:25,578 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 04:15:25,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.321428571428571) internal successors, (317), 28 states have internal predecessors, (317), 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-01-09 04:15:25,578 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 04:15:25,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 04:15:25,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:15:25,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 04:15:25,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-09 04:15:25,788 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:25,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 04:15:32,758 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:15:32,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:15:32 BoogieIcfgContainer [2025-01-09 04:15:32,783 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:15:32,784 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:15:32,784 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:15:32,784 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:15:32,784 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:15:14" (3/4) ... [2025-01-09 04:15:32,786 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 04:15:32,790 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2025-01-09 04:15:32,800 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 04:15:32,800 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 04:15:32,801 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 04:15:32,802 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:15:32,898 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:15:32,899 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:15:32,899 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:15:32,899 INFO L158 Benchmark]: Toolchain (without parser) took 19237.41ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 103.5MB in the beginning and 837.0MB in the end (delta: -733.5MB). Peak memory consumption was 371.6MB. Max. memory is 16.1GB. [2025-01-09 04:15:32,900 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:15:32,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.09ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 83.6MB in the end (delta: 19.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 04:15:32,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.21ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 81.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:15:32,900 INFO L158 Benchmark]: Boogie Preprocessor took 72.03ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 76.8MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:15:32,900 INFO L158 Benchmark]: RCFGBuilder took 709.77ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 96.6MB in the end (delta: -19.8MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. [2025-01-09 04:15:32,900 INFO L158 Benchmark]: TraceAbstraction took 17906.78ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 96.6MB in the beginning and 849.6MB in the end (delta: -753.0MB). Peak memory consumption was 610.0MB. Max. memory is 16.1GB. [2025-01-09 04:15:32,901 INFO L158 Benchmark]: Witness Printer took 115.40ms. Allocated memory is still 1.2GB. Free memory was 849.6MB in the beginning and 837.0MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:15:32,901 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.13ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.09ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 83.6MB in the end (delta: 19.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.21ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 81.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 72.03ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 76.8MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 709.77ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 96.6MB in the end (delta: -19.8MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17906.78ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 96.6MB in the beginning and 849.6MB in the end (delta: -753.0MB). Peak memory consumption was 610.0MB. Max. memory is 16.1GB. * Witness Printer took 115.40ms. Allocated memory is still 1.2GB. Free memory was 849.6MB in the beginning and 837.0MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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, 259 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 23, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8085 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8085 mSDsluCounter, 26297 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16648 mSDsCounter, 417 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2844 IncrementalHoareTripleChecker+Invalid, 3261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 417 mSolverCounterUnsat, 9649 mSDtfsCounter, 2844 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 943 GetRequests, 826 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6693occurred in iteration=13, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 7379 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2631 NumberOfCodeBlocks, 2631 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2807 ConstructedInterpolants, 0 QuantifiedInterpolants, 6882 SizeOfPredicates, 10 NumberOfNonLiveVariables, 2038 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 28 InterpolantComputations, 22 PerfectInterpolantSequences, 323/468 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: 1255]: Loop Invariant Derived loop 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)) && (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) && (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: 1001]: Loop Invariant Derived loop 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: 638]: Loop Invariant Derived loop 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: 134]: Loop Invariant Derived loop 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: 528]: Loop Invariant Derived loop 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: 288]: Loop Invariant Derived loop 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: 145]: Loop Invariant Derived loop 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))) - InvariantResult [Line: 485]: Loop Invariant Derived loop 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: 879]: Loop Invariant Derived loop 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)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (m_run_st == 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))) || ((((((((((((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))) || (((((((((((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))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (m_run_st == 0)) && (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))) || ((((((((((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: 876]: Location Invariant Derived location invariant: (((((((((((((((((((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)) && (m_run_st == 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) && (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))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (m_run_st == 0)) && (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))) || ((((((((((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))) - InvariantResult [Line: 495]: Loop Invariant Derived loop 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: 178]: Loop Invariant Derived loop 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: 1119]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((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))) || ((((((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))) || ((((((((((((((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))) || (((((((((((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))) RESULT: Ultimate proved your program to be correct! [2025-01-09 04:15:32,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE