./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-var-start-time.4.ufo.UNBOUNDED.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-var-start-time.4.ufo.UNBOUNDED.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 aba75d5c6112bb80051134ed7f98fd80207b53da5b894be601f1f010079e2e6e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:21:06,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:21:06,925 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:21:06,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:21:06,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:21:06,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:21:06,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:21:06,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:21:06,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:21:06,969 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:21:06,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:21:06,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:21:06,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:21:06,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:21:06,972 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:21:06,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:21:06,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:21:06,973 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:21:06,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:21:06,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:21:06,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:21:06,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:21:06,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:21:06,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:21:06,978 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:21:06,978 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:21:06,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:21:06,979 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:21:06,979 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:21:06,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:21:06,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:21:06,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:21:06,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:21:06,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:21:06,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:21:06,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:21:06,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:21:06,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:21:06,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:21:06,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:21:06,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:21:06,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:21:06,983 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 -> aba75d5c6112bb80051134ed7f98fd80207b53da5b894be601f1f010079e2e6e [2024-10-11 03:21:07,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:21:07,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:21:07,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:21:07,295 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:21:07,296 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:21:07,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c [2024-10-11 03:21:08,751 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:21:08,963 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:21:08,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c [2024-10-11 03:21:08,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/eb1d5267e/da7ca5f8ade340808e0fea79bbde1e89/FLAGc27d0af6b [2024-10-11 03:21:08,988 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/eb1d5267e/da7ca5f8ade340808e0fea79bbde1e89 [2024-10-11 03:21:08,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:21:08,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:21:08,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:21:08,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:21:08,999 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:21:09,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:21:08" (1/1) ... [2024-10-11 03:21:09,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61461f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:09, skipping insertion in model container [2024-10-11 03:21:09,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:21:08" (1/1) ... [2024-10-11 03:21:09,034 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:21:09,292 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-var-start-time.4.ufo.UNBOUNDED.pals.c[9488,9501] [2024-10-11 03:21:09,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:21:09,308 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:21:09,358 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c[9488,9501] [2024-10-11 03:21:09,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:21:09,382 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:21:09,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:09 WrapperNode [2024-10-11 03:21:09,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:21:09,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:21:09,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:21:09,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:21:09,392 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:21:09" (1/1) ... [2024-10-11 03:21:09,405 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:21:09" (1/1) ... [2024-10-11 03:21:09,487 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 315 [2024-10-11 03:21:09,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:21:09,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:21:09,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:21:09,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:21:09,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:09" (1/1) ... [2024-10-11 03:21:09,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:09" (1/1) ... [2024-10-11 03:21:09,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:09" (1/1) ... [2024-10-11 03:21:09,550 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:21:09,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:09" (1/1) ... [2024-10-11 03:21:09,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:09" (1/1) ... [2024-10-11 03:21:09,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:21:09" (1/1) ... [2024-10-11 03:21:09,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:09" (1/1) ... [2024-10-11 03:21:09,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:09" (1/1) ... [2024-10-11 03:21:09,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:09" (1/1) ... [2024-10-11 03:21:09,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:21:09,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:21:09,617 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:21:09,617 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:21:09,617 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:09" (1/1) ... [2024-10-11 03:21:09,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:21:09,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:21:09,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:21:09,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:21:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:21:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:21:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:21:09,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:21:09,791 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:21:09,792 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:21:10,226 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-10-11 03:21:10,226 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:21:10,276 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:21:10,277 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 03:21:10,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:21:10 BoogieIcfgContainer [2024-10-11 03:21:10,277 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:21:10,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:21:10,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:21:10,283 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:21:10,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:21:08" (1/3) ... [2024-10-11 03:21:10,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ed6e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:21:10, skipping insertion in model container [2024-10-11 03:21:10,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:09" (2/3) ... [2024-10-11 03:21:10,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ed6e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:21:10, skipping insertion in model container [2024-10-11 03:21:10,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:21:10" (3/3) ... [2024-10-11 03:21:10,287 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c [2024-10-11 03:21:10,302 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:21:10,302 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:21:10,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:21:10,360 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;@12f38c5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:21:10,360 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:21:10,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 79 states have (on average 1.7721518987341771) internal successors, (140), 80 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:21:10,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 03:21:10,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:10,371 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] [2024-10-11 03:21:10,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:10,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:10,376 INFO L85 PathProgramCache]: Analyzing trace with hash -436537251, now seen corresponding path program 1 times [2024-10-11 03:21:10,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:10,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50540727] [2024-10-11 03:21:10,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:10,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:10,609 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:21:10,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:10,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50540727] [2024-10-11 03:21:10,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50540727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:10,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:10,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:21:10,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424473102] [2024-10-11 03:21:10,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:10,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 03:21:10,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:10,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 03:21:10,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:21:10,640 INFO L87 Difference]: Start difference. First operand has 81 states, 79 states have (on average 1.7721518987341771) internal successors, (140), 80 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) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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:21:10,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:10,678 INFO L93 Difference]: Finished difference Result 133 states and 227 transitions. [2024-10-11 03:21:10,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 03:21:10,682 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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 26 [2024-10-11 03:21:10,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:10,694 INFO L225 Difference]: With dead ends: 133 [2024-10-11 03:21:10,694 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 03:21:10,697 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:21:10,701 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:10,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:10,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 03:21:10,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-11 03:21:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.7307692307692308) internal successors, (135), 78 states have internal predecessors, (135), 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:21:10,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 135 transitions. [2024-10-11 03:21:10,736 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 135 transitions. Word has length 26 [2024-10-11 03:21:10,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:10,737 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 135 transitions. [2024-10-11 03:21:10,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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:21:10,737 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 135 transitions. [2024-10-11 03:21:10,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 03:21:10,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:10,738 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] [2024-10-11 03:21:10,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:21:10,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:10,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:10,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2052991711, now seen corresponding path program 1 times [2024-10-11 03:21:10,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:10,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602245534] [2024-10-11 03:21:10,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:10,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:10,984 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:21:10,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:10,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602245534] [2024-10-11 03:21:10,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602245534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:10,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:10,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:21:10,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515619585] [2024-10-11 03:21:10,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:10,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:21:10,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:10,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:21:10,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:21:10,992 INFO L87 Difference]: Start difference. First operand 79 states and 135 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:21:11,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:11,069 INFO L93 Difference]: Finished difference Result 133 states and 221 transitions. [2024-10-11 03:21:11,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:21:11,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2024-10-11 03:21:11,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:11,070 INFO L225 Difference]: With dead ends: 133 [2024-10-11 03:21:11,071 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 03:21:11,071 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:21:11,072 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:11,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 369 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:21:11,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 03:21:11,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-11 03:21:11,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 78 states have internal predecessors, (111), 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:21:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 111 transitions. [2024-10-11 03:21:11,082 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 111 transitions. Word has length 26 [2024-10-11 03:21:11,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:11,083 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 111 transitions. [2024-10-11 03:21:11,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:21:11,083 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 111 transitions. [2024-10-11 03:21:11,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:21:11,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:11,085 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:11,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:21:11,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:11,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:11,086 INFO L85 PathProgramCache]: Analyzing trace with hash 794604760, now seen corresponding path program 1 times [2024-10-11 03:21:11,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:11,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902336406] [2024-10-11 03:21:11,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:11,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:11,232 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:21:11,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:11,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902336406] [2024-10-11 03:21:11,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902336406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:11,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:11,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:11,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433981045] [2024-10-11 03:21:11,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:11,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:11,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:11,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:11,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:11,235 INFO L87 Difference]: Start difference. First operand 79 states and 111 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:11,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:11,271 INFO L93 Difference]: Finished difference Result 173 states and 263 transitions. [2024-10-11 03:21:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:11,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-11 03:21:11,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:11,273 INFO L225 Difference]: With dead ends: 173 [2024-10-11 03:21:11,274 INFO L226 Difference]: Without dead ends: 122 [2024-10-11 03:21:11,277 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:21:11,278 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 59 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:11,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 209 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:11,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-11 03:21:11,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-10-11 03:21:11,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.495798319327731) internal successors, (178), 119 states have internal predecessors, (178), 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:21:11,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2024-10-11 03:21:11,301 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 49 [2024-10-11 03:21:11,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:11,301 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 178 transitions. [2024-10-11 03:21:11,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:11,302 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 178 transitions. [2024-10-11 03:21:11,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:21:11,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:11,303 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:11,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:21:11,305 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:11,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:11,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1181399799, now seen corresponding path program 1 times [2024-10-11 03:21:11,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:11,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972599324] [2024-10-11 03:21:11,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:11,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:11,506 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:21:11,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:11,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972599324] [2024-10-11 03:21:11,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972599324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:11,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:11,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:21:11,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126894099] [2024-10-11 03:21:11,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:11,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:21:11,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:11,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:21:11,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:21:11,512 INFO L87 Difference]: Start difference. First operand 120 states and 178 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:11,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:11,652 INFO L93 Difference]: Finished difference Result 580 states and 928 transitions. [2024-10-11 03:21:11,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:21:11,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-11 03:21:11,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:11,657 INFO L225 Difference]: With dead ends: 580 [2024-10-11 03:21:11,657 INFO L226 Difference]: Without dead ends: 488 [2024-10-11 03:21:11,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:21:11,659 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 653 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:11,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 590 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:21:11,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-10-11 03:21:11,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 210. [2024-10-11 03:21:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.5454545454545454) internal successors, (323), 209 states have internal predecessors, (323), 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:21:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 323 transitions. [2024-10-11 03:21:11,696 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 323 transitions. Word has length 49 [2024-10-11 03:21:11,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:11,696 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 323 transitions. [2024-10-11 03:21:11,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:11,696 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 323 transitions. [2024-10-11 03:21:11,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:21:11,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:11,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:11,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:21:11,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:11,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:11,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2044342744, now seen corresponding path program 1 times [2024-10-11 03:21:11,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:11,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239574999] [2024-10-11 03:21:11,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:11,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:11,885 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:21:11,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:11,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239574999] [2024-10-11 03:21:11,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239574999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:11,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:11,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:21:11,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153310197] [2024-10-11 03:21:11,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:11,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:21:11,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:11,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:21:11,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:21:11,887 INFO L87 Difference]: Start difference. First operand 210 states and 323 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:11,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:11,925 INFO L93 Difference]: Finished difference Result 220 states and 336 transitions. [2024-10-11 03:21:11,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:21:11,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 03:21:11,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:11,927 INFO L225 Difference]: With dead ends: 220 [2024-10-11 03:21:11,927 INFO L226 Difference]: Without dead ends: 218 [2024-10-11 03:21:11,928 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:21:11,929 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:11,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 314 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:11,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-11 03:21:11,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-10-11 03:21:11,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.5253456221198156) internal successors, (331), 217 states have internal predecessors, (331), 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:21:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 331 transitions. [2024-10-11 03:21:11,952 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 331 transitions. Word has length 50 [2024-10-11 03:21:11,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:11,952 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 331 transitions. [2024-10-11 03:21:11,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 331 transitions. [2024-10-11 03:21:11,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 03:21:11,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:11,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:11,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:21:11,954 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:11,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:11,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1050914879, now seen corresponding path program 1 times [2024-10-11 03:21:11,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:11,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26405860] [2024-10-11 03:21:11,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:11,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:12,043 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:21:12,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:12,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26405860] [2024-10-11 03:21:12,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26405860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:12,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:12,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:12,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848667074] [2024-10-11 03:21:12,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:12,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:12,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:12,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:12,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:12,046 INFO L87 Difference]: Start difference. First operand 218 states and 331 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:12,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:12,076 INFO L93 Difference]: Finished difference Result 570 states and 889 transitions. [2024-10-11 03:21:12,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:12,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-11 03:21:12,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:12,079 INFO L225 Difference]: With dead ends: 570 [2024-10-11 03:21:12,080 INFO L226 Difference]: Without dead ends: 380 [2024-10-11 03:21:12,083 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:21:12,085 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 51 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 182 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:21:12,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 182 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:12,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-10-11 03:21:12,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 374. [2024-10-11 03:21:12,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 1.5361930294906165) internal successors, (573), 373 states have internal predecessors, (573), 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:21:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 573 transitions. [2024-10-11 03:21:12,104 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 573 transitions. Word has length 51 [2024-10-11 03:21:12,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:12,104 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 573 transitions. [2024-10-11 03:21:12,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:12,105 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 573 transitions. [2024-10-11 03:21:12,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:21:12,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:12,106 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] [2024-10-11 03:21:12,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:21:12,107 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:12,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:12,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2005837455, now seen corresponding path program 1 times [2024-10-11 03:21:12,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:12,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960291640] [2024-10-11 03:21:12,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:12,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:12,204 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:21:12,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:12,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960291640] [2024-10-11 03:21:12,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960291640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:12,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:12,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:12,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572490130] [2024-10-11 03:21:12,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:12,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:12,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:12,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:12,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:12,208 INFO L87 Difference]: Start difference. First operand 374 states and 573 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:21:12,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:12,248 INFO L93 Difference]: Finished difference Result 1002 states and 1551 transitions. [2024-10-11 03:21:12,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:12,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2024-10-11 03:21:12,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:12,252 INFO L225 Difference]: With dead ends: 1002 [2024-10-11 03:21:12,252 INFO L226 Difference]: Without dead ends: 656 [2024-10-11 03:21:12,254 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:21:12,255 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 63 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:12,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 223 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:12,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-10-11 03:21:12,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 654. [2024-10-11 03:21:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 653 states have (on average 1.5267993874425727) internal successors, (997), 653 states have internal predecessors, (997), 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:21:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 997 transitions. [2024-10-11 03:21:12,282 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 997 transitions. Word has length 52 [2024-10-11 03:21:12,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:12,282 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 997 transitions. [2024-10-11 03:21:12,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:21:12,283 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 997 transitions. [2024-10-11 03:21:12,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:21:12,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:12,285 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] [2024-10-11 03:21:12,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:21:12,285 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:12,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:12,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1823510447, now seen corresponding path program 1 times [2024-10-11 03:21:12,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:12,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396791601] [2024-10-11 03:21:12,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:12,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:12,354 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:21:12,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:12,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396791601] [2024-10-11 03:21:12,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396791601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:12,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:12,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:12,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872459653] [2024-10-11 03:21:12,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:12,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:12,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:12,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:12,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:12,357 INFO L87 Difference]: Start difference. First operand 654 states and 997 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:21:12,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:12,403 INFO L93 Difference]: Finished difference Result 1778 states and 2711 transitions. [2024-10-11 03:21:12,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:12,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2024-10-11 03:21:12,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:12,411 INFO L225 Difference]: With dead ends: 1778 [2024-10-11 03:21:12,411 INFO L226 Difference]: Without dead ends: 1152 [2024-10-11 03:21:12,412 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:21:12,414 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 67 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:12,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 236 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:12,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2024-10-11 03:21:12,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1150. [2024-10-11 03:21:12,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1149 states have (on average 1.5013054830287207) internal successors, (1725), 1149 states have internal predecessors, (1725), 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:21:12,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1725 transitions. [2024-10-11 03:21:12,461 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1725 transitions. Word has length 52 [2024-10-11 03:21:12,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:12,463 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1725 transitions. [2024-10-11 03:21:12,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:21:12,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1725 transitions. [2024-10-11 03:21:12,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:21:12,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:12,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:12,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:21:12,465 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:12,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:12,465 INFO L85 PathProgramCache]: Analyzing trace with hash 484386469, now seen corresponding path program 1 times [2024-10-11 03:21:12,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:12,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235790345] [2024-10-11 03:21:12,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:12,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:12,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:21:12,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:12,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235790345] [2024-10-11 03:21:12,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235790345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:12,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:12,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:12,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856011734] [2024-10-11 03:21:12,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:12,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:12,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:12,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:12,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:12,547 INFO L87 Difference]: Start difference. First operand 1150 states and 1725 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:12,604 INFO L93 Difference]: Finished difference Result 2245 states and 3395 transitions. [2024-10-11 03:21:12,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:12,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-11 03:21:12,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:12,612 INFO L225 Difference]: With dead ends: 2245 [2024-10-11 03:21:12,612 INFO L226 Difference]: Without dead ends: 1618 [2024-10-11 03:21:12,613 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:21:12,616 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 68 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:12,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 245 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2024-10-11 03:21:12,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1616. [2024-10-11 03:21:12,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1615 states have (on average 1.4904024767801858) internal successors, (2407), 1615 states have internal predecessors, (2407), 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:21:12,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2407 transitions. [2024-10-11 03:21:12,671 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2407 transitions. Word has length 53 [2024-10-11 03:21:12,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:12,671 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2407 transitions. [2024-10-11 03:21:12,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:12,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2407 transitions. [2024-10-11 03:21:12,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:21:12,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:12,673 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] [2024-10-11 03:21:12,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:21:12,674 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:12,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:12,674 INFO L85 PathProgramCache]: Analyzing trace with hash -573145706, now seen corresponding path program 1 times [2024-10-11 03:21:12,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:12,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393776201] [2024-10-11 03:21:12,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:12,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:12,861 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:21:12,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:12,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393776201] [2024-10-11 03:21:12,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393776201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:12,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:12,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:21:12,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376846834] [2024-10-11 03:21:12,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:12,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:21:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:12,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:21:12,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:21:12,865 INFO L87 Difference]: Start difference. First operand 1616 states and 2407 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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:21:13,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:13,027 INFO L93 Difference]: Finished difference Result 4554 states and 6888 transitions. [2024-10-11 03:21:13,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:21:13,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 74 [2024-10-11 03:21:13,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:13,041 INFO L225 Difference]: With dead ends: 4554 [2024-10-11 03:21:13,041 INFO L226 Difference]: Without dead ends: 3752 [2024-10-11 03:21:13,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:21:13,044 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 548 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:13,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 581 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:21:13,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2024-10-11 03:21:13,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 2400. [2024-10-11 03:21:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 2399 states have (on average 1.491871613172155) internal successors, (3579), 2399 states have internal predecessors, (3579), 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:21:13,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3579 transitions. [2024-10-11 03:21:13,129 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3579 transitions. Word has length 74 [2024-10-11 03:21:13,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:13,130 INFO L471 AbstractCegarLoop]: Abstraction has 2400 states and 3579 transitions. [2024-10-11 03:21:13,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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:21:13,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3579 transitions. [2024-10-11 03:21:13,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:21:13,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:13,132 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:21:13,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:21:13,132 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:13,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:13,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1433669481, now seen corresponding path program 1 times [2024-10-11 03:21:13,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:13,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856736434] [2024-10-11 03:21:13,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:13,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:13,273 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 03:21:13,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:13,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856736434] [2024-10-11 03:21:13,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856736434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:13,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:13,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:21:13,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856446527] [2024-10-11 03:21:13,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:13,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:21:13,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:13,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:21:13,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:21:13,276 INFO L87 Difference]: Start difference. First operand 2400 states and 3579 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:13,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:13,439 INFO L93 Difference]: Finished difference Result 5338 states and 8060 transitions. [2024-10-11 03:21:13,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:21:13,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-11 03:21:13,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:13,460 INFO L225 Difference]: With dead ends: 5338 [2024-10-11 03:21:13,460 INFO L226 Difference]: Without dead ends: 4536 [2024-10-11 03:21:13,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:21:13,467 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 492 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:13,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 618 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:21:13,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2024-10-11 03:21:13,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 3184. [2024-10-11 03:21:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3184 states, 3183 states have (on average 1.4926170279610431) internal successors, (4751), 3183 states have internal predecessors, (4751), 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:21:13,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 4751 transitions. [2024-10-11 03:21:13,589 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 4751 transitions. Word has length 74 [2024-10-11 03:21:13,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:13,589 INFO L471 AbstractCegarLoop]: Abstraction has 3184 states and 4751 transitions. [2024-10-11 03:21:13,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:13,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 4751 transitions. [2024-10-11 03:21:13,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:21:13,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:13,592 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:21:13,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:21:13,592 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:13,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:13,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1615996489, now seen corresponding path program 1 times [2024-10-11 03:21:13,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:13,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138877612] [2024-10-11 03:21:13,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:13,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:13,724 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 03:21:13,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:13,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138877612] [2024-10-11 03:21:13,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138877612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:13,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:13,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:21:13,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241564518] [2024-10-11 03:21:13,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:13,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:21:13,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:13,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:21:13,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:21:13,727 INFO L87 Difference]: Start difference. First operand 3184 states and 4751 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:13,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:13,929 INFO L93 Difference]: Finished difference Result 6122 states and 9232 transitions. [2024-10-11 03:21:13,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:21:13,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-11 03:21:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:13,950 INFO L225 Difference]: With dead ends: 6122 [2024-10-11 03:21:13,951 INFO L226 Difference]: Without dead ends: 5320 [2024-10-11 03:21:13,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:21:13,957 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 531 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:13,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 626 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:21:13,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2024-10-11 03:21:14,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 3968. [2024-10-11 03:21:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3968 states, 3967 states have (on average 1.4930678094277792) internal successors, (5923), 3967 states have internal predecessors, (5923), 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:21:14,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 5923 transitions. [2024-10-11 03:21:14,099 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 5923 transitions. Word has length 74 [2024-10-11 03:21:14,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:14,100 INFO L471 AbstractCegarLoop]: Abstraction has 3968 states and 5923 transitions. [2024-10-11 03:21:14,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 5923 transitions. [2024-10-11 03:21:14,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 03:21:14,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:14,102 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:21:14,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:21:14,103 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:14,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:14,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2003246849, now seen corresponding path program 1 times [2024-10-11 03:21:14,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:14,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063728968] [2024-10-11 03:21:14,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:14,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:14,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:14,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063728968] [2024-10-11 03:21:14,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063728968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:14,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:14,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:14,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121950523] [2024-10-11 03:21:14,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:14,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:14,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:14,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:14,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:14,240 INFO L87 Difference]: Start difference. First operand 3968 states and 5923 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:21:14,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:14,366 INFO L93 Difference]: Finished difference Result 7908 states and 11817 transitions. [2024-10-11 03:21:14,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:14,367 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:21:14,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:14,381 INFO L225 Difference]: With dead ends: 7908 [2024-10-11 03:21:14,381 INFO L226 Difference]: Without dead ends: 3970 [2024-10-11 03:21:14,387 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:21:14,388 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 55 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:14,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 236 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:14,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3970 states. [2024-10-11 03:21:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3970 to 3968. [2024-10-11 03:21:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3968 states, 3967 states have (on average 1.4779430299974792) internal successors, (5863), 3967 states have internal predecessors, (5863), 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:21:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 5863 transitions. [2024-10-11 03:21:14,510 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 5863 transitions. Word has length 75 [2024-10-11 03:21:14,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:14,510 INFO L471 AbstractCegarLoop]: Abstraction has 3968 states and 5863 transitions. [2024-10-11 03:21:14,511 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:21:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 5863 transitions. [2024-10-11 03:21:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 03:21:14,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:14,512 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:14,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:21:14,513 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:14,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:14,513 INFO L85 PathProgramCache]: Analyzing trace with hash 120108448, now seen corresponding path program 1 times [2024-10-11 03:21:14,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:14,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342295450] [2024-10-11 03:21:14,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:14,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:14,617 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:14,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:14,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342295450] [2024-10-11 03:21:14,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342295450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:14,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:14,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:14,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694257515] [2024-10-11 03:21:14,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:14,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:14,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:14,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:14,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:14,620 INFO L87 Difference]: Start difference. First operand 3968 states and 5863 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:21:14,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:14,713 INFO L93 Difference]: Finished difference Result 5940 states and 8781 transitions. [2024-10-11 03:21:14,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:14,713 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:21:14,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:14,726 INFO L225 Difference]: With dead ends: 5940 [2024-10-11 03:21:14,727 INFO L226 Difference]: Without dead ends: 2002 [2024-10-11 03:21:14,734 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:21:14,736 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 49 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:14,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 217 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:14,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2024-10-11 03:21:14,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 2000. [2024-10-11 03:21:14,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1999 states have (on average 1.4592296148074038) internal successors, (2917), 1999 states have internal predecessors, (2917), 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:21:14,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2917 transitions. [2024-10-11 03:21:14,799 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2917 transitions. Word has length 75 [2024-10-11 03:21:14,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:14,799 INFO L471 AbstractCegarLoop]: Abstraction has 2000 states and 2917 transitions. [2024-10-11 03:21:14,800 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:21:14,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2917 transitions. [2024-10-11 03:21:14,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 03:21:14,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:14,801 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:14,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:21:14,801 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:14,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:14,802 INFO L85 PathProgramCache]: Analyzing trace with hash 626393793, now seen corresponding path program 1 times [2024-10-11 03:21:14,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:14,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121389733] [2024-10-11 03:21:14,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:14,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:17,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:17,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121389733] [2024-10-11 03:21:17,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121389733] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:21:17,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848692985] [2024-10-11 03:21:17,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:17,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:21:17,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:21:17,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:21:17,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:21:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:17,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 03:21:17,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:21:17,924 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:17,924 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:21:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:18,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848692985] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:21:18,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:21:18,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25 [2024-10-11 03:21:18,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263074969] [2024-10-11 03:21:18,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:21:18,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 03:21:18,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:18,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 03:21:18,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:21:18,503 INFO L87 Difference]: Start difference. First operand 2000 states and 2917 transitions. Second operand has 25 states, 25 states have (on average 8.68) internal successors, (217), 25 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:31,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:31,811 INFO L93 Difference]: Finished difference Result 18945 states and 27249 transitions. [2024-10-11 03:21:31,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2024-10-11 03:21:31,813 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.68) internal successors, (217), 25 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-11 03:21:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:31,866 INFO L225 Difference]: With dead ends: 18945 [2024-10-11 03:21:31,866 INFO L226 Difference]: Without dead ends: 16975 [2024-10-11 03:21:31,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11112 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=4390, Invalid=22670, Unknown=0, NotChecked=0, Total=27060 [2024-10-11 03:21:31,881 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 6710 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6710 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:31,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6710 Valid, 1198 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 1643 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 03:21:31,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16975 states. [2024-10-11 03:21:32,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16975 to 15023. [2024-10-11 03:21:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15023 states, 15022 states have (on average 1.4197843163360404) internal successors, (21328), 15022 states have internal predecessors, (21328), 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:21:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 21328 transitions. [2024-10-11 03:21:32,561 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 21328 transitions. Word has length 75 [2024-10-11 03:21:32,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:32,561 INFO L471 AbstractCegarLoop]: Abstraction has 15023 states and 21328 transitions. [2024-10-11 03:21:32,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.68) internal successors, (217), 25 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 21328 transitions. [2024-10-11 03:21:32,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 03:21:32,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:32,563 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:32,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 03:21:32,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 03:21:32,764 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:32,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:32,765 INFO L85 PathProgramCache]: Analyzing trace with hash 2112085428, now seen corresponding path program 1 times [2024-10-11 03:21:32,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:32,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365246157] [2024-10-11 03:21:32,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:32,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:32,970 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:21:32,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:32,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365246157] [2024-10-11 03:21:32,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365246157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:32,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:32,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:21:32,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267696326] [2024-10-11 03:21:32,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:32,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:21:32,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:32,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:21:32,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:21:32,973 INFO L87 Difference]: Start difference. First operand 15023 states and 21328 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 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:21:33,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:33,616 INFO L93 Difference]: Finished difference Result 27223 states and 39020 transitions. [2024-10-11 03:21:33,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:21:33,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 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 76 [2024-10-11 03:21:33,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:33,672 INFO L225 Difference]: With dead ends: 27223 [2024-10-11 03:21:33,673 INFO L226 Difference]: Without dead ends: 24157 [2024-10-11 03:21:33,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:21:33,683 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 456 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:33,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 626 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:33,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24157 states. [2024-10-11 03:21:34,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24157 to 18008. [2024-10-11 03:21:34,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18008 states, 18007 states have (on average 1.4187260509801745) internal successors, (25547), 18007 states have internal predecessors, (25547), 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:21:34,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18008 states to 18008 states and 25547 transitions. [2024-10-11 03:21:34,347 INFO L78 Accepts]: Start accepts. Automaton has 18008 states and 25547 transitions. Word has length 76 [2024-10-11 03:21:34,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:34,348 INFO L471 AbstractCegarLoop]: Abstraction has 18008 states and 25547 transitions. [2024-10-11 03:21:34,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 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:21:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 18008 states and 25547 transitions. [2024-10-11 03:21:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 03:21:34,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:34,350 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:34,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:21:34,351 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:34,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:34,351 INFO L85 PathProgramCache]: Analyzing trace with hash 464528149, now seen corresponding path program 1 times [2024-10-11 03:21:34,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:34,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087733047] [2024-10-11 03:21:34,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:34,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:35,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:35,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087733047] [2024-10-11 03:21:35,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087733047] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:21:35,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231670770] [2024-10-11 03:21:35,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:35,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:21:35,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:21:35,017 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:21:35,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:21:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:35,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 03:21:35,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:21:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:35,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:21:36,336 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:36,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231670770] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:21:36,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:21:36,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-10-11 03:21:36,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477449964] [2024-10-11 03:21:36,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:21:36,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 03:21:36,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:36,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 03:21:36,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-10-11 03:21:36,340 INFO L87 Difference]: Start difference. First operand 18008 states and 25547 transitions. Second operand has 19 states, 19 states have (on average 8.894736842105264) internal successors, (169), 18 states have internal predecessors, (169), 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:21:37,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:37,931 INFO L93 Difference]: Finished difference Result 86593 states and 123850 transitions. [2024-10-11 03:21:37,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:21:37,931 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.894736842105264) internal successors, (169), 18 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-11 03:21:37,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:38,064 INFO L225 Difference]: With dead ends: 86593 [2024-10-11 03:21:38,065 INFO L226 Difference]: Without dead ends: 68874 [2024-10-11 03:21:38,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=845, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 03:21:38,102 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1972 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1972 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:38,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1972 Valid, 792 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:21:38,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68874 states. [2024-10-11 03:21:39,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68874 to 43284. [2024-10-11 03:21:40,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43284 states, 43283 states have (on average 1.4062102904142504) internal successors, (60865), 43283 states have internal predecessors, (60865), 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:21:40,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43284 states to 43284 states and 60865 transitions. [2024-10-11 03:21:40,094 INFO L78 Accepts]: Start accepts. Automaton has 43284 states and 60865 transitions. Word has length 79 [2024-10-11 03:21:40,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:40,095 INFO L471 AbstractCegarLoop]: Abstraction has 43284 states and 60865 transitions. [2024-10-11 03:21:40,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.894736842105264) internal successors, (169), 18 states have internal predecessors, (169), 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:21:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 43284 states and 60865 transitions. [2024-10-11 03:21:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 03:21:40,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:40,098 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:40,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:21:40,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 03:21:40,303 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:40,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:40,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2028507625, now seen corresponding path program 1 times [2024-10-11 03:21:40,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:40,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082656433] [2024-10-11 03:21:40,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:40,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:40,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:40,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082656433] [2024-10-11 03:21:40,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082656433] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:21:40,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190856885] [2024-10-11 03:21:40,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:40,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:21:40,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:21:40,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:21:40,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:21:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:40,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 03:21:40,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:21:41,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:41,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:21:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:42,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190856885] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:21:42,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:21:42,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2024-10-11 03:21:42,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300211785] [2024-10-11 03:21:42,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:21:42,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 03:21:42,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:42,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 03:21:42,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2024-10-11 03:21:42,602 INFO L87 Difference]: Start difference. First operand 43284 states and 60865 transitions. Second operand has 29 states, 29 states have (on average 7.482758620689655) internal successors, (217), 28 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:22:00,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:22:00,316 INFO L93 Difference]: Finished difference Result 330368 states and 466499 transitions. [2024-10-11 03:22:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2024-10-11 03:22:00,317 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.482758620689655) internal successors, (217), 28 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-11 03:22:00,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:22:00,909 INFO L225 Difference]: With dead ends: 330368 [2024-10-11 03:22:00,910 INFO L226 Difference]: Without dead ends: 287184 [2024-10-11 03:22:01,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15552 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=6117, Invalid=33683, Unknown=0, NotChecked=0, Total=39800 [2024-10-11 03:22:01,007 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 7708 mSDsluCounter, 2390 mSDsCounter, 0 mSdLazyCounter, 3522 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7708 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 3613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 3522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:22:01,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7708 Valid, 2569 Invalid, 3613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 3522 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 03:22:01,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287184 states. [2024-10-11 03:22:08,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287184 to 161701. [2024-10-11 03:22:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161701 states, 161700 states have (on average 1.3799443413729129) internal successors, (223137), 161700 states have internal predecessors, (223137), 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:22:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161701 states to 161701 states and 223137 transitions. [2024-10-11 03:22:08,593 INFO L78 Accepts]: Start accepts. Automaton has 161701 states and 223137 transitions. Word has length 79 [2024-10-11 03:22:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:22:08,594 INFO L471 AbstractCegarLoop]: Abstraction has 161701 states and 223137 transitions. [2024-10-11 03:22:08,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.482758620689655) internal successors, (217), 28 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:22:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 161701 states and 223137 transitions. [2024-10-11 03:22:08,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 03:22:08,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:08,597 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:22:08,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 03:22:08,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:22:08,798 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:08,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:08,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1469807257, now seen corresponding path program 1 times [2024-10-11 03:22:08,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:08,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92491707] [2024-10-11 03:22:08,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:08,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:22:08,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:08,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92491707] [2024-10-11 03:22:08,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92491707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:22:08,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:22:08,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:22:08,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742202247] [2024-10-11 03:22:08,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:22:08,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:22:08,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:22:08,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:22:08,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:22:08,848 INFO L87 Difference]: Start difference. First operand 161701 states and 223137 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:22:17,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:22:17,531 INFO L93 Difference]: Finished difference Result 450621 states and 619235 transitions. [2024-10-11 03:22:17,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:22:17,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 80 [2024-10-11 03:22:17,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:22:18,021 INFO L225 Difference]: With dead ends: 450621 [2024-10-11 03:22:18,022 INFO L226 Difference]: Without dead ends: 289609 [2024-10-11 03:22:18,157 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:22:18,158 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 51 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:22:18,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 226 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:22:18,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289609 states.