./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:33:29,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:33:29,231 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:33:29,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:33:29,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:33:29,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:33:29,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:33:29,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:33:29,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:33:29,270 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:33:29,271 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:33:29,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:33:29,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:33:29,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:33:29,274 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:33:29,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:33:29,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:33:29,274 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:33:29,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:33:29,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:33:29,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:33:29,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:33:29,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:33:29,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:33:29,280 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:33:29,281 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:33:29,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:33:29,281 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:33:29,281 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:33:29,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:33:29,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:33:29,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:33:29,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:33:29,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:33:29,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:33:29,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:33:29,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:33:29,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:33:29,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:33:29,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:33:29,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:33:29,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:33:29,285 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 [2024-11-09 23:33:29,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:33:29,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:33:29,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:33:29,621 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:33:29,622 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:33:29,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2024-11-09 23:33:31,166 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:33:31,379 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:33:31,380 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2024-11-09 23:33:31,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f11a49cc7/3aa526a72efb4a29ab630a7e438a6e8c/FLAGa88d5801e [2024-11-09 23:33:31,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f11a49cc7/3aa526a72efb4a29ab630a7e438a6e8c [2024-11-09 23:33:31,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:33:31,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:33:31,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:33:31,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:33:31,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:33:31,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:33:31" (1/1) ... [2024-11-09 23:33:31,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29ded69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:31, skipping insertion in model container [2024-11-09 23:33:31,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:33:31" (1/1) ... [2024-11-09 23:33:31,463 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:33:31,769 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2024-11-09 23:33:31,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:33:31,794 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:33:31,836 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2024-11-09 23:33:31,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:33:31,863 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:33:31,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:31 WrapperNode [2024-11-09 23:33:31,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:33:31,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:33:31,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:33:31,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:33:31,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:31" (1/1) ... [2024-11-09 23:33:31,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:31" (1/1) ... [2024-11-09 23:33:31,919 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 246 [2024-11-09 23:33:31,920 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:33:31,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:33:31,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:33:31,921 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:33:31,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:31" (1/1) ... [2024-11-09 23:33:31,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:31" (1/1) ... [2024-11-09 23:33:31,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:31" (1/1) ... [2024-11-09 23:33:31,970 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]. [2024-11-09 23:33:31,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:31" (1/1) ... [2024-11-09 23:33:31,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:31" (1/1) ... [2024-11-09 23:33:31,980 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:31" (1/1) ... [2024-11-09 23:33:31,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:31" (1/1) ... [2024-11-09 23:33:31,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:31" (1/1) ... [2024-11-09 23:33:31,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:31" (1/1) ... [2024-11-09 23:33:31,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:33:32,001 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:33:32,001 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:33:32,002 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:33:32,003 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:31" (1/1) ... [2024-11-09 23:33:32,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:33:32,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:33:32,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 23:33:32,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 23:33:32,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:33:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:33:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:33:32,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:33:32,229 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:33:32,232 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:33:32,622 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-09 23:33:32,622 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:33:32,642 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:33:32,643 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:33:32,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:33:32 BoogieIcfgContainer [2024-11-09 23:33:32,643 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:33:32,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:33:32,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:33:32,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:33:32,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:33:31" (1/3) ... [2024-11-09 23:33:32,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71fc69e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:33:32, skipping insertion in model container [2024-11-09 23:33:32,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:31" (2/3) ... [2024-11-09 23:33:32,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71fc69e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:33:32, skipping insertion in model container [2024-11-09 23:33:32,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:33:32" (3/3) ... [2024-11-09 23:33:32,654 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2024-11-09 23:33:32,672 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:33:32,672 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:33:32,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:33:32,746 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;@35e4d191, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:33:32,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:33:32,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 67 states have (on average 1.671641791044776) internal successors, (112), 68 states have internal predecessors, (112), 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) [2024-11-09 23:33:32,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 23:33:32,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:32,763 INFO L215 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] [2024-11-09 23:33:32,764 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:32,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:32,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1683394351, now seen corresponding path program 1 times [2024-11-09 23:33:32,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:32,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536353521] [2024-11-09 23:33:32,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:32,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:33,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:33,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536353521] [2024-11-09 23:33:33,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536353521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:33,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:33,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 23:33:33,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709441393] [2024-11-09 23:33:33,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:33,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:33:33,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:33,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:33:33,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:33:33,102 INFO L87 Difference]: Start difference. First operand has 69 states, 67 states have (on average 1.671641791044776) internal successors, (112), 68 states have internal predecessors, (112), 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) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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) [2024-11-09 23:33:33,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:33,128 INFO L93 Difference]: Finished difference Result 115 states and 183 transitions. [2024-11-09 23:33:33,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:33:33,130 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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) Word has length 27 [2024-11-09 23:33:33,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:33,140 INFO L225 Difference]: With dead ends: 115 [2024-11-09 23:33:33,140 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 23:33:33,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:33:33,148 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:33,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:33,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 23:33:33,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-09 23:33:33,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.6507936507936507) internal successors, (104), 63 states have internal predecessors, (104), 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) [2024-11-09 23:33:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2024-11-09 23:33:33,191 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 27 [2024-11-09 23:33:33,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:33,192 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2024-11-09 23:33:33,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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) [2024-11-09 23:33:33,192 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2024-11-09 23:33:33,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 23:33:33,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:33,195 INFO L215 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] [2024-11-09 23:33:33,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:33:33,196 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:33,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:33,198 INFO L85 PathProgramCache]: Analyzing trace with hash 573516656, now seen corresponding path program 1 times [2024-11-09 23:33:33,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:33,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792443138] [2024-11-09 23:33:33,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:33,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:33,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:33,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:33,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792443138] [2024-11-09 23:33:33,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792443138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:33,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:33,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:33:33,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997087814] [2024-11-09 23:33:33,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:33,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:33:33,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:33,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:33:33,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:33:33,451 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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) [2024-11-09 23:33:33,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:33,547 INFO L93 Difference]: Finished difference Result 150 states and 236 transitions. [2024-11-09 23:33:33,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:33:33,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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) Word has length 27 [2024-11-09 23:33:33,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:33,549 INFO L225 Difference]: With dead ends: 150 [2024-11-09 23:33:33,550 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 23:33:33,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:33:33,551 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 63 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:33,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 377 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:33:33,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 23:33:33,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 64. [2024-11-09 23:33:33,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 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) [2024-11-09 23:33:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2024-11-09 23:33:33,566 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 27 [2024-11-09 23:33:33,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:33,566 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2024-11-09 23:33:33,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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) [2024-11-09 23:33:33,568 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2024-11-09 23:33:33,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 23:33:33,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:33,569 INFO L215 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] [2024-11-09 23:33:33,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:33:33,570 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:33,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:33,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1140966752, now seen corresponding path program 1 times [2024-11-09 23:33:33,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:33,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519057620] [2024-11-09 23:33:33,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:33,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:33,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:33,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519057620] [2024-11-09 23:33:33,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519057620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:33,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:33,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:33:33,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256252754] [2024-11-09 23:33:33,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:33,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:33:33,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:33,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:33:33,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:33:33,695 INFO L87 Difference]: Start difference. First operand 64 states and 87 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) [2024-11-09 23:33:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:33,737 INFO L93 Difference]: Finished difference Result 139 states and 203 transitions. [2024-11-09 23:33:33,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:33:33,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) Word has length 43 [2024-11-09 23:33:33,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:33,739 INFO L225 Difference]: With dead ends: 139 [2024-11-09 23:33:33,739 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 23:33:33,740 INFO L431 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 [2024-11-09 23:33:33,744 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 51 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:33,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 197 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:33,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 23:33:33,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2024-11-09 23:33:33,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.446808510638298) internal successors, (136), 94 states have internal predecessors, (136), 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) [2024-11-09 23:33:33,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 136 transitions. [2024-11-09 23:33:33,756 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 136 transitions. Word has length 43 [2024-11-09 23:33:33,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:33,756 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 136 transitions. [2024-11-09 23:33:33,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) [2024-11-09 23:33:33,757 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 136 transitions. [2024-11-09 23:33:33,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 23:33:33,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:33,758 INFO L215 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] [2024-11-09 23:33:33,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:33:33,759 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:33,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:33,759 INFO L85 PathProgramCache]: Analyzing trace with hash 402231957, now seen corresponding path program 1 times [2024-11-09 23:33:33,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:33,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143409793] [2024-11-09 23:33:33,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:33,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:33,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:33,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:33,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143409793] [2024-11-09 23:33:33,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143409793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:33,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:33,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:33:33,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248794896] [2024-11-09 23:33:33,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:33,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:33:33,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:33,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:33:33,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:33:33,913 INFO L87 Difference]: Start difference. First operand 95 states and 136 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) [2024-11-09 23:33:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:33,940 INFO L93 Difference]: Finished difference Result 223 states and 334 transitions. [2024-11-09 23:33:33,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:33:33,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) Word has length 43 [2024-11-09 23:33:33,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:33,942 INFO L225 Difference]: With dead ends: 223 [2024-11-09 23:33:33,942 INFO L226 Difference]: Without dead ends: 151 [2024-11-09 23:33:33,943 INFO L431 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 [2024-11-09 23:33:33,944 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 47 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:33,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 192 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:33,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-09 23:33:33,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2024-11-09 23:33:33,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.4761904761904763) internal successors, (217), 147 states have internal predecessors, (217), 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) [2024-11-09 23:33:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 217 transitions. [2024-11-09 23:33:33,954 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 217 transitions. Word has length 43 [2024-11-09 23:33:33,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:33,955 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 217 transitions. [2024-11-09 23:33:33,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) [2024-11-09 23:33:33,955 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 217 transitions. [2024-11-09 23:33:33,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 23:33:33,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:33,956 INFO L215 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] [2024-11-09 23:33:33,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:33:33,956 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:33,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:33,957 INFO L85 PathProgramCache]: Analyzing trace with hash 2074465672, now seen corresponding path program 1 times [2024-11-09 23:33:33,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:33,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276079530] [2024-11-09 23:33:33,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:33,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:34,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:34,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:34,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276079530] [2024-11-09 23:33:34,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276079530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:34,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:34,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:33:34,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316790738] [2024-11-09 23:33:34,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:34,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:33:34,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:34,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:33:34,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:33:34,105 INFO L87 Difference]: Start difference. First operand 148 states and 217 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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) [2024-11-09 23:33:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:34,205 INFO L93 Difference]: Finished difference Result 648 states and 993 transitions. [2024-11-09 23:33:34,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:33:34,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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) Word has length 43 [2024-11-09 23:33:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:34,209 INFO L225 Difference]: With dead ends: 648 [2024-11-09 23:33:34,210 INFO L226 Difference]: Without dead ends: 523 [2024-11-09 23:33:34,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:33:34,212 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 378 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:34,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 325 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:33:34,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-11-09 23:33:34,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 270. [2024-11-09 23:33:34,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.4907063197026023) internal successors, (401), 269 states have internal predecessors, (401), 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) [2024-11-09 23:33:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 401 transitions. [2024-11-09 23:33:34,251 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 401 transitions. Word has length 43 [2024-11-09 23:33:34,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:34,252 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 401 transitions. [2024-11-09 23:33:34,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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) [2024-11-09 23:33:34,252 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 401 transitions. [2024-11-09 23:33:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 23:33:34,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:34,254 INFO L215 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] [2024-11-09 23:33:34,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:33:34,254 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:34,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:34,255 INFO L85 PathProgramCache]: Analyzing trace with hash 801966846, now seen corresponding path program 1 times [2024-11-09 23:33:34,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:34,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140388238] [2024-11-09 23:33:34,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:34,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:34,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:34,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140388238] [2024-11-09 23:33:34,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140388238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:34,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:34,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:33:34,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515048824] [2024-11-09 23:33:34,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:34,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:33:34,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:34,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:33:34,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:33:34,613 INFO L87 Difference]: Start difference. First operand 270 states and 401 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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) [2024-11-09 23:33:34,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:34,674 INFO L93 Difference]: Finished difference Result 297 states and 435 transitions. [2024-11-09 23:33:34,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:33:34,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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) Word has length 44 [2024-11-09 23:33:34,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:34,679 INFO L225 Difference]: With dead ends: 297 [2024-11-09 23:33:34,679 INFO L226 Difference]: Without dead ends: 294 [2024-11-09 23:33:34,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:33:34,682 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:34,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 552 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:34,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-09 23:33:34,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-11-09 23:33:34,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 1.4505119453924915) internal successors, (425), 293 states have internal predecessors, (425), 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) [2024-11-09 23:33:34,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 425 transitions. [2024-11-09 23:33:34,704 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 425 transitions. Word has length 44 [2024-11-09 23:33:34,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:34,706 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 425 transitions. [2024-11-09 23:33:34,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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) [2024-11-09 23:33:34,707 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 425 transitions. [2024-11-09 23:33:34,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 23:33:34,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:34,710 INFO L215 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] [2024-11-09 23:33:34,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:33:34,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:34,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:34,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1841474568, now seen corresponding path program 1 times [2024-11-09 23:33:34,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:34,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239950278] [2024-11-09 23:33:34,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:34,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:34,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:34,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:34,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239950278] [2024-11-09 23:33:34,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239950278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:34,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:34,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:33:34,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467315075] [2024-11-09 23:33:34,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:34,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:33:34,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:34,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:33:34,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:33:34,816 INFO L87 Difference]: Start difference. First operand 294 states and 425 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2024-11-09 23:33:34,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:34,844 INFO L93 Difference]: Finished difference Result 689 states and 1008 transitions. [2024-11-09 23:33:34,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:33:34,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) Word has length 45 [2024-11-09 23:33:34,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:34,846 INFO L225 Difference]: With dead ends: 689 [2024-11-09 23:33:34,846 INFO L226 Difference]: Without dead ends: 418 [2024-11-09 23:33:34,848 INFO L431 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 [2024-11-09 23:33:34,853 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 36 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:34,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 156 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:34,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-09 23:33:34,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 415. [2024-11-09 23:33:34,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 1.4492753623188406) internal successors, (600), 414 states have internal predecessors, (600), 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) [2024-11-09 23:33:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 600 transitions. [2024-11-09 23:33:34,867 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 600 transitions. Word has length 45 [2024-11-09 23:33:34,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:34,867 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 600 transitions. [2024-11-09 23:33:34,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2024-11-09 23:33:34,867 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 600 transitions. [2024-11-09 23:33:34,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 23:33:34,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:34,868 INFO L215 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] [2024-11-09 23:33:34,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:33:34,869 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:34,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:34,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1009106095, now seen corresponding path program 1 times [2024-11-09 23:33:34,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:34,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48628554] [2024-11-09 23:33:34,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:34,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:34,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:34,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48628554] [2024-11-09 23:33:34,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48628554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:34,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:34,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:33:34,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256327397] [2024-11-09 23:33:34,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:34,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:33:34,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:34,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:33:34,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:33:34,932 INFO L87 Difference]: Start difference. First operand 415 states and 600 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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) [2024-11-09 23:33:34,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:34,960 INFO L93 Difference]: Finished difference Result 1097 states and 1580 transitions. [2024-11-09 23:33:34,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:33:34,961 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), 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) Word has length 46 [2024-11-09 23:33:34,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:34,964 INFO L225 Difference]: With dead ends: 1097 [2024-11-09 23:33:34,964 INFO L226 Difference]: Without dead ends: 708 [2024-11-09 23:33:34,965 INFO L431 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 [2024-11-09 23:33:34,966 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 43 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:34,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 189 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:34,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2024-11-09 23:33:34,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 705. [2024-11-09 23:33:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 1.4090909090909092) internal successors, (992), 704 states have internal predecessors, (992), 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) [2024-11-09 23:33:34,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 992 transitions. [2024-11-09 23:33:34,987 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 992 transitions. Word has length 46 [2024-11-09 23:33:34,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:34,987 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 992 transitions. [2024-11-09 23:33:34,987 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), 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) [2024-11-09 23:33:34,987 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 992 transitions. [2024-11-09 23:33:34,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 23:33:34,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:34,989 INFO L215 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] [2024-11-09 23:33:34,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:33:34,989 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:34,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:34,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1054503420, now seen corresponding path program 1 times [2024-11-09 23:33:34,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:34,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728696083] [2024-11-09 23:33:34,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:34,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:35,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:35,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728696083] [2024-11-09 23:33:35,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728696083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:35,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:35,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:33:35,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954645085] [2024-11-09 23:33:35,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:35,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:33:35,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:35,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:33:35,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:33:35,118 INFO L87 Difference]: Start difference. First operand 705 states and 992 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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) [2024-11-09 23:33:35,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:35,150 INFO L93 Difference]: Finished difference Result 1387 states and 1960 transitions. [2024-11-09 23:33:35,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:33:35,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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) Word has length 65 [2024-11-09 23:33:35,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:35,157 INFO L225 Difference]: With dead ends: 1387 [2024-11-09 23:33:35,157 INFO L226 Difference]: Without dead ends: 708 [2024-11-09 23:33:35,158 INFO L431 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 [2024-11-09 23:33:35,159 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 40 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:35,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:35,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2024-11-09 23:33:35,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 705. [2024-11-09 23:33:35,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 1.3920454545454546) internal successors, (980), 704 states have internal predecessors, (980), 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) [2024-11-09 23:33:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 980 transitions. [2024-11-09 23:33:35,180 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 980 transitions. Word has length 65 [2024-11-09 23:33:35,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:35,181 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 980 transitions. [2024-11-09 23:33:35,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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) [2024-11-09 23:33:35,182 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 980 transitions. [2024-11-09 23:33:35,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 23:33:35,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:35,183 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:33:35,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:33:35,184 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:35,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:35,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1232022097, now seen corresponding path program 1 times [2024-11-09 23:33:35,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:35,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441197761] [2024-11-09 23:33:35,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:35,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:35,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:35,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441197761] [2024-11-09 23:33:35,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441197761] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:33:35,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649687155] [2024-11-09 23:33:35,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:35,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:33:35,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:33:35,789 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:33:35,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 23:33:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:35,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 23:33:35,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:33:36,425 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:36,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:33:37,044 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:37,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649687155] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:33:37,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:33:37,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 21 [2024-11-09 23:33:37,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143571871] [2024-11-09 23:33:37,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:33:37,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 23:33:37,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:37,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 23:33:37,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2024-11-09 23:33:37,047 INFO L87 Difference]: Start difference. First operand 705 states and 980 transitions. Second operand has 21 states, 21 states have (on average 8.666666666666666) internal successors, (182), 21 states have internal predecessors, (182), 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) [2024-11-09 23:33:42,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:42,941 INFO L93 Difference]: Finished difference Result 6279 states and 8666 transitions. [2024-11-09 23:33:42,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-11-09 23:33:42,941 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.666666666666666) internal successors, (182), 21 states have internal predecessors, (182), 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) Word has length 65 [2024-11-09 23:33:42,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:42,960 INFO L225 Difference]: With dead ends: 6279 [2024-11-09 23:33:42,960 INFO L226 Difference]: Without dead ends: 5600 [2024-11-09 23:33:42,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4419 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2381, Invalid=10051, Unknown=0, NotChecked=0, Total=12432 [2024-11-09 23:33:42,967 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 3553 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3553 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:42,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3553 Valid, 1452 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 23:33:42,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5600 states. [2024-11-09 23:33:43,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5600 to 4757. [2024-11-09 23:33:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4757 states, 4756 states have (on average 1.3782590412111018) internal successors, (6555), 4756 states have internal predecessors, (6555), 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) [2024-11-09 23:33:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4757 states to 4757 states and 6555 transitions. [2024-11-09 23:33:43,119 INFO L78 Accepts]: Start accepts. Automaton has 4757 states and 6555 transitions. Word has length 65 [2024-11-09 23:33:43,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:43,119 INFO L471 AbstractCegarLoop]: Abstraction has 4757 states and 6555 transitions. [2024-11-09 23:33:43,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.666666666666666) internal successors, (182), 21 states have internal predecessors, (182), 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) [2024-11-09 23:33:43,119 INFO L276 IsEmpty]: Start isEmpty. Operand 4757 states and 6555 transitions. [2024-11-09 23:33:43,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 23:33:43,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:43,120 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:33:43,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 23:33:43,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 23:33:43,321 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:43,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:43,322 INFO L85 PathProgramCache]: Analyzing trace with hash 925317421, now seen corresponding path program 1 times [2024-11-09 23:33:43,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:43,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791450914] [2024-11-09 23:33:43,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:43,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:43,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 23:33:43,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:43,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791450914] [2024-11-09 23:33:43,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791450914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:43,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:43,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:33:43,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954816525] [2024-11-09 23:33:43,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:43,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:33:43,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:43,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:33:43,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:33:43,440 INFO L87 Difference]: Start difference. First operand 4757 states and 6555 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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) [2024-11-09 23:33:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:43,655 INFO L93 Difference]: Finished difference Result 11940 states and 16604 transitions. [2024-11-09 23:33:43,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:33:43,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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) Word has length 66 [2024-11-09 23:33:43,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:43,688 INFO L225 Difference]: With dead ends: 11940 [2024-11-09 23:33:43,689 INFO L226 Difference]: Without dead ends: 9499 [2024-11-09 23:33:43,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:33:43,698 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 216 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:43,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 419 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:43,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9499 states. [2024-11-09 23:33:43,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9499 to 7066. [2024-11-09 23:33:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7066 states, 7065 states have (on average 1.3723991507430997) internal successors, (9696), 7065 states have internal predecessors, (9696), 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) [2024-11-09 23:33:43,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7066 states to 7066 states and 9696 transitions. [2024-11-09 23:33:43,998 INFO L78 Accepts]: Start accepts. Automaton has 7066 states and 9696 transitions. Word has length 66 [2024-11-09 23:33:43,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:43,999 INFO L471 AbstractCegarLoop]: Abstraction has 7066 states and 9696 transitions. [2024-11-09 23:33:43,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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) [2024-11-09 23:33:43,999 INFO L276 IsEmpty]: Start isEmpty. Operand 7066 states and 9696 transitions. [2024-11-09 23:33:44,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 23:33:44,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:44,000 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:33:44,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:33:44,000 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:44,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:44,001 INFO L85 PathProgramCache]: Analyzing trace with hash -78294620, now seen corresponding path program 1 times [2024-11-09 23:33:44,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:44,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247448110] [2024-11-09 23:33:44,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:44,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:44,069 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:44,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:44,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247448110] [2024-11-09 23:33:44,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247448110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:44,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:44,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:33:44,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094515986] [2024-11-09 23:33:44,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:44,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:33:44,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:44,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:33:44,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:33:44,071 INFO L87 Difference]: Start difference. First operand 7066 states and 9696 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) [2024-11-09 23:33:44,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:44,307 INFO L93 Difference]: Finished difference Result 15255 states and 20980 transitions. [2024-11-09 23:33:44,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:33:44,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) Word has length 67 [2024-11-09 23:33:44,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:44,344 INFO L225 Difference]: With dead ends: 15255 [2024-11-09 23:33:44,344 INFO L226 Difference]: Without dead ends: 8320 [2024-11-09 23:33:44,354 INFO L431 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 [2024-11-09 23:33:44,355 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 41 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:44,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 165 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:44,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8320 states. [2024-11-09 23:33:44,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8320 to 8293. [2024-11-09 23:33:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8293 states, 8292 states have (on average 1.3560057887120116) internal successors, (11244), 8292 states have internal predecessors, (11244), 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) [2024-11-09 23:33:44,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8293 states to 8293 states and 11244 transitions. [2024-11-09 23:33:44,674 INFO L78 Accepts]: Start accepts. Automaton has 8293 states and 11244 transitions. Word has length 67 [2024-11-09 23:33:44,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:44,675 INFO L471 AbstractCegarLoop]: Abstraction has 8293 states and 11244 transitions. [2024-11-09 23:33:44,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) [2024-11-09 23:33:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 8293 states and 11244 transitions. [2024-11-09 23:33:44,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 23:33:44,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:44,679 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:33:44,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:33:44,680 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:44,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:44,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1006124518, now seen corresponding path program 1 times [2024-11-09 23:33:44,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:44,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446949808] [2024-11-09 23:33:44,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:44,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 23:33:44,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:44,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446949808] [2024-11-09 23:33:44,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446949808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:44,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:44,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:33:44,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419008469] [2024-11-09 23:33:44,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:44,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:33:44,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:44,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:33:44,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:33:44,766 INFO L87 Difference]: Start difference. First operand 8293 states and 11244 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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) [2024-11-09 23:33:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:45,056 INFO L93 Difference]: Finished difference Result 16566 states and 22686 transitions. [2024-11-09 23:33:45,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:33:45,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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) Word has length 67 [2024-11-09 23:33:45,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:45,083 INFO L225 Difference]: With dead ends: 16566 [2024-11-09 23:33:45,084 INFO L226 Difference]: Without dead ends: 13196 [2024-11-09 23:33:45,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:33:45,090 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 217 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:45,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 385 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:45,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13196 states. [2024-11-09 23:33:45,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13196 to 11462. [2024-11-09 23:33:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11462 states, 11461 states have (on average 1.3531105488177297) internal successors, (15508), 11461 states have internal predecessors, (15508), 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) [2024-11-09 23:33:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11462 states to 11462 states and 15508 transitions. [2024-11-09 23:33:45,499 INFO L78 Accepts]: Start accepts. Automaton has 11462 states and 15508 transitions. Word has length 67 [2024-11-09 23:33:45,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:45,500 INFO L471 AbstractCegarLoop]: Abstraction has 11462 states and 15508 transitions. [2024-11-09 23:33:45,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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) [2024-11-09 23:33:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 11462 states and 15508 transitions. [2024-11-09 23:33:45,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 23:33:45,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:45,501 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:33:45,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:33:45,502 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:45,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:45,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1694090514, now seen corresponding path program 1 times [2024-11-09 23:33:45,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:45,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734402779] [2024-11-09 23:33:45,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:45,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:45,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:45,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734402779] [2024-11-09 23:33:45,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734402779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:45,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:45,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:33:45,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739637730] [2024-11-09 23:33:45,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:45,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:33:45,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:45,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:33:45,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:33:45,552 INFO L87 Difference]: Start difference. First operand 11462 states and 15508 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) [2024-11-09 23:33:46,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:46,110 INFO L93 Difference]: Finished difference Result 32396 states and 43552 transitions. [2024-11-09 23:33:46,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:33:46,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) Word has length 67 [2024-11-09 23:33:46,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:46,155 INFO L225 Difference]: With dead ends: 32396 [2024-11-09 23:33:46,155 INFO L226 Difference]: Without dead ends: 21105 [2024-11-09 23:33:46,173 INFO L431 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 [2024-11-09 23:33:46,174 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 36 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:46,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 199 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:46,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21105 states. [2024-11-09 23:33:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21105 to 21004. [2024-11-09 23:33:46,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21004 states, 21003 states have (on average 1.3220492310622292) internal successors, (27767), 21003 states have internal predecessors, (27767), 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) [2024-11-09 23:33:46,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21004 states to 21004 states and 27767 transitions. [2024-11-09 23:33:46,927 INFO L78 Accepts]: Start accepts. Automaton has 21004 states and 27767 transitions. Word has length 67 [2024-11-09 23:33:46,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:46,927 INFO L471 AbstractCegarLoop]: Abstraction has 21004 states and 27767 transitions. [2024-11-09 23:33:46,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) [2024-11-09 23:33:46,928 INFO L276 IsEmpty]: Start isEmpty. Operand 21004 states and 27767 transitions. [2024-11-09 23:33:46,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 23:33:46,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:46,930 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:33:46,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:33:46,930 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:46,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:46,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1593046393, now seen corresponding path program 1 times [2024-11-09 23:33:46,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:46,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801105963] [2024-11-09 23:33:46,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:46,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 23:33:47,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:47,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801105963] [2024-11-09 23:33:47,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801105963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:47,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:47,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:33:47,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209305119] [2024-11-09 23:33:47,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:47,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:33:47,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:47,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:33:47,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:33:47,025 INFO L87 Difference]: Start difference. First operand 21004 states and 27767 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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) [2024-11-09 23:33:47,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:47,690 INFO L93 Difference]: Finished difference Result 36112 states and 48232 transitions. [2024-11-09 23:33:47,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:33:47,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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) Word has length 67 [2024-11-09 23:33:47,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:47,752 INFO L225 Difference]: With dead ends: 36112 [2024-11-09 23:33:47,753 INFO L226 Difference]: Without dead ends: 29952 [2024-11-09 23:33:47,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:33:47,767 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 222 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:47,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 400 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29952 states. [2024-11-09 23:33:48,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29952 to 26782. [2024-11-09 23:33:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26782 states, 26781 states have (on average 1.3204884059594488) internal successors, (35364), 26781 states have internal predecessors, (35364), 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) [2024-11-09 23:33:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26782 states to 26782 states and 35364 transitions. [2024-11-09 23:33:48,702 INFO L78 Accepts]: Start accepts. Automaton has 26782 states and 35364 transitions. Word has length 67 [2024-11-09 23:33:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:48,703 INFO L471 AbstractCegarLoop]: Abstraction has 26782 states and 35364 transitions. [2024-11-09 23:33:48,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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) [2024-11-09 23:33:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 26782 states and 35364 transitions. [2024-11-09 23:33:48,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 23:33:48,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:48,705 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:33:48,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:33:48,706 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:48,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:48,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1575183515, now seen corresponding path program 1 times [2024-11-09 23:33:48,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:48,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330883485] [2024-11-09 23:33:48,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:48,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:49,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:49,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330883485] [2024-11-09 23:33:49,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330883485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:33:49,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185483622] [2024-11-09 23:33:49,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:49,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:33:49,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:33:49,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:33:49,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 23:33:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:49,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 23:33:49,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:33:50,846 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:50,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:33:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:52,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185483622] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:33:52,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:33:52,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 31 [2024-11-09 23:33:52,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329357102] [2024-11-09 23:33:52,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:33:52,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 23:33:52,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:52,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 23:33:52,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=742, Unknown=0, NotChecked=0, Total=930 [2024-11-09 23:33:52,252 INFO L87 Difference]: Start difference. First operand 26782 states and 35364 transitions. Second operand has 31 states, 31 states have (on average 6.032258064516129) internal successors, (187), 31 states have internal predecessors, (187), 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) [2024-11-09 23:33:58,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:58,742 INFO L93 Difference]: Finished difference Result 195868 states and 258933 transitions. [2024-11-09 23:33:58,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-11-09 23:33:58,743 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 6.032258064516129) internal successors, (187), 31 states have internal predecessors, (187), 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) Word has length 69 [2024-11-09 23:33:58,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:59,048 INFO L225 Difference]: With dead ends: 195868 [2024-11-09 23:33:59,048 INFO L226 Difference]: Without dead ends: 169123 [2024-11-09 23:33:59,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4648 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2747, Invalid=10593, Unknown=0, NotChecked=0, Total=13340 [2024-11-09 23:33:59,104 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 2606 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2606 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:59,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2606 Valid, 1421 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 23:33:59,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169123 states. [2024-11-09 23:34:02,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169123 to 94630. [2024-11-09 23:34:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94630 states, 94629 states have (on average 1.3167633600693234) internal successors, (124604), 94629 states have internal predecessors, (124604), 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) [2024-11-09 23:34:03,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94630 states to 94630 states and 124604 transitions. [2024-11-09 23:34:03,052 INFO L78 Accepts]: Start accepts. Automaton has 94630 states and 124604 transitions. Word has length 69 [2024-11-09 23:34:03,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:34:03,053 INFO L471 AbstractCegarLoop]: Abstraction has 94630 states and 124604 transitions. [2024-11-09 23:34:03,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 6.032258064516129) internal successors, (187), 31 states have internal predecessors, (187), 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) [2024-11-09 23:34:03,053 INFO L276 IsEmpty]: Start isEmpty. Operand 94630 states and 124604 transitions. [2024-11-09 23:34:03,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 23:34:03,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:34:03,058 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:34:03,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 23:34:03,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 23:34:03,263 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:34:03,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:34:03,263 INFO L85 PathProgramCache]: Analyzing trace with hash 2031817785, now seen corresponding path program 1 times [2024-11-09 23:34:03,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:34:03,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053633072] [2024-11-09 23:34:03,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:34:03,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:34:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:34:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:34:03,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:34:03,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053633072] [2024-11-09 23:34:03,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053633072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:34:03,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564950173] [2024-11-09 23:34:03,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:34:03,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:34:03,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:34:03,985 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:34:03,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 23:34:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:34:04,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 23:34:04,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:34:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:34:04,601 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:34:05,397 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:34:05,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564950173] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:34:05,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:34:05,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2024-11-09 23:34:05,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141623662] [2024-11-09 23:34:05,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:34:05,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 23:34:05,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:34:05,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 23:34:05,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2024-11-09 23:34:05,403 INFO L87 Difference]: Start difference. First operand 94630 states and 124604 transitions. Second operand has 29 states, 29 states have (on average 5.931034482758621) internal successors, (172), 29 states have internal predecessors, (172), 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) [2024-11-09 23:34:11,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:34:11,462 INFO L93 Difference]: Finished difference Result 301376 states and 397389 transitions. [2024-11-09 23:34:11,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 23:34:11,463 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.931034482758621) internal successors, (172), 29 states have internal predecessors, (172), 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) Word has length 69 [2024-11-09 23:34:11,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:34:12,036 INFO L225 Difference]: With dead ends: 301376 [2024-11-09 23:34:12,036 INFO L226 Difference]: Without dead ends: 248490 [2024-11-09 23:34:12,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=527, Invalid=1825, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 23:34:12,107 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 1134 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:34:12,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 1173 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:34:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248490 states. [2024-11-09 23:34:17,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248490 to 158341. [2024-11-09 23:34:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158341 states, 158340 states have (on average 1.309675382089175) internal successors, (207374), 158340 states have internal predecessors, (207374), 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) [2024-11-09 23:34:18,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158341 states to 158341 states and 207374 transitions. [2024-11-09 23:34:18,357 INFO L78 Accepts]: Start accepts. Automaton has 158341 states and 207374 transitions. Word has length 69 [2024-11-09 23:34:18,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:34:18,357 INFO L471 AbstractCegarLoop]: Abstraction has 158341 states and 207374 transitions. [2024-11-09 23:34:18,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.931034482758621) internal successors, (172), 29 states have internal predecessors, (172), 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) [2024-11-09 23:34:18,357 INFO L276 IsEmpty]: Start isEmpty. Operand 158341 states and 207374 transitions. [2024-11-09 23:34:18,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 23:34:18,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:34:18,361 INFO L215 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] [2024-11-09 23:34:18,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 23:34:18,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:34:18,562 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:34:18,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:34:18,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2074212250, now seen corresponding path program 1 times [2024-11-09 23:34:18,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:34:18,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861719952] [2024-11-09 23:34:18,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:34:18,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:34:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:34:18,651 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:34:18,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:34:18,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861719952] [2024-11-09 23:34:18,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861719952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:34:18,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:34:18,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:34:18,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572896553] [2024-11-09 23:34:18,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:34:18,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:34:18,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:34:18,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:34:18,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:34:18,654 INFO L87 Difference]: Start difference. First operand 158341 states and 207374 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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) [2024-11-09 23:34:21,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:34:21,195 INFO L93 Difference]: Finished difference Result 221974 states and 291106 transitions. [2024-11-09 23:34:21,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:34:21,196 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), 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) Word has length 69 [2024-11-09 23:34:21,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:34:21,306 INFO L225 Difference]: With dead ends: 221974 [2024-11-09 23:34:21,306 INFO L226 Difference]: Without dead ends: 65204 [2024-11-09 23:34:21,381 INFO L431 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 [2024-11-09 23:34:21,382 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 27 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:34:21,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 166 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:34:21,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65204 states. [2024-11-09 23:34:23,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65204 to 65201. [2024-11-09 23:34:23,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65201 states, 65200 states have (on average 1.284723926380368) internal successors, (83764), 65200 states have internal predecessors, (83764), 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) [2024-11-09 23:34:23,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65201 states to 65201 states and 83764 transitions. [2024-11-09 23:34:23,879 INFO L78 Accepts]: Start accepts. Automaton has 65201 states and 83764 transitions. Word has length 69 [2024-11-09 23:34:23,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:34:23,879 INFO L471 AbstractCegarLoop]: Abstraction has 65201 states and 83764 transitions. [2024-11-09 23:34:23,879 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), 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) [2024-11-09 23:34:23,879 INFO L276 IsEmpty]: Start isEmpty. Operand 65201 states and 83764 transitions. [2024-11-09 23:34:23,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 23:34:23,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:34:23,883 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:34:23,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 23:34:23,884 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:34:23,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:34:23,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1583121146, now seen corresponding path program 1 times [2024-11-09 23:34:23,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:34:23,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900334743] [2024-11-09 23:34:23,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:34:23,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:34:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:34:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:34:23,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:34:23,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900334743] [2024-11-09 23:34:23,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900334743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:34:23,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:34:23,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:34:23,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413909074] [2024-11-09 23:34:23,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:34:23,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:34:23,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:34:23,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:34:23,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:34:23,931 INFO L87 Difference]: Start difference. First operand 65201 states and 83764 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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) [2024-11-09 23:34:25,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:34:25,473 INFO L93 Difference]: Finished difference Result 102968 states and 131743 transitions. [2024-11-09 23:34:25,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:34:25,474 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), 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) Word has length 69 [2024-11-09 23:34:25,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:34:25,570 INFO L225 Difference]: With dead ends: 102968 [2024-11-09 23:34:25,570 INFO L226 Difference]: Without dead ends: 59855 [2024-11-09 23:34:25,589 INFO L431 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 [2024-11-09 23:34:25,590 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 37 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:34:25,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 208 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:34:25,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59855 states.