./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/pals_lcr.7.ufo.BOUNDED-14.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.BOUNDED-14.pals.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 84bce40124007e6e483bf8a05621b58460eab347da71074e5760fdf76654ee7f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:24:35,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:24:36,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:24:36,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:24:36,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:24:36,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:24:36,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:24:36,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:24:36,064 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:24:36,065 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:24:36,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:24:36,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:24:36,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:24:36,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:24:36,069 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:24:36,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:24:36,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:24:36,070 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:24:36,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:24:36,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:24:36,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:24:36,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:24:36,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:24:36,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:24:36,075 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:24:36,075 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:24:36,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:24:36,075 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:24:36,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:24:36,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:24:36,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:24:36,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:24:36,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:24:36,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:24:36,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:24:36,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:24:36,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:24:36,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:24:36,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:24:36,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:24:36,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:24:36,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:24:36,081 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-clean/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-clean/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 -> 84bce40124007e6e483bf8a05621b58460eab347da71074e5760fdf76654ee7f [2024-10-11 03:24:36,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:24:36,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:24:36,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:24:36,386 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:24:36,386 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:24:36,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.BOUNDED-14.pals.c [2024-10-11 03:24:37,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:24:37,963 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:24:37,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.BOUNDED-14.pals.c [2024-10-11 03:24:37,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/22efdfe4b/776b354e9d374db196fb132d3ac3ea3f/FLAG8c221ee6b [2024-10-11 03:24:37,991 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/22efdfe4b/776b354e9d374db196fb132d3ac3ea3f [2024-10-11 03:24:37,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:24:37,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:24:37,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:24:38,000 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:24:38,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:24:38,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:24:37" (1/1) ... [2024-10-11 03:24:38,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b3e87ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:38, skipping insertion in model container [2024-10-11 03:24:38,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:24:37" (1/1) ... [2024-10-11 03:24:38,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:24:38,332 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/pals_lcr.7.ufo.BOUNDED-14.pals.c[20019,20032] [2024-10-11 03:24:38,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:24:38,356 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:24:38,431 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/pals_lcr.7.ufo.BOUNDED-14.pals.c[20019,20032] [2024-10-11 03:24:38,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:24:38,457 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:24:38,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:38 WrapperNode [2024-10-11 03:24:38,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:24:38,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:24:38,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:24:38,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:24:38,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:38" (1/1) ... [2024-10-11 03:24:38,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:38" (1/1) ... [2024-10-11 03:24:38,512 INFO L138 Inliner]: procedures = 26, calls = 18, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 460 [2024-10-11 03:24:38,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:24:38,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:24:38,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:24:38,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:24:38,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:38" (1/1) ... [2024-10-11 03:24:38,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:38" (1/1) ... [2024-10-11 03:24:38,534 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:38" (1/1) ... [2024-10-11 03:24:38,555 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-11 03:24:38,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:38" (1/1) ... [2024-10-11 03:24:38,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:38" (1/1) ... [2024-10-11 03:24:38,589 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:38" (1/1) ... [2024-10-11 03:24:38,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:38" (1/1) ... [2024-10-11 03:24:38,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:38" (1/1) ... [2024-10-11 03:24:38,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:38" (1/1) ... [2024-10-11 03:24:38,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:24:38,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:24:38,617 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:24:38,617 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:24:38,618 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:38" (1/1) ... [2024-10-11 03:24:38,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:24:38,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:24:38,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:24:38,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:24:38,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:24:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:24:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:24:38,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:24:38,825 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:24:38,827 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:24:39,356 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2024-10-11 03:24:39,357 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:24:39,413 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:24:39,414 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 03:24:39,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:24:39 BoogieIcfgContainer [2024-10-11 03:24:39,415 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:24:39,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:24:39,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:24:39,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:24:39,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:24:37" (1/3) ... [2024-10-11 03:24:39,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447eade7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:24:39, skipping insertion in model container [2024-10-11 03:24:39,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:38" (2/3) ... [2024-10-11 03:24:39,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447eade7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:24:39, skipping insertion in model container [2024-10-11 03:24:39,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:24:39" (3/3) ... [2024-10-11 03:24:39,425 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c [2024-10-11 03:24:39,439 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:24:39,439 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:24:39,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:24:39,506 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;@545641fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:24:39,507 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:24:39,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 107 states have (on average 1.8224299065420562) internal successors, (195), 108 states have internal predecessors, (195), 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-11 03:24:39,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 03:24:39,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:24:39,527 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] [2024-10-11 03:24:39,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:24:39,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:24:39,534 INFO L85 PathProgramCache]: Analyzing trace with hash 61708070, now seen corresponding path program 1 times [2024-10-11 03:24:39,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:24:39,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478709002] [2024-10-11 03:24:39,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:24:39,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:24:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:24:39,836 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-11 03:24:39,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:24:39,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478709002] [2024-10-11 03:24:39,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478709002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:24:39,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:24:39,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:24:39,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440338419] [2024-10-11 03:24:39,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:24:39,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 03:24:39,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:24:39,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 03:24:39,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:24:39,877 INFO L87 Difference]: Start difference. First operand has 109 states, 107 states have (on average 1.8224299065420562) internal successors, (195), 108 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-11 03:24:39,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:24:39,923 INFO L93 Difference]: Finished difference Result 165 states and 286 transitions. [2024-10-11 03:24:39,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 03:24:39,926 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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 24 [2024-10-11 03:24:39,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:24:39,936 INFO L225 Difference]: With dead ends: 165 [2024-10-11 03:24:39,936 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 03:24:39,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:24:39,944 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:24:39,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:24:39,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 03:24:39,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-11 03:24:39,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.7924528301886793) internal successors, (190), 106 states have internal predecessors, (190), 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-11 03:24:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 190 transitions. [2024-10-11 03:24:39,986 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 190 transitions. Word has length 24 [2024-10-11 03:24:39,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:24:39,986 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 190 transitions. [2024-10-11 03:24:39,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-11 03:24:39,987 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 190 transitions. [2024-10-11 03:24:39,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 03:24:39,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:24:39,988 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] [2024-10-11 03:24:39,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:24:39,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:24:39,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:24:39,989 INFO L85 PathProgramCache]: Analyzing trace with hash 484409896, now seen corresponding path program 1 times [2024-10-11 03:24:39,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:24:39,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318594854] [2024-10-11 03:24:39,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:24:39,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:24:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:24:40,230 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-11 03:24:40,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:24:40,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318594854] [2024-10-11 03:24:40,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318594854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:24:40,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:24:40,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:24:40,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654322] [2024-10-11 03:24:40,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:24:40,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:24:40,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:24:40,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:24:40,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:24:40,237 INFO L87 Difference]: Start difference. First operand 107 states and 190 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-11 03:24:40,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:24:40,354 INFO L93 Difference]: Finished difference Result 163 states and 279 transitions. [2024-10-11 03:24:40,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:24:40,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2024-10-11 03:24:40,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:24:40,356 INFO L225 Difference]: With dead ends: 163 [2024-10-11 03:24:40,356 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 03:24:40,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:24:40,358 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:24:40,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 508 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:24:40,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 03:24:40,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-11 03:24:40,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.320754716981132) internal successors, (140), 106 states have internal predecessors, (140), 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-11 03:24:40,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 140 transitions. [2024-10-11 03:24:40,374 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 140 transitions. Word has length 24 [2024-10-11 03:24:40,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:24:40,377 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 140 transitions. [2024-10-11 03:24:40,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-11 03:24:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 140 transitions. [2024-10-11 03:24:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 03:24:40,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:24:40,380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:24:40,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:24:40,380 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:24:40,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:24:40,381 INFO L85 PathProgramCache]: Analyzing trace with hash 456528988, now seen corresponding path program 1 times [2024-10-11 03:24:40,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:24:40,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327697055] [2024-10-11 03:24:40,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:24:40,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:24:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:24:40,787 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-11 03:24:40,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:24:40,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327697055] [2024-10-11 03:24:40,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327697055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:24:40,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:24:40,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:24:40,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045329577] [2024-10-11 03:24:40,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:24:40,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:24:40,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:24:40,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:24:40,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:24:40,794 INFO L87 Difference]: Start difference. First operand 107 states and 140 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 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-11 03:24:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:24:41,345 INFO L93 Difference]: Finished difference Result 849 states and 1344 transitions. [2024-10-11 03:24:41,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:24:41,346 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 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 73 [2024-10-11 03:24:41,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:24:41,352 INFO L225 Difference]: With dead ends: 849 [2024-10-11 03:24:41,354 INFO L226 Difference]: Without dead ends: 796 [2024-10-11 03:24:41,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-10-11 03:24:41,358 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1483 mSDsluCounter, 2856 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 2989 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:24:41,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 2989 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:24:41,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2024-10-11 03:24:41,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 158. [2024-10-11 03:24:41,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.4203821656050954) internal successors, (223), 157 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-11 03:24:41,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 223 transitions. [2024-10-11 03:24:41,403 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 223 transitions. Word has length 73 [2024-10-11 03:24:41,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:24:41,406 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 223 transitions. [2024-10-11 03:24:41,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 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-11 03:24:41,407 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 223 transitions. [2024-10-11 03:24:41,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 03:24:41,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:24:41,409 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:24:41,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:24:41,409 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:24:41,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:24:41,411 INFO L85 PathProgramCache]: Analyzing trace with hash -122926772, now seen corresponding path program 1 times [2024-10-11 03:24:41,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:24:41,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080336763] [2024-10-11 03:24:41,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:24:41,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:24:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:24:41,542 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-11 03:24:41,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:24:41,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080336763] [2024-10-11 03:24:41,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080336763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:24:41,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:24:41,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:24:41,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744146448] [2024-10-11 03:24:41,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:24:41,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:24:41,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:24:41,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:24:41,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:24:41,545 INFO L87 Difference]: Start difference. First operand 158 states and 223 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-11 03:24:41,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:24:41,569 INFO L93 Difference]: Finished difference Result 355 states and 542 transitions. [2024-10-11 03:24:41,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:24:41,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 75 [2024-10-11 03:24:41,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:24:41,572 INFO L225 Difference]: With dead ends: 355 [2024-10-11 03:24:41,572 INFO L226 Difference]: Without dead ends: 251 [2024-10-11 03:24:41,573 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-11 03:24:41,575 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 58 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:24:41,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 215 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:24:41,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-11 03:24:41,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2024-10-11 03:24:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.4879032258064515) internal successors, (369), 248 states have internal predecessors, (369), 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-11 03:24:41,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 369 transitions. [2024-10-11 03:24:41,596 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 369 transitions. Word has length 75 [2024-10-11 03:24:41,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:24:41,596 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 369 transitions. [2024-10-11 03:24:41,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-11 03:24:41,596 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 369 transitions. [2024-10-11 03:24:41,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 03:24:41,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:24:41,600 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:24:41,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:24:41,601 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:24:41,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:24:41,602 INFO L85 PathProgramCache]: Analyzing trace with hash -120781820, now seen corresponding path program 1 times [2024-10-11 03:24:41,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:24:41,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013230782] [2024-10-11 03:24:41,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:24:41,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:24:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:24:42,152 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-11 03:24:42,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:24:42,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013230782] [2024-10-11 03:24:42,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013230782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:24:42,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:24:42,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:24:42,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262533944] [2024-10-11 03:24:42,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:24:42,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:24:42,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:24:42,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:24:42,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:24:42,158 INFO L87 Difference]: Start difference. First operand 249 states and 369 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 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-11 03:24:42,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:24:42,552 INFO L93 Difference]: Finished difference Result 446 states and 685 transitions. [2024-10-11 03:24:42,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:24:42,552 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 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 75 [2024-10-11 03:24:42,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:24:42,555 INFO L225 Difference]: With dead ends: 446 [2024-10-11 03:24:42,555 INFO L226 Difference]: Without dead ends: 251 [2024-10-11 03:24:42,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:24:42,559 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 119 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:24:42,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 709 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:24:42,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-11 03:24:42,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2024-10-11 03:24:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.4798387096774193) internal successors, (367), 248 states have internal predecessors, (367), 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-11 03:24:42,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 367 transitions. [2024-10-11 03:24:42,577 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 367 transitions. Word has length 75 [2024-10-11 03:24:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:24:42,578 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 367 transitions. [2024-10-11 03:24:42,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 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-11 03:24:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 367 transitions. [2024-10-11 03:24:42,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 03:24:42,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:24:42,583 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:24:42,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:24:42,583 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:24:42,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:24:42,584 INFO L85 PathProgramCache]: Analyzing trace with hash 536658470, now seen corresponding path program 1 times [2024-10-11 03:24:42,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:24:42,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514598504] [2024-10-11 03:24:42,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:24:42,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:24:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:24:42,804 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-11 03:24:42,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:24:42,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514598504] [2024-10-11 03:24:42,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514598504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:24:42,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:24:42,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:24:42,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785693838] [2024-10-11 03:24:42,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:24:42,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:24:42,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:24:42,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:24:42,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:24:42,808 INFO L87 Difference]: Start difference. First operand 249 states and 367 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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-11 03:24:42,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:24:42,832 INFO L93 Difference]: Finished difference Result 255 states and 374 transitions. [2024-10-11 03:24:42,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:24:42,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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-11 03:24:42,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:24:42,835 INFO L225 Difference]: With dead ends: 255 [2024-10-11 03:24:42,836 INFO L226 Difference]: Without dead ends: 253 [2024-10-11 03:24:42,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:24:42,838 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:24:42,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 400 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:24:42,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-11 03:24:42,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2024-10-11 03:24:42,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.4682539682539681) internal successors, (370), 252 states have internal predecessors, (370), 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-11 03:24:42,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 370 transitions. [2024-10-11 03:24:42,852 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 370 transitions. Word has length 76 [2024-10-11 03:24:42,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:24:42,853 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 370 transitions. [2024-10-11 03:24:42,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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-11 03:24:42,853 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 370 transitions. [2024-10-11 03:24:42,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:24:42,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:24:42,854 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, 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-11 03:24:42,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:24:42,854 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:24:42,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:24:42,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1846932892, now seen corresponding path program 1 times [2024-10-11 03:24:42,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:24:42,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181499802] [2024-10-11 03:24:42,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:24:42,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:24:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:24:42,931 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-11 03:24:42,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:24:42,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181499802] [2024-10-11 03:24:42,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181499802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:24:42,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:24:42,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:24:42,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31185795] [2024-10-11 03:24:42,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:24:42,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:24:42,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:24:42,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:24:42,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:24:42,934 INFO L87 Difference]: Start difference. First operand 253 states and 370 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11 03:24:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:24:42,956 INFO L93 Difference]: Finished difference Result 463 states and 703 transitions. [2024-10-11 03:24:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:24:42,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11 03:24:42,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:24:42,959 INFO L225 Difference]: With dead ends: 463 [2024-10-11 03:24:42,959 INFO L226 Difference]: Without dead ends: 355 [2024-10-11 03:24:42,959 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-11 03:24:42,960 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 76 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:24:42,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 293 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:24:42,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-11 03:24:42,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2024-10-11 03:24:42,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.4971590909090908) internal successors, (527), 352 states have internal predecessors, (527), 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-11 03:24:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 527 transitions. [2024-10-11 03:24:42,974 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 527 transitions. Word has length 77 [2024-10-11 03:24:42,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:24:42,974 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 527 transitions. [2024-10-11 03:24:42,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11 03:24:42,975 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 527 transitions. [2024-10-11 03:24:42,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:24:42,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:24:42,976 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, 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-11 03:24:42,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:24:42,977 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:24:42,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:24:42,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1501935516, now seen corresponding path program 1 times [2024-10-11 03:24:42,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:24:42,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416397160] [2024-10-11 03:24:42,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:24:42,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:24:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:24:43,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:24:43,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:24:43,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416397160] [2024-10-11 03:24:43,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416397160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:24:43,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:24:43,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:24:43,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430011115] [2024-10-11 03:24:43,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:24:43,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:24:43,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:24:43,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:24:43,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:24:43,063 INFO L87 Difference]: Start difference. First operand 353 states and 527 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11 03:24:43,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:24:43,096 INFO L93 Difference]: Finished difference Result 923 states and 1427 transitions. [2024-10-11 03:24:43,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:24:43,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11 03:24:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:24:43,100 INFO L225 Difference]: With dead ends: 923 [2024-10-11 03:24:43,100 INFO L226 Difference]: Without dead ends: 626 [2024-10-11 03:24:43,101 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-11 03:24:43,102 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 72 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:24:43,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 293 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:24:43,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-10-11 03:24:43,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2024-10-11 03:24:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 623 states have (on average 1.5232744783306582) internal successors, (949), 623 states have internal predecessors, (949), 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-11 03:24:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 949 transitions. [2024-10-11 03:24:43,124 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 949 transitions. Word has length 77 [2024-10-11 03:24:43,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:24:43,124 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 949 transitions. [2024-10-11 03:24:43,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11 03:24:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 949 transitions. [2024-10-11 03:24:43,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:24:43,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:24:43,126 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, 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-11 03:24:43,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:24:43,126 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:24:43,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:24:43,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1770518684, now seen corresponding path program 1 times [2024-10-11 03:24:43,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:24:43,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657122626] [2024-10-11 03:24:43,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:24:43,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:24:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:24:43,203 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-11 03:24:43,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:24:43,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657122626] [2024-10-11 03:24:43,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657122626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:24:43,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:24:43,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:24:43,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517293056] [2024-10-11 03:24:43,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:24:43,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:24:43,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:24:43,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:24:43,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:24:43,207 INFO L87 Difference]: Start difference. First operand 624 states and 949 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11 03:24:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:24:43,247 INFO L93 Difference]: Finished difference Result 1712 states and 2651 transitions. [2024-10-11 03:24:43,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:24:43,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11 03:24:43,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:24:43,256 INFO L225 Difference]: With dead ends: 1712 [2024-10-11 03:24:43,256 INFO L226 Difference]: Without dead ends: 1144 [2024-10-11 03:24:43,257 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-11 03:24:43,258 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 70 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:24:43,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 295 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:24:43,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2024-10-11 03:24:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1142. [2024-10-11 03:24:43,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1141 states have (on average 1.5293602103418054) internal successors, (1745), 1141 states have internal predecessors, (1745), 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-11 03:24:43,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1745 transitions. [2024-10-11 03:24:43,295 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1745 transitions. Word has length 77 [2024-10-11 03:24:43,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:24:43,295 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1745 transitions. [2024-10-11 03:24:43,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11 03:24:43,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1745 transitions. [2024-10-11 03:24:43,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:24:43,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:24:43,297 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, 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-11 03:24:43,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:24:43,297 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:24:43,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:24:43,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1938736484, now seen corresponding path program 1 times [2024-10-11 03:24:43,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:24:43,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857678681] [2024-10-11 03:24:43,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:24:43,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:24:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:24:43,366 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-11 03:24:43,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:24:43,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857678681] [2024-10-11 03:24:43,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857678681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:24:43,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:24:43,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:24:43,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481311229] [2024-10-11 03:24:43,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:24:43,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:24:43,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:24:43,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:24:43,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:24:43,371 INFO L87 Difference]: Start difference. First operand 1142 states and 1745 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11 03:24:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:24:43,424 INFO L93 Difference]: Finished difference Result 3218 states and 4955 transitions. [2024-10-11 03:24:43,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:24:43,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11 03:24:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:24:43,433 INFO L225 Difference]: With dead ends: 3218 [2024-10-11 03:24:43,433 INFO L226 Difference]: Without dead ends: 2132 [2024-10-11 03:24:43,435 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-11 03:24:43,436 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 66 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:24:43,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 291 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:24:43,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2024-10-11 03:24:43,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2130. [2024-10-11 03:24:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2130 states, 2129 states have (on average 1.5223109441052136) internal successors, (3241), 2129 states have internal predecessors, (3241), 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-11 03:24:43,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 3241 transitions. [2024-10-11 03:24:43,538 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 3241 transitions. Word has length 77 [2024-10-11 03:24:43,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:24:43,539 INFO L471 AbstractCegarLoop]: Abstraction has 2130 states and 3241 transitions. [2024-10-11 03:24:43,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11 03:24:43,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 3241 transitions. [2024-10-11 03:24:43,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:24:43,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:24:43,540 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, 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-11 03:24:43,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:24:43,541 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:24:43,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:24:43,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1467497372, now seen corresponding path program 1 times [2024-10-11 03:24:43,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:24:43,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680837867] [2024-10-11 03:24:43,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:24:43,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:24:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:24:43,625 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-11 03:24:43,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:24:43,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680837867] [2024-10-11 03:24:43,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680837867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:24:43,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:24:43,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:24:43,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733506694] [2024-10-11 03:24:43,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:24:43,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:24:43,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:24:43,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:24:43,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:24:43,628 INFO L87 Difference]: Start difference. First operand 2130 states and 3241 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11 03:24:43,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:24:43,704 INFO L93 Difference]: Finished difference Result 6086 states and 9275 transitions. [2024-10-11 03:24:43,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:24:43,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11 03:24:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:24:43,720 INFO L225 Difference]: With dead ends: 6086 [2024-10-11 03:24:43,721 INFO L226 Difference]: Without dead ends: 4012 [2024-10-11 03:24:43,727 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-11 03:24:43,728 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 64 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:24:43,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 293 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:24:43,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4012 states. [2024-10-11 03:24:43,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4012 to 4010. [2024-10-11 03:24:43,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4010 states, 4009 states have (on average 1.5068595659765527) internal successors, (6041), 4009 states have internal predecessors, (6041), 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-11 03:24:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 6041 transitions. [2024-10-11 03:24:43,847 INFO L78 Accepts]: Start accepts. Automaton has 4010 states and 6041 transitions. Word has length 77 [2024-10-11 03:24:43,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:24:43,847 INFO L471 AbstractCegarLoop]: Abstraction has 4010 states and 6041 transitions. [2024-10-11 03:24:43,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11 03:24:43,847 INFO L276 IsEmpty]: Start isEmpty. Operand 4010 states and 6041 transitions. [2024-10-11 03:24:43,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:24:43,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:24:43,848 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, 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-11 03:24:43,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:24:43,848 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:24:43,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:24:43,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1730574748, now seen corresponding path program 1 times [2024-10-11 03:24:43,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:24:43,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798969764] [2024-10-11 03:24:43,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:24:43,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:24:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:24:43,948 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-11 03:24:43,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:24:43,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798969764] [2024-10-11 03:24:43,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798969764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:24:43,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:24:43,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:24:43,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321549966] [2024-10-11 03:24:43,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:24:43,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:24:43,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:24:43,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:24:43,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:24:43,951 INFO L87 Difference]: Start difference. First operand 4010 states and 6041 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11 03:24:44,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:24:44,085 INFO L93 Difference]: Finished difference Result 11534 states and 17339 transitions. [2024-10-11 03:24:44,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:24:44,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11 03:24:44,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:24:44,115 INFO L225 Difference]: With dead ends: 11534 [2024-10-11 03:24:44,115 INFO L226 Difference]: Without dead ends: 7580 [2024-10-11 03:24:44,123 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-11 03:24:44,124 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 68 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:24:44,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 297 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:24:44,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7580 states. [2024-10-11 03:24:44,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7580 to 7578. [2024-10-11 03:24:44,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7578 states, 7577 states have (on average 1.4856803484228587) internal successors, (11257), 7577 states have internal predecessors, (11257), 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-11 03:24:44,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 11257 transitions. [2024-10-11 03:24:44,383 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 11257 transitions. Word has length 77 [2024-10-11 03:24:44,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:24:44,383 INFO L471 AbstractCegarLoop]: Abstraction has 7578 states and 11257 transitions. [2024-10-11 03:24:44,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11 03:24:44,384 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 11257 transitions. [2024-10-11 03:24:44,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:24:44,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:24:44,385 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, 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-11 03:24:44,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:24:44,385 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:24:44,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:24:44,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1091548828, now seen corresponding path program 1 times [2024-10-11 03:24:44,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:24:44,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185879618] [2024-10-11 03:24:44,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:24:44,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:24:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:24:44,440 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-11 03:24:44,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:24:44,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185879618] [2024-10-11 03:24:44,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185879618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:24:44,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:24:44,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:24:44,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22293647] [2024-10-11 03:24:44,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:24:44,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:24:44,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:24:44,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:24:44,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:24:44,443 INFO L87 Difference]: Start difference. First operand 7578 states and 11257 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11 03:24:44,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:24:44,747 INFO L93 Difference]: Finished difference Result 21854 states and 32315 transitions. [2024-10-11 03:24:44,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:24:44,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11 03:24:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:24:44,814 INFO L225 Difference]: With dead ends: 21854 [2024-10-11 03:24:44,815 INFO L226 Difference]: Without dead ends: 14332 [2024-10-11 03:24:44,828 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-11 03:24:44,829 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 74 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:24:44,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 299 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:24:44,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14332 states. [2024-10-11 03:24:45,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14332 to 14330. [2024-10-11 03:24:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14330 states, 14329 states have (on average 1.4600460604368763) internal successors, (20921), 14329 states have internal predecessors, (20921), 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-11 03:24:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14330 states to 14330 states and 20921 transitions. [2024-10-11 03:24:45,420 INFO L78 Accepts]: Start accepts. Automaton has 14330 states and 20921 transitions. Word has length 77 [2024-10-11 03:24:45,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:24:45,421 INFO L471 AbstractCegarLoop]: Abstraction has 14330 states and 20921 transitions. [2024-10-11 03:24:45,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11 03:24:45,421 INFO L276 IsEmpty]: Start isEmpty. Operand 14330 states and 20921 transitions. [2024-10-11 03:24:45,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 03:24:45,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:24:45,426 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:24:45,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:24:45,426 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:24:45,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:24:45,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1778428204, now seen corresponding path program 1 times [2024-10-11 03:24:45,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:24:45,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318383127] [2024-10-11 03:24:45,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:24:45,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:24:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:24:45,715 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:24:45,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:24:45,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318383127] [2024-10-11 03:24:45,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318383127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:24:45,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:24:45,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:24:45,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536297319] [2024-10-11 03:24:45,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:24:45,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:24:45,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:24:45,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:24:45,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:24:45,718 INFO L87 Difference]: Start difference. First operand 14330 states and 20921 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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-11 03:24:47,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:24:47,969 INFO L93 Difference]: Finished difference Result 112842 states and 164865 transitions. [2024-10-11 03:24:47,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:24:47,970 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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 99 [2024-10-11 03:24:47,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:24:48,329 INFO L225 Difference]: With dead ends: 112842 [2024-10-11 03:24:48,330 INFO L226 Difference]: Without dead ends: 102856 [2024-10-11 03:24:48,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:24:48,400 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 1217 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:24:48,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 1440 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:24:48,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102856 states. [2024-10-11 03:24:50,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102856 to 26490. [2024-10-11 03:24:50,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26490 states, 26489 states have (on average 1.454226282607875) internal successors, (38521), 26489 states have internal predecessors, (38521), 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-11 03:24:50,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26490 states to 26490 states and 38521 transitions. [2024-10-11 03:24:50,283 INFO L78 Accepts]: Start accepts. Automaton has 26490 states and 38521 transitions. Word has length 99 [2024-10-11 03:24:50,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:24:50,284 INFO L471 AbstractCegarLoop]: Abstraction has 26490 states and 38521 transitions. [2024-10-11 03:24:50,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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-11 03:24:50,284 INFO L276 IsEmpty]: Start isEmpty. Operand 26490 states and 38521 transitions. [2024-10-11 03:24:50,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 03:24:50,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:24:50,380 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:24:50,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:24:50,380 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:24:50,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:24:50,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1433430828, now seen corresponding path program 1 times [2024-10-11 03:24:50,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:24:50,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236661622] [2024-10-11 03:24:50,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:24:50,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:24:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:24:50,615 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 03:24:50,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:24:50,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236661622] [2024-10-11 03:24:50,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236661622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:24:50,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:24:50,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:24:50,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413701849] [2024-10-11 03:24:50,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:24:50,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:24:50,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:24:50,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:24:50,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:24:50,618 INFO L87 Difference]: Start difference. First operand 26490 states and 38521 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-11 03:24:52,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:24:52,840 INFO L93 Difference]: Finished difference Result 127114 states and 185601 transitions. [2024-10-11 03:24:52,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:24:52,840 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 99 [2024-10-11 03:24:52,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:24:53,072 INFO L225 Difference]: With dead ends: 127114 [2024-10-11 03:24:53,072 INFO L226 Difference]: Without dead ends: 112840 [2024-10-11 03:24:53,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:24:53,111 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 1280 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:24:53,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 1525 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:24:53,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112840 states. [2024-10-11 03:24:54,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112840 to 45754. [2024-10-11 03:24:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45754 states, 45753 states have (on average 1.4504185517889536) internal successors, (66361), 45753 states have internal predecessors, (66361), 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-11 03:24:55,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45754 states to 45754 states and 66361 transitions. [2024-10-11 03:24:55,115 INFO L78 Accepts]: Start accepts. Automaton has 45754 states and 66361 transitions. Word has length 99 [2024-10-11 03:24:55,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:24:55,116 INFO L471 AbstractCegarLoop]: Abstraction has 45754 states and 66361 transitions. [2024-10-11 03:24:55,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-11 03:24:55,116 INFO L276 IsEmpty]: Start isEmpty. Operand 45754 states and 66361 transitions. [2024-10-11 03:24:55,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 03:24:55,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:24:55,123 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:24:55,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:24:55,123 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:24:55,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:24:55,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1702013996, now seen corresponding path program 1 times [2024-10-11 03:24:55,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:24:55,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969635633] [2024-10-11 03:24:55,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:24:55,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:24:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:24:55,344 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 03:24:55,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:24:55,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969635633] [2024-10-11 03:24:55,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969635633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:24:55,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:24:55,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:24:55,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860591658] [2024-10-11 03:24:55,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:24:55,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:24:55,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:24:55,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:24:55,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:24:55,349 INFO L87 Difference]: Start difference. First operand 45754 states and 66361 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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-11 03:24:58,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:24:58,059 INFO L93 Difference]: Finished difference Result 141386 states and 206273 transitions. [2024-10-11 03:24:58,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:24:58,060 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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 99 [2024-10-11 03:24:58,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:24:58,328 INFO L225 Difference]: With dead ends: 141386 [2024-10-11 03:24:58,329 INFO L226 Difference]: Without dead ends: 127112 [2024-10-11 03:24:58,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:24:58,367 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 1377 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:24:58,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 1396 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:24:58,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127112 states. [2024-10-11 03:25:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127112 to 60026. [2024-10-11 03:25:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60026 states, 60025 states have (on average 1.4499458558933778) internal successors, (87033), 60025 states have internal predecessors, (87033), 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-11 03:25:00,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60026 states to 60026 states and 87033 transitions. [2024-10-11 03:25:00,888 INFO L78 Accepts]: Start accepts. Automaton has 60026 states and 87033 transitions. Word has length 99 [2024-10-11 03:25:00,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:00,889 INFO L471 AbstractCegarLoop]: Abstraction has 60026 states and 87033 transitions. [2024-10-11 03:25:00,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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-11 03:25:00,889 INFO L276 IsEmpty]: Start isEmpty. Operand 60026 states and 87033 transitions. [2024-10-11 03:25:00,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 03:25:00,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:00,896 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:25:00,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:25:00,897 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:00,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:00,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2007241172, now seen corresponding path program 1 times [2024-10-11 03:25:00,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:00,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998689644] [2024-10-11 03:25:00,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:00,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 03:25:01,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:01,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998689644] [2024-10-11 03:25:01,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998689644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:01,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:01,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:25:01,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551235654] [2024-10-11 03:25:01,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:01,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:25:01,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:01,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:25:01,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:25:01,127 INFO L87 Difference]: Start difference. First operand 60026 states and 87033 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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-11 03:25:04,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:04,682 INFO L93 Difference]: Finished difference Result 155658 states and 226945 transitions. [2024-10-11 03:25:04,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:25:04,683 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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 99 [2024-10-11 03:25:04,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:04,923 INFO L225 Difference]: With dead ends: 155658 [2024-10-11 03:25:04,924 INFO L226 Difference]: Without dead ends: 141384 [2024-10-11 03:25:04,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:25:04,969 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 1460 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1460 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:04,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1460 Valid, 1426 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:25:05,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141384 states. [2024-10-11 03:25:07,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141384 to 74298. [2024-10-11 03:25:07,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74298 states, 74297 states have (on average 1.4496547639877788) internal successors, (107705), 74297 states have internal predecessors, (107705), 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-11 03:25:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74298 states to 74298 states and 107705 transitions. [2024-10-11 03:25:07,981 INFO L78 Accepts]: Start accepts. Automaton has 74298 states and 107705 transitions. Word has length 99 [2024-10-11 03:25:07,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:07,982 INFO L471 AbstractCegarLoop]: Abstraction has 74298 states and 107705 transitions. [2024-10-11 03:25:07,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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-11 03:25:07,983 INFO L276 IsEmpty]: Start isEmpty. Operand 74298 states and 107705 transitions. [2024-10-11 03:25:07,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 03:25:07,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:07,991 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:25:07,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:25:07,991 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:07,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:07,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1398992684, now seen corresponding path program 1 times [2024-10-11 03:25:07,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:07,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514472456] [2024-10-11 03:25:07,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:07,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:08,211 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 03:25:08,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:08,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514472456] [2024-10-11 03:25:08,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514472456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:08,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:08,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:25:08,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654945353] [2024-10-11 03:25:08,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:08,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:25:08,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:08,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:25:08,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:25:08,213 INFO L87 Difference]: Start difference. First operand 74298 states and 107705 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-11 03:25:12,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:12,004 INFO L93 Difference]: Finished difference Result 169930 states and 247617 transitions. [2024-10-11 03:25:12,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:25:12,005 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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 99 [2024-10-11 03:25:12,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:12,283 INFO L225 Difference]: With dead ends: 169930 [2024-10-11 03:25:12,283 INFO L226 Difference]: Without dead ends: 155656 [2024-10-11 03:25:12,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:25:12,333 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 1331 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:12,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 1457 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:25:12,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155656 states. [2024-10-11 03:25:15,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155656 to 88570. [2024-10-11 03:25:15,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88570 states, 88569 states have (on average 1.449457485124592) internal successors, (128377), 88569 states have internal predecessors, (128377), 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-11 03:25:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88570 states to 88570 states and 128377 transitions. [2024-10-11 03:25:15,589 INFO L78 Accepts]: Start accepts. Automaton has 88570 states and 128377 transitions. Word has length 99 [2024-10-11 03:25:15,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:15,590 INFO L471 AbstractCegarLoop]: Abstraction has 88570 states and 128377 transitions. [2024-10-11 03:25:15,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-11 03:25:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 88570 states and 128377 transitions. [2024-10-11 03:25:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 03:25:15,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:15,597 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:25:15,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:25:15,597 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:15,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:15,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1662070060, now seen corresponding path program 1 times [2024-10-11 03:25:15,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:15,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604807700] [2024-10-11 03:25:15,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:15,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 03:25:16,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:16,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604807700] [2024-10-11 03:25:16,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604807700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:16,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:16,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:25:16,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374290580] [2024-10-11 03:25:16,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:16,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:25:16,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:16,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:25:16,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:25:16,121 INFO L87 Difference]: Start difference. First operand 88570 states and 128377 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-11 03:25:19,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:19,982 INFO L93 Difference]: Finished difference Result 184202 states and 268289 transitions. [2024-10-11 03:25:19,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:25:19,983 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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 99 [2024-10-11 03:25:19,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:20,279 INFO L225 Difference]: With dead ends: 184202 [2024-10-11 03:25:20,280 INFO L226 Difference]: Without dead ends: 169928 [2024-10-11 03:25:20,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:25:20,324 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 1211 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:20,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 1643 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:25:20,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169928 states. [2024-10-11 03:25:23,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169928 to 102842. [2024-10-11 03:25:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102842 states, 102841 states have (on average 1.4493149619315253) internal successors, (149049), 102841 states have internal predecessors, (149049), 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-11 03:25:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102842 states to 102842 states and 149049 transitions. [2024-10-11 03:25:24,166 INFO L78 Accepts]: Start accepts. Automaton has 102842 states and 149049 transitions. Word has length 99 [2024-10-11 03:25:24,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:24,166 INFO L471 AbstractCegarLoop]: Abstraction has 102842 states and 149049 transitions. [2024-10-11 03:25:24,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-11 03:25:24,167 INFO L276 IsEmpty]: Start isEmpty. Operand 102842 states and 149049 transitions. [2024-10-11 03:25:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 03:25:24,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:24,173 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:25:24,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:25:24,174 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:24,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:24,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1023044140, now seen corresponding path program 1 times [2024-10-11 03:25:24,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:24,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501955821] [2024-10-11 03:25:24,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:24,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:25:24,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:24,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501955821] [2024-10-11 03:25:24,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501955821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:24,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:24,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:25:24,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554933967] [2024-10-11 03:25:24,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:24,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:25:24,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:24,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:25:24,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:25:24,606 INFO L87 Difference]: Start difference. First operand 102842 states and 149049 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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-11 03:25:29,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:29,075 INFO L93 Difference]: Finished difference Result 198474 states and 288961 transitions. [2024-10-11 03:25:29,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:25:29,076 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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 99 [2024-10-11 03:25:29,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:29,419 INFO L225 Difference]: With dead ends: 198474 [2024-10-11 03:25:29,419 INFO L226 Difference]: Without dead ends: 184200 [2024-10-11 03:25:29,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:25:29,468 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 1219 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:29,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 1716 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:25:29,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184200 states.