./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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 ccd7de77f49c6b9ff6e2bd62edbddc630c5186aa67a4c3123f05914f38eca6d7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:50:28,815 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:50:28,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:50:28,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:50:28,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:50:28,919 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:50:28,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:50:28,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:50:28,921 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:50:28,922 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:50:28,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:50:28,924 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:50:28,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:50:28,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:50:28,925 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:50:28,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:50:28,925 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:50:28,926 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:50:28,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:50:28,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:50:28,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:50:28,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:50:28,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:50:28,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:50:28,929 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:50:28,929 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:50:28,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:50:28,930 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:50:28,930 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:50:28,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:50:28,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:50:28,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:50:28,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:50:28,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:50:28,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:50:28,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:50:28,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:50:28,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:50:28,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:50:28,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:50:28,934 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:50:28,935 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:50:28,935 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 -> ccd7de77f49c6b9ff6e2bd62edbddc630c5186aa67a4c3123f05914f38eca6d7 [2024-10-14 03:50:29,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:50:29,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:50:29,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:50:29,250 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:50:29,251 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:50:29,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-14 03:50:30,696 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:50:30,967 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:50:30,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-14 03:50:30,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90d843ded/4647a6401bfd4d54ac999401f0bbfd1f/FLAGfb9c362b8 [2024-10-14 03:50:31,007 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90d843ded/4647a6401bfd4d54ac999401f0bbfd1f [2024-10-14 03:50:31,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:50:31,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:50:31,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:50:31,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:50:31,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:50:31,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:50:31" (1/1) ... [2024-10-14 03:50:31,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5046ee96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:50:31, skipping insertion in model container [2024-10-14 03:50:31,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:50:31" (1/1) ... [2024-10-14 03:50:31,073 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:50:31,262 WARN L248 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-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5377,5390] [2024-10-14 03:50:31,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:50:31,306 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:50:31,358 WARN L248 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-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5377,5390] [2024-10-14 03:50:31,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:50:31,411 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:50:31,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:50:31 WrapperNode [2024-10-14 03:50:31,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:50:31,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:50:31,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:50:31,413 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:50:31,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:50:31" (1/1) ... [2024-10-14 03:50:31,438 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:50:31" (1/1) ... [2024-10-14 03:50:31,483 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 452 [2024-10-14 03:50:31,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:50:31,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:50:31,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:50:31,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:50:31,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:50:31" (1/1) ... [2024-10-14 03:50:31,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:50:31" (1/1) ... [2024-10-14 03:50:31,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:50:31" (1/1) ... [2024-10-14 03:50:31,534 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-10-14 03:50:31,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:50:31" (1/1) ... [2024-10-14 03:50:31,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:50:31" (1/1) ... [2024-10-14 03:50:31,542 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:50:31" (1/1) ... [2024-10-14 03:50:31,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:50:31" (1/1) ... [2024-10-14 03:50:31,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:50:31" (1/1) ... [2024-10-14 03:50:31,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:50:31" (1/1) ... [2024-10-14 03:50:31,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:50:31,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:50:31,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:50:31,565 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:50:31,566 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:50:31" (1/1) ... [2024-10-14 03:50:31,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:50:31,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:50:31,596 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-10-14 03:50:31,598 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-10-14 03:50:31,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:50:31,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:50:31,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:50:31,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:50:31,742 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:50:31,744 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:50:32,267 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-10-14 03:50:32,267 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:50:32,311 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:50:32,312 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 03:50:32,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:50:32 BoogieIcfgContainer [2024-10-14 03:50:32,313 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:50:32,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:50:32,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:50:32,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:50:32,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:50:31" (1/3) ... [2024-10-14 03:50:32,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b27e622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:50:32, skipping insertion in model container [2024-10-14 03:50:32,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:50:31" (2/3) ... [2024-10-14 03:50:32,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b27e622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:50:32, skipping insertion in model container [2024-10-14 03:50:32,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:50:32" (3/3) ... [2024-10-14 03:50:32,320 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-14 03:50:32,332 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:50:32,332 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:50:32,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:50:32,404 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;@cd98a3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:50:32,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:50:32,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 103 states have (on average 1.6990291262135921) internal successors, (175), 104 states have internal predecessors, (175), 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-10-14 03:50:32,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 03:50:32,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:32,423 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, 1] [2024-10-14 03:50:32,424 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:50:32,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:32,428 INFO L85 PathProgramCache]: Analyzing trace with hash -813563245, now seen corresponding path program 1 times [2024-10-14 03:50:32,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:32,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24701837] [2024-10-14 03:50:32,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:32,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:50:32,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:32,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24701837] [2024-10-14 03:50:32,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24701837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:50:32,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:50:32,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:50:32,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827249445] [2024-10-14 03:50:32,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:50:32,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:50:32,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:32,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:50:32,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:50:32,885 INFO L87 Difference]: Start difference. First operand has 105 states, 103 states have (on average 1.6990291262135921) internal successors, (175), 104 states have internal predecessors, (175), 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 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-10-14 03:50:32,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:32,946 INFO L93 Difference]: Finished difference Result 247 states and 397 transitions. [2024-10-14 03:50:32,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:50:32,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 47 [2024-10-14 03:50:32,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:32,960 INFO L225 Difference]: With dead ends: 247 [2024-10-14 03:50:32,961 INFO L226 Difference]: Without dead ends: 164 [2024-10-14 03:50:32,964 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-10-14 03:50:32,971 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 122 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:50:32,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 360 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:50:32,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-14 03:50:33,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2024-10-14 03:50:33,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.5031055900621118) internal successors, (242), 161 states have internal predecessors, (242), 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-10-14 03:50:33,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 242 transitions. [2024-10-14 03:50:33,016 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 242 transitions. Word has length 47 [2024-10-14 03:50:33,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:50:33,016 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 242 transitions. [2024-10-14 03:50:33,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-10-14 03:50:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 242 transitions. [2024-10-14 03:50:33,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 03:50:33,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:33,019 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, 1, 1] [2024-10-14 03:50:33,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:50:33,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:50:33,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:33,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2090397033, now seen corresponding path program 1 times [2024-10-14 03:50:33,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:33,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599731300] [2024-10-14 03:50:33,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:33,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:50:33,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:33,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599731300] [2024-10-14 03:50:33,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599731300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:50:33,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:50:33,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:50:33,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301289414] [2024-10-14 03:50:33,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:50:33,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:50:33,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:33,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:50:33,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:50:33,179 INFO L87 Difference]: Start difference. First operand 162 states and 242 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-10-14 03:50:33,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:33,227 INFO L93 Difference]: Finished difference Result 402 states and 622 transitions. [2024-10-14 03:50:33,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:50:33,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2024-10-14 03:50:33,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:33,230 INFO L225 Difference]: With dead ends: 402 [2024-10-14 03:50:33,230 INFO L226 Difference]: Without dead ends: 266 [2024-10-14 03:50:33,231 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-10-14 03:50:33,234 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 101 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:50:33,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 311 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:50:33,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-14 03:50:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2024-10-14 03:50:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 1.532319391634981) internal successors, (403), 263 states have internal predecessors, (403), 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-10-14 03:50:33,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 403 transitions. [2024-10-14 03:50:33,261 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 403 transitions. Word has length 48 [2024-10-14 03:50:33,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:50:33,261 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 403 transitions. [2024-10-14 03:50:33,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-10-14 03:50:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 403 transitions. [2024-10-14 03:50:33,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 03:50:33,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:33,267 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, 1, 1, 1] [2024-10-14 03:50:33,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:50:33,268 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:50:33,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:33,269 INFO L85 PathProgramCache]: Analyzing trace with hash -2059387344, now seen corresponding path program 1 times [2024-10-14 03:50:33,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:33,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965427530] [2024-10-14 03:50:33,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:33,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:33,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:50:33,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:33,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965427530] [2024-10-14 03:50:33,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965427530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:50:33,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:50:33,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:50:33,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785368874] [2024-10-14 03:50:33,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:50:33,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:50:33,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:33,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:50:33,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:50:33,392 INFO L87 Difference]: Start difference. First operand 264 states and 403 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-10-14 03:50:33,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:33,420 INFO L93 Difference]: Finished difference Result 676 states and 1053 transitions. [2024-10-14 03:50:33,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:50:33,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 49 [2024-10-14 03:50:33,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:33,423 INFO L225 Difference]: With dead ends: 676 [2024-10-14 03:50:33,425 INFO L226 Difference]: Without dead ends: 438 [2024-10-14 03:50:33,428 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-10-14 03:50:33,429 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 96 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:50:33,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 296 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:50:33,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-14 03:50:33,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 436. [2024-10-14 03:50:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 1.542528735632184) internal successors, (671), 435 states have internal predecessors, (671), 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-10-14 03:50:33,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 671 transitions. [2024-10-14 03:50:33,457 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 671 transitions. Word has length 49 [2024-10-14 03:50:33,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:50:33,460 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 671 transitions. [2024-10-14 03:50:33,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-10-14 03:50:33,461 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 671 transitions. [2024-10-14 03:50:33,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 03:50:33,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:33,462 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, 1, 1, 1, 1] [2024-10-14 03:50:33,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:50:33,462 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:50:33,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:33,463 INFO L85 PathProgramCache]: Analyzing trace with hash 343137598, now seen corresponding path program 1 times [2024-10-14 03:50:33,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:33,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546469908] [2024-10-14 03:50:33,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:33,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:33,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:50:33,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:33,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546469908] [2024-10-14 03:50:33,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546469908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:50:33,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:50:33,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:50:33,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756362046] [2024-10-14 03:50:33,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:50:33,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:50:33,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:33,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:50:33,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:50:33,646 INFO L87 Difference]: Start difference. First operand 436 states and 671 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-10-14 03:50:33,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:33,791 INFO L93 Difference]: Finished difference Result 2486 states and 3896 transitions. [2024-10-14 03:50:33,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:50:33,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 50 [2024-10-14 03:50:33,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:33,802 INFO L225 Difference]: With dead ends: 2486 [2024-10-14 03:50:33,802 INFO L226 Difference]: Without dead ends: 2076 [2024-10-14 03:50:33,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:50:33,809 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 953 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:50:33,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 1084 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:50:33,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2024-10-14 03:50:33,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 844. [2024-10-14 03:50:33,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 843 states have (on average 1.5409252669039146) internal successors, (1299), 843 states have internal predecessors, (1299), 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-10-14 03:50:33,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1299 transitions. [2024-10-14 03:50:33,883 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1299 transitions. Word has length 50 [2024-10-14 03:50:33,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:50:33,884 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1299 transitions. [2024-10-14 03:50:33,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-10-14 03:50:33,884 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1299 transitions. [2024-10-14 03:50:33,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 03:50:33,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:33,889 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, 1, 1, 1, 1, 1] [2024-10-14 03:50:33,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:50:33,890 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:50:33,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:33,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2027874669, now seen corresponding path program 1 times [2024-10-14 03:50:33,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:33,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335151391] [2024-10-14 03:50:33,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:33,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:50:34,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:34,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335151391] [2024-10-14 03:50:34,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335151391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:50:34,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:50:34,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:50:34,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122469502] [2024-10-14 03:50:34,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:50:34,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:50:34,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:34,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:50:34,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:50:34,124 INFO L87 Difference]: Start difference. First operand 844 states and 1299 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-10-14 03:50:34,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:34,242 INFO L93 Difference]: Finished difference Result 3708 states and 5719 transitions. [2024-10-14 03:50:34,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:50:34,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 51 [2024-10-14 03:50:34,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:34,254 INFO L225 Difference]: With dead ends: 3708 [2024-10-14 03:50:34,254 INFO L226 Difference]: Without dead ends: 2890 [2024-10-14 03:50:34,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:50:34,258 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 435 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:50:34,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 849 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:50:34,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2024-10-14 03:50:34,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2884. [2024-10-14 03:50:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2884 states, 2883 states have (on average 1.5355532431494971) internal successors, (4427), 2883 states have internal predecessors, (4427), 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-10-14 03:50:34,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 4427 transitions. [2024-10-14 03:50:34,322 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 4427 transitions. Word has length 51 [2024-10-14 03:50:34,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:50:34,323 INFO L471 AbstractCegarLoop]: Abstraction has 2884 states and 4427 transitions. [2024-10-14 03:50:34,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-10-14 03:50:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 4427 transitions. [2024-10-14 03:50:34,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 03:50:34,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:34,324 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:50:34,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:50:34,325 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:50:34,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:34,325 INFO L85 PathProgramCache]: Analyzing trace with hash 994594015, now seen corresponding path program 1 times [2024-10-14 03:50:34,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:34,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35144561] [2024-10-14 03:50:34,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:34,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:34,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:50:34,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:34,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35144561] [2024-10-14 03:50:34,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35144561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:50:34,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:50:34,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:50:34,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909663099] [2024-10-14 03:50:34,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:50:34,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:50:34,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:34,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:50:34,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:50:34,398 INFO L87 Difference]: Start difference. First operand 2884 states and 4427 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-10-14 03:50:34,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:34,458 INFO L93 Difference]: Finished difference Result 7768 states and 11885 transitions. [2024-10-14 03:50:34,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:50:34,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 53 [2024-10-14 03:50:34,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:34,477 INFO L225 Difference]: With dead ends: 7768 [2024-10-14 03:50:34,478 INFO L226 Difference]: Without dead ends: 4910 [2024-10-14 03:50:34,482 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-10-14 03:50:34,483 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 107 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:50:34,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 359 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:50:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4910 states. [2024-10-14 03:50:34,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4910 to 4908. [2024-10-14 03:50:34,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4908 states, 4907 states have (on average 1.5119217444467088) internal successors, (7419), 4907 states have internal predecessors, (7419), 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-10-14 03:50:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4908 states to 4908 states and 7419 transitions. [2024-10-14 03:50:34,590 INFO L78 Accepts]: Start accepts. Automaton has 4908 states and 7419 transitions. Word has length 53 [2024-10-14 03:50:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:50:34,591 INFO L471 AbstractCegarLoop]: Abstraction has 4908 states and 7419 transitions. [2024-10-14 03:50:34,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-10-14 03:50:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 4908 states and 7419 transitions. [2024-10-14 03:50:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 03:50:34,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:34,593 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:50:34,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:50:34,593 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:50:34,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:34,594 INFO L85 PathProgramCache]: Analyzing trace with hash 200165270, now seen corresponding path program 1 times [2024-10-14 03:50:34,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:34,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805898308] [2024-10-14 03:50:34,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:34,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:34,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:50:34,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:34,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805898308] [2024-10-14 03:50:34,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805898308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:50:34,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:50:34,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:50:34,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996495438] [2024-10-14 03:50:34,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:50:34,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:50:34,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:34,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:50:34,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:50:34,733 INFO L87 Difference]: Start difference. First operand 4908 states and 7419 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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-10-14 03:50:34,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:34,953 INFO L93 Difference]: Finished difference Result 14672 states and 22205 transitions. [2024-10-14 03:50:34,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:50:34,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2024-10-14 03:50:34,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:34,988 INFO L225 Difference]: With dead ends: 14672 [2024-10-14 03:50:34,988 INFO L226 Difference]: Without dead ends: 9790 [2024-10-14 03:50:34,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:50:34,999 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 631 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:50:34,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 175 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:50:35,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9790 states. [2024-10-14 03:50:35,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9790 to 9788. [2024-10-14 03:50:35,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9788 states, 9787 states have (on average 1.503525084295494) internal successors, (14715), 9787 states have internal predecessors, (14715), 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-10-14 03:50:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9788 states to 9788 states and 14715 transitions. [2024-10-14 03:50:35,232 INFO L78 Accepts]: Start accepts. Automaton has 9788 states and 14715 transitions. Word has length 53 [2024-10-14 03:50:35,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:50:35,234 INFO L471 AbstractCegarLoop]: Abstraction has 9788 states and 14715 transitions. [2024-10-14 03:50:35,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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-10-14 03:50:35,234 INFO L276 IsEmpty]: Start isEmpty. Operand 9788 states and 14715 transitions. [2024-10-14 03:50:35,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 03:50:35,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:35,235 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:50:35,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:50:35,236 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:50:35,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:35,236 INFO L85 PathProgramCache]: Analyzing trace with hash -614246725, now seen corresponding path program 1 times [2024-10-14 03:50:35,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:35,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232430869] [2024-10-14 03:50:35,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:35,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:50:35,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:35,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232430869] [2024-10-14 03:50:35,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232430869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:50:35,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:50:35,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:50:35,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135843295] [2024-10-14 03:50:35,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:50:35,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:50:35,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:35,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:50:35,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:50:35,561 INFO L87 Difference]: Start difference. First operand 9788 states and 14715 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-10-14 03:50:35,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:35,622 INFO L93 Difference]: Finished difference Result 10302 states and 15484 transitions. [2024-10-14 03:50:35,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:50:35,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2024-10-14 03:50:35,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:35,654 INFO L225 Difference]: With dead ends: 10302 [2024-10-14 03:50:35,654 INFO L226 Difference]: Without dead ends: 10300 [2024-10-14 03:50:35,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-14 03:50:35,660 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:50:35,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 569 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:50:35,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10300 states. [2024-10-14 03:50:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10300 to 10300. [2024-10-14 03:50:35,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10300 states, 10299 states have (on average 1.4784930575784057) internal successors, (15227), 10299 states have internal predecessors, (15227), 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-10-14 03:50:35,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10300 states to 10300 states and 15227 transitions. [2024-10-14 03:50:35,935 INFO L78 Accepts]: Start accepts. Automaton has 10300 states and 15227 transitions. Word has length 53 [2024-10-14 03:50:35,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:50:35,936 INFO L471 AbstractCegarLoop]: Abstraction has 10300 states and 15227 transitions. [2024-10-14 03:50:35,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-10-14 03:50:35,936 INFO L276 IsEmpty]: Start isEmpty. Operand 10300 states and 15227 transitions. [2024-10-14 03:50:35,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 03:50:35,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:35,938 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:50:35,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:50:35,938 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:50:35,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:35,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1851206240, now seen corresponding path program 1 times [2024-10-14 03:50:35,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:35,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623565424] [2024-10-14 03:50:35,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:35,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:36,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:50:36,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:36,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623565424] [2024-10-14 03:50:36,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623565424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:50:36,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:50:36,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:50:36,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268344120] [2024-10-14 03:50:36,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:50:36,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:50:36,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:36,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:50:36,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:50:36,011 INFO L87 Difference]: Start difference. First operand 10300 states and 15227 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-10-14 03:50:36,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:36,135 INFO L93 Difference]: Finished difference Result 25042 states and 37003 transitions. [2024-10-14 03:50:36,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:50:36,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 54 [2024-10-14 03:50:36,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:36,166 INFO L225 Difference]: With dead ends: 25042 [2024-10-14 03:50:36,167 INFO L226 Difference]: Without dead ends: 14768 [2024-10-14 03:50:36,183 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-10-14 03:50:36,184 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 85 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:50:36,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 261 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:50:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14768 states. [2024-10-14 03:50:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14768 to 14654. [2024-10-14 03:50:36,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14654 states, 14653 states have (on average 1.464887736299734) internal successors, (21465), 14653 states have internal predecessors, (21465), 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-10-14 03:50:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14654 states to 14654 states and 21465 transitions. [2024-10-14 03:50:36,459 INFO L78 Accepts]: Start accepts. Automaton has 14654 states and 21465 transitions. Word has length 54 [2024-10-14 03:50:36,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:50:36,460 INFO L471 AbstractCegarLoop]: Abstraction has 14654 states and 21465 transitions. [2024-10-14 03:50:36,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-10-14 03:50:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 14654 states and 21465 transitions. [2024-10-14 03:50:36,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 03:50:36,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:36,465 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:50:36,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:50:36,466 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:50:36,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:36,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1774240818, now seen corresponding path program 1 times [2024-10-14 03:50:36,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:36,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154412445] [2024-10-14 03:50:36,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:36,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:36,537 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:50:36,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:36,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154412445] [2024-10-14 03:50:36,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154412445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:50:36,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:50:36,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:50:36,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004333113] [2024-10-14 03:50:36,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:50:36,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:50:36,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:36,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:50:36,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:50:36,539 INFO L87 Difference]: Start difference. First operand 14654 states and 21465 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-10-14 03:50:36,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:36,749 INFO L93 Difference]: Finished difference Result 28164 states and 41181 transitions. [2024-10-14 03:50:36,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:50:36,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2024-10-14 03:50:36,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:36,815 INFO L225 Difference]: With dead ends: 28164 [2024-10-14 03:50:36,816 INFO L226 Difference]: Without dead ends: 20098 [2024-10-14 03:50:36,822 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-10-14 03:50:36,823 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 86 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 310 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-10-14 03:50:36,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 310 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:50:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20098 states. [2024-10-14 03:50:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20098 to 18848. [2024-10-14 03:50:37,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18848 states, 18847 states have (on average 1.446118745688969) internal successors, (27255), 18847 states have internal predecessors, (27255), 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-10-14 03:50:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18848 states to 18848 states and 27255 transitions. [2024-10-14 03:50:37,207 INFO L78 Accepts]: Start accepts. Automaton has 18848 states and 27255 transitions. Word has length 76 [2024-10-14 03:50:37,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:50:37,208 INFO L471 AbstractCegarLoop]: Abstraction has 18848 states and 27255 transitions. [2024-10-14 03:50:37,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-10-14 03:50:37,208 INFO L276 IsEmpty]: Start isEmpty. Operand 18848 states and 27255 transitions. [2024-10-14 03:50:37,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 03:50:37,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:37,219 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:50:37,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:50:37,219 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:50:37,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:37,221 INFO L85 PathProgramCache]: Analyzing trace with hash 644043701, now seen corresponding path program 1 times [2024-10-14 03:50:37,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:37,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101895777] [2024-10-14 03:50:37,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:37,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:50:37,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:37,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101895777] [2024-10-14 03:50:37,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101895777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:50:37,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:50:37,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:50:37,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248055038] [2024-10-14 03:50:37,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:50:37,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:50:37,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:37,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:50:37,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:50:37,298 INFO L87 Difference]: Start difference. First operand 18848 states and 27255 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-10-14 03:50:37,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:37,535 INFO L93 Difference]: Finished difference Result 29471 states and 42418 transitions. [2024-10-14 03:50:37,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:50:37,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2024-10-14 03:50:37,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:37,580 INFO L225 Difference]: With dead ends: 29471 [2024-10-14 03:50:37,581 INFO L226 Difference]: Without dead ends: 19980 [2024-10-14 03:50:37,597 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-10-14 03:50:37,597 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 87 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:50:37,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 329 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:50:37,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19980 states. [2024-10-14 03:50:37,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19980 to 19255. [2024-10-14 03:50:37,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19255 states, 19254 states have (on average 1.4222499220941103) internal successors, (27384), 19254 states have internal predecessors, (27384), 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-10-14 03:50:37,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19255 states to 19255 states and 27384 transitions. [2024-10-14 03:50:37,986 INFO L78 Accepts]: Start accepts. Automaton has 19255 states and 27384 transitions. Word has length 76 [2024-10-14 03:50:37,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:50:37,987 INFO L471 AbstractCegarLoop]: Abstraction has 19255 states and 27384 transitions. [2024-10-14 03:50:37,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-10-14 03:50:37,987 INFO L276 IsEmpty]: Start isEmpty. Operand 19255 states and 27384 transitions. [2024-10-14 03:50:37,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 03:50:37,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:37,993 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:50:37,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:50:37,994 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:50:37,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:37,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1569217297, now seen corresponding path program 1 times [2024-10-14 03:50:37,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:37,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635155484] [2024-10-14 03:50:37,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:37,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:38,126 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 03:50:38,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:38,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635155484] [2024-10-14 03:50:38,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635155484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:50:38,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:50:38,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:50:38,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257444840] [2024-10-14 03:50:38,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:50:38,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:50:38,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:38,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:50:38,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:50:38,129 INFO L87 Difference]: Start difference. First operand 19255 states and 27384 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-10-14 03:50:38,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:38,461 INFO L93 Difference]: Finished difference Result 42705 states and 61533 transitions. [2024-10-14 03:50:38,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:50:38,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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 76 [2024-10-14 03:50:38,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:38,537 INFO L225 Difference]: With dead ends: 42705 [2024-10-14 03:50:38,538 INFO L226 Difference]: Without dead ends: 34418 [2024-10-14 03:50:38,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:50:38,564 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 702 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:50:38,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 979 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:50:38,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34418 states. [2024-10-14 03:50:38,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34418 to 26262. [2024-10-14 03:50:38,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26262 states, 26261 states have (on average 1.4234416054224897) internal successors, (37381), 26261 states have internal predecessors, (37381), 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-10-14 03:50:39,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26262 states to 26262 states and 37381 transitions. [2024-10-14 03:50:39,051 INFO L78 Accepts]: Start accepts. Automaton has 26262 states and 37381 transitions. Word has length 76 [2024-10-14 03:50:39,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:50:39,051 INFO L471 AbstractCegarLoop]: Abstraction has 26262 states and 37381 transitions. [2024-10-14 03:50:39,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-10-14 03:50:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 26262 states and 37381 transitions. [2024-10-14 03:50:39,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 03:50:39,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:39,059 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:50:39,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:50:39,060 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:50:39,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:39,060 INFO L85 PathProgramCache]: Analyzing trace with hash 501121061, now seen corresponding path program 1 times [2024-10-14 03:50:39,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:39,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106941021] [2024-10-14 03:50:39,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:39,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 03:50:39,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:39,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106941021] [2024-10-14 03:50:39,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106941021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:50:39,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:50:39,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:50:39,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160200253] [2024-10-14 03:50:39,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:50:39,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:50:39,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:39,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:50:39,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:50:39,359 INFO L87 Difference]: Start difference. First operand 26262 states and 37381 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-10-14 03:50:39,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:39,579 INFO L93 Difference]: Finished difference Result 46157 states and 66434 transitions. [2024-10-14 03:50:39,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:50:39,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 76 [2024-10-14 03:50:39,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:39,638 INFO L225 Difference]: With dead ends: 46157 [2024-10-14 03:50:39,639 INFO L226 Difference]: Without dead ends: 40208 [2024-10-14 03:50:39,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:50:39,662 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 742 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:50:39,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 880 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:50:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40208 states. [2024-10-14 03:50:40,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40208 to 32070. [2024-10-14 03:50:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32070 states, 32069 states have (on average 1.4250834138888022) internal successors, (45701), 32069 states have internal predecessors, (45701), 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-10-14 03:50:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32070 states to 32070 states and 45701 transitions. [2024-10-14 03:50:40,220 INFO L78 Accepts]: Start accepts. Automaton has 32070 states and 45701 transitions. Word has length 76 [2024-10-14 03:50:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:50:40,221 INFO L471 AbstractCegarLoop]: Abstraction has 32070 states and 45701 transitions. [2024-10-14 03:50:40,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-10-14 03:50:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 32070 states and 45701 transitions. [2024-10-14 03:50:40,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 03:50:40,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:40,230 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:50:40,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:50:40,230 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:50:40,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:40,231 INFO L85 PathProgramCache]: Analyzing trace with hash 256605818, now seen corresponding path program 1 times [2024-10-14 03:50:40,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:40,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708018206] [2024-10-14 03:50:40,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:40,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:40,382 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 03:50:40,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:40,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708018206] [2024-10-14 03:50:40,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708018206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:50:40,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:50:40,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:50:40,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043932965] [2024-10-14 03:50:40,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:50:40,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:50:40,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:40,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:50:40,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:50:40,384 INFO L87 Difference]: Start difference. First operand 32070 states and 45701 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-10-14 03:50:40,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:40,776 INFO L93 Difference]: Finished difference Result 48034 states and 69036 transitions. [2024-10-14 03:50:40,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:50:40,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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 76 [2024-10-14 03:50:40,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:40,842 INFO L225 Difference]: With dead ends: 48034 [2024-10-14 03:50:40,843 INFO L226 Difference]: Without dead ends: 44088 [2024-10-14 03:50:40,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:50:40,860 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 716 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:50:40,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 900 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:50:40,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44088 states. [2024-10-14 03:50:41,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44088 to 35950. [2024-10-14 03:50:41,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35950 states, 35949 states have (on average 1.4261592812039279) internal successors, (51269), 35949 states have internal predecessors, (51269), 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-10-14 03:50:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35950 states to 35950 states and 51269 transitions. [2024-10-14 03:50:41,454 INFO L78 Accepts]: Start accepts. Automaton has 35950 states and 51269 transitions. Word has length 76 [2024-10-14 03:50:41,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:50:41,454 INFO L471 AbstractCegarLoop]: Abstraction has 35950 states and 51269 transitions. [2024-10-14 03:50:41,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-10-14 03:50:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 35950 states and 51269 transitions. [2024-10-14 03:50:41,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 03:50:41,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:41,462 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:50:41,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:50:41,463 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:50:41,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:41,463 INFO L85 PathProgramCache]: Analyzing trace with hash 623948307, now seen corresponding path program 1 times [2024-10-14 03:50:41,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:41,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673142672] [2024-10-14 03:50:41,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:41,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:50:41,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:41,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673142672] [2024-10-14 03:50:41,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673142672] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:50:41,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997661616] [2024-10-14 03:50:41,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:41,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:50:41,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:50:41,984 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-10-14 03:50:41,985 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-10-14 03:50:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:42,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-14 03:50:42,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:50:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:50:42,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:50:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:50:43,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997661616] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:50:43,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:50:43,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 25 [2024-10-14 03:50:43,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285603058] [2024-10-14 03:50:43,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:50:43,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 03:50:43,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:43,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 03:50:43,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:50:43,518 INFO L87 Difference]: Start difference. First operand 35950 states and 51269 transitions. Second operand has 25 states, 25 states have (on average 8.92) internal successors, (223), 25 states have internal predecessors, (223), 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-10-14 03:50:54,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:50:54,394 INFO L93 Difference]: Finished difference Result 291114 states and 411251 transitions. [2024-10-14 03:50:54,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2024-10-14 03:50:54,395 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.92) internal successors, (223), 25 states have internal predecessors, (223), 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 77 [2024-10-14 03:50:54,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:50:54,747 INFO L225 Difference]: With dead ends: 291114 [2024-10-14 03:50:54,747 INFO L226 Difference]: Without dead ends: 253296 [2024-10-14 03:50:54,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14746 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=5366, Invalid=29416, Unknown=0, NotChecked=0, Total=34782 [2024-10-14 03:50:54,837 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 11923 mSDsluCounter, 2710 mSDsCounter, 0 mSdLazyCounter, 3205 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11923 SdHoareTripleChecker+Valid, 2923 SdHoareTripleChecker+Invalid, 3411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 3205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-14 03:50:54,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11923 Valid, 2923 Invalid, 3411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 3205 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-14 03:50:55,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253296 states. [2024-10-14 03:50:57,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253296 to 200844. [2024-10-14 03:50:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200844 states, 200843 states have (on average 1.3987393137923652) internal successors, (280927), 200843 states have internal predecessors, (280927), 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-10-14 03:50:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200844 states to 200844 states and 280927 transitions. [2024-10-14 03:50:58,932 INFO L78 Accepts]: Start accepts. Automaton has 200844 states and 280927 transitions. Word has length 77 [2024-10-14 03:50:58,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:50:58,932 INFO L471 AbstractCegarLoop]: Abstraction has 200844 states and 280927 transitions. [2024-10-14 03:50:58,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.92) internal successors, (223), 25 states have internal predecessors, (223), 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-10-14 03:50:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 200844 states and 280927 transitions. [2024-10-14 03:50:58,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 03:50:58,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:50:58,938 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:50:58,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:50:59,139 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,SelfDestructingSolverStorable14 [2024-10-14 03:50:59,140 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:50:59,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:50:59,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1272026816, now seen corresponding path program 1 times [2024-10-14 03:50:59,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:50:59,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982378814] [2024-10-14 03:50:59,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:50:59,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:50:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:50:59,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:50:59,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:50:59,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982378814] [2024-10-14 03:50:59,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982378814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:50:59,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:50:59,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:50:59,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181194359] [2024-10-14 03:50:59,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:50:59,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:50:59,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:50:59,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:50:59,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:50:59,211 INFO L87 Difference]: Start difference. First operand 200844 states and 280927 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-10-14 03:51:01,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:51:01,028 INFO L93 Difference]: Finished difference Result 567495 states and 791346 transitions. [2024-10-14 03:51:01,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:51:01,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2024-10-14 03:51:01,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:51:02,090 INFO L225 Difference]: With dead ends: 567495 [2024-10-14 03:51:02,090 INFO L226 Difference]: Without dead ends: 376085 [2024-10-14 03:51:02,228 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-10-14 03:51:02,229 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 81 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 293 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-10-14 03:51:02,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 293 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:51:02,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376085 states. [2024-10-14 03:51:06,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376085 to 375896. [2024-10-14 03:51:07,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375896 states, 375895 states have (on average 1.380066241902659) internal successors, (518760), 375895 states have internal predecessors, (518760), 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-10-14 03:51:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375896 states to 375896 states and 518760 transitions. [2024-10-14 03:51:08,016 INFO L78 Accepts]: Start accepts. Automaton has 375896 states and 518760 transitions. Word has length 78 [2024-10-14 03:51:08,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:51:08,017 INFO L471 AbstractCegarLoop]: Abstraction has 375896 states and 518760 transitions. [2024-10-14 03:51:08,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-10-14 03:51:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 375896 states and 518760 transitions. [2024-10-14 03:51:08,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:51:08,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:51:08,025 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:51:08,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:51:08,025 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:51:08,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:51:08,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2114294557, now seen corresponding path program 1 times [2024-10-14 03:51:08,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:51:08,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221616620] [2024-10-14 03:51:08,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:51:08,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:51:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:51:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:51:08,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:51:08,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221616620] [2024-10-14 03:51:08,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221616620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:51:08,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:51:08,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:51:08,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590769067] [2024-10-14 03:51:08,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:51:08,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:51:08,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:51:08,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:51:08,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:51:08,985 INFO L87 Difference]: Start difference. First operand 375896 states and 518760 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-10-14 03:51:11,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:51:11,726 INFO L93 Difference]: Finished difference Result 664803 states and 925030 transitions. [2024-10-14 03:51:11,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:51:11,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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 79 [2024-10-14 03:51:11,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:51:12,780 INFO L225 Difference]: With dead ends: 664803 [2024-10-14 03:51:12,781 INFO L226 Difference]: Without dead ends: 572881 [2024-10-14 03:51:12,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:51:12,960 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 694 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:51:12,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 983 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:51:13,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572881 states. [2024-10-14 03:51:19,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572881 to 449426. [2024-10-14 03:51:19,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449426 states, 449425 states have (on average 1.378652722923736) internal successors, (619601), 449425 states have internal predecessors, (619601), 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-10-14 03:51:21,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449426 states to 449426 states and 619601 transitions. [2024-10-14 03:51:21,438 INFO L78 Accepts]: Start accepts. Automaton has 449426 states and 619601 transitions. Word has length 79 [2024-10-14 03:51:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:51:21,439 INFO L471 AbstractCegarLoop]: Abstraction has 449426 states and 619601 transitions. [2024-10-14 03:51:21,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-10-14 03:51:21,439 INFO L276 IsEmpty]: Start isEmpty. Operand 449426 states and 619601 transitions. [2024-10-14 03:51:21,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 03:51:21,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:51:21,446 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:51:21,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:51:21,446 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:51:21,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:51:21,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1845468041, now seen corresponding path program 1 times [2024-10-14 03:51:21,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:51:21,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187248252] [2024-10-14 03:51:21,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:51:21,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:51:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:51:21,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:51:21,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:51:21,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187248252] [2024-10-14 03:51:21,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187248252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:51:21,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:51:21,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:51:21,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339560788] [2024-10-14 03:51:21,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:51:21,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:51:21,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:51:21,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:51:21,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:51:21,506 INFO L87 Difference]: Start difference. First operand 449426 states and 619601 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-10-14 03:51:25,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:51:25,935 INFO L93 Difference]: Finished difference Result 963729 states and 1327325 transitions. [2024-10-14 03:51:25,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:51:25,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 81 [2024-10-14 03:51:25,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:51:26,795 INFO L225 Difference]: With dead ends: 963729 [2024-10-14 03:51:26,795 INFO L226 Difference]: Without dead ends: 523002 [2024-10-14 03:51:27,008 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-10-14 03:51:27,008 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 81 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 323 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-10-14 03:51:27,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 323 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:51:27,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523002 states.