./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8c73977f942e89d9992bb22ca052cbbbf488baa4bd312066f1673eed7b40e630 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:43:46,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:43:46,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:43:46,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:43:46,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:43:46,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:43:46,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:43:46,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:43:46,754 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:43:46,754 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:43:46,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:43:46,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:43:46,756 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:43:46,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:43:46,756 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:43:46,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:43:46,757 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:43:46,757 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:43:46,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:43:46,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:43:46,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:43:46,759 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:43:46,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:43:46,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:43:46,760 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:43:46,760 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:43:46,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:43:46,761 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:43:46,761 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:43:46,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:43:46,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:43:46,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:43:46,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:43:46,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:43:46,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:43:46,764 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:43:46,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:43:46,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:43:46,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:43:46,769 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:43:46,769 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:43:46,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:43:46,770 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8c73977f942e89d9992bb22ca052cbbbf488baa4bd312066f1673eed7b40e630 [2024-10-24 01:43:47,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:43:47,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:43:47,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:43:47,053 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:43:47,053 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:43:47,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-24 01:43:48,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:43:48,691 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:43:48,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-24 01:43:48,707 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7114f9ee9/7ef645374c4244a690dca5414a68f135/FLAGd8ce523a7 [2024-10-24 01:43:48,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7114f9ee9/7ef645374c4244a690dca5414a68f135 [2024-10-24 01:43:48,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:43:48,722 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:43:48,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:43:48,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:43:48,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:43:48,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:43:48" (1/1) ... [2024-10-24 01:43:48,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f2c53fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:43:48, skipping insertion in model container [2024-10-24 01:43:48,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:43:48" (1/1) ... [2024-10-24 01:43:48,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:43:48,999 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6358,6371] [2024-10-24 01:43:49,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:43:49,064 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:43:49,100 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6358,6371] [2024-10-24 01:43:49,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:43:49,153 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:43:49,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:43:49 WrapperNode [2024-10-24 01:43:49,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:43:49,155 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:43:49,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:43:49,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:43:49,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:43:49" (1/1) ... [2024-10-24 01:43:49,173 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:43:49" (1/1) ... [2024-10-24 01:43:49,221 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 573 [2024-10-24 01:43:49,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:43:49,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:43:49,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:43:49,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:43:49,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:43:49" (1/1) ... [2024-10-24 01:43:49,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:43:49" (1/1) ... [2024-10-24 01:43:49,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:43:49" (1/1) ... [2024-10-24 01:43:49,274 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-24 01:43:49,274 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:43:49" (1/1) ... [2024-10-24 01:43:49,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:43:49" (1/1) ... [2024-10-24 01:43:49,284 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:43:49" (1/1) ... [2024-10-24 01:43:49,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:43:49" (1/1) ... [2024-10-24 01:43:49,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:43:49" (1/1) ... [2024-10-24 01:43:49,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:43:49" (1/1) ... [2024-10-24 01:43:49,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:43:49,301 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:43:49,301 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:43:49,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:43:49,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:43:49" (1/1) ... [2024-10-24 01:43:49,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:43:49,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:43:49,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 01:43:49,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 01:43:49,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:43:49,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:43:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:43:49,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:43:49,544 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:43:49,546 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:43:50,153 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-10-24 01:43:50,154 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:43:50,199 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:43:50,199 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 01:43:50,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:43:50 BoogieIcfgContainer [2024-10-24 01:43:50,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:43:50,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:43:50,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:43:50,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:43:50,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:43:48" (1/3) ... [2024-10-24 01:43:50,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48870ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:43:50, skipping insertion in model container [2024-10-24 01:43:50,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:43:49" (2/3) ... [2024-10-24 01:43:50,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48870ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:43:50, skipping insertion in model container [2024-10-24 01:43:50,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:43:50" (3/3) ... [2024-10-24 01:43:50,215 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-24 01:43:50,232 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:43:50,233 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:43:50,305 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:43:50,313 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;@79e91c30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:43:50,313 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:43:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.7014925373134329) internal successors, (228), 135 states have internal predecessors, (228), 0 states have call successors, (0), 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-24 01:43:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 01:43:50,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:43:50,331 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:43:50,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:43:50,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:43:50,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1132032002, now seen corresponding path program 1 times [2024-10-24 01:43:50,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:43:50,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436598621] [2024-10-24 01:43:50,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:43:50,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:43:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:43:50,838 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-24 01:43:50,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:43:50,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436598621] [2024-10-24 01:43:50,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436598621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:43:50,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:43:50,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:43:50,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755437284] [2024-10-24 01:43:50,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:43:50,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:43:50,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:43:50,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:43:50,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:43:50,882 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.7014925373134329) internal successors, (228), 135 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-24 01:43:50,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:43:50,961 INFO L93 Difference]: Finished difference Result 324 states and 524 transitions. [2024-10-24 01:43:50,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:43:50,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-24 01:43:50,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:43:50,975 INFO L225 Difference]: With dead ends: 324 [2024-10-24 01:43:50,976 INFO L226 Difference]: Without dead ends: 218 [2024-10-24 01:43:50,979 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-24 01:43:50,985 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 166 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 479 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-24 01:43:50,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 479 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:43:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-24 01:43:51,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2024-10-24 01:43:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.5069767441860464) internal successors, (324), 215 states have internal predecessors, (324), 0 states have call successors, (0), 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-24 01:43:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 324 transitions. [2024-10-24 01:43:51,042 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 324 transitions. Word has length 60 [2024-10-24 01:43:51,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:43:51,042 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 324 transitions. [2024-10-24 01:43:51,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-24 01:43:51,043 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 324 transitions. [2024-10-24 01:43:51,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-24 01:43:51,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:43:51,046 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:43:51,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:43:51,046 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:43:51,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:43:51,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1725262461, now seen corresponding path program 1 times [2024-10-24 01:43:51,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:43:51,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892916171] [2024-10-24 01:43:51,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:43:51,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:43:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:43:51,188 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-24 01:43:51,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:43:51,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892916171] [2024-10-24 01:43:51,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892916171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:43:51,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:43:51,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:43:51,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262946088] [2024-10-24 01:43:51,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:43:51,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:43:51,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:43:51,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:43:51,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:43:51,192 INFO L87 Difference]: Start difference. First operand 216 states and 324 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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-24 01:43:51,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:43:51,248 INFO L93 Difference]: Finished difference Result 548 states and 852 transitions. [2024-10-24 01:43:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:43:51,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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 61 [2024-10-24 01:43:51,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:43:51,253 INFO L225 Difference]: With dead ends: 548 [2024-10-24 01:43:51,254 INFO L226 Difference]: Without dead ends: 366 [2024-10-24 01:43:51,258 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-24 01:43:51,260 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 137 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:43:51,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 422 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:43:51,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-24 01:43:51,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2024-10-24 01:43:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 1.5399449035812671) internal successors, (559), 363 states have internal predecessors, (559), 0 states have call successors, (0), 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-24 01:43:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 559 transitions. [2024-10-24 01:43:51,295 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 559 transitions. Word has length 61 [2024-10-24 01:43:51,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:43:51,295 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 559 transitions. [2024-10-24 01:43:51,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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-24 01:43:51,295 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 559 transitions. [2024-10-24 01:43:51,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-24 01:43:51,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:43:51,299 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:43:51,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:43:51,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:43:51,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:43:51,299 INFO L85 PathProgramCache]: Analyzing trace with hash -696211435, now seen corresponding path program 1 times [2024-10-24 01:43:51,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:43:51,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650588318] [2024-10-24 01:43:51,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:43:51,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:43:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:43:51,442 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-24 01:43:51,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:43:51,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650588318] [2024-10-24 01:43:51,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650588318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:43:51,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:43:51,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:43:51,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594998223] [2024-10-24 01:43:51,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:43:51,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:43:51,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:43:51,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:43:51,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:43:51,445 INFO L87 Difference]: Start difference. First operand 364 states and 559 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-24 01:43:51,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:43:51,476 INFO L93 Difference]: Finished difference Result 960 states and 1505 transitions. [2024-10-24 01:43:51,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:43:51,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-24 01:43:51,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:43:51,481 INFO L225 Difference]: With dead ends: 960 [2024-10-24 01:43:51,481 INFO L226 Difference]: Without dead ends: 630 [2024-10-24 01:43:51,483 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-24 01:43:51,484 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 132 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:43:51,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 407 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:43:51,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-10-24 01:43:51,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 628. [2024-10-24 01:43:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.555023923444976) internal successors, (975), 627 states have internal predecessors, (975), 0 states have call successors, (0), 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-24 01:43:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 975 transitions. [2024-10-24 01:43:51,518 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 975 transitions. Word has length 62 [2024-10-24 01:43:51,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:43:51,519 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 975 transitions. [2024-10-24 01:43:51,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-24 01:43:51,519 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 975 transitions. [2024-10-24 01:43:51,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 01:43:51,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:43:51,521 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:43:51,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:43:51,522 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:43:51,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:43:51,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1789306726, now seen corresponding path program 1 times [2024-10-24 01:43:51,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:43:51,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507584699] [2024-10-24 01:43:51,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:43:51,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:43:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:43:51,623 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-24 01:43:51,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:43:51,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507584699] [2024-10-24 01:43:51,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507584699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:43:51,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:43:51,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:43:51,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363543064] [2024-10-24 01:43:51,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:43:51,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:43:51,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:43:51,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:43:51,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:43:51,629 INFO L87 Difference]: Start difference. First operand 628 states and 975 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:43:51,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:43:51,658 INFO L93 Difference]: Finished difference Result 1688 states and 2649 transitions. [2024-10-24 01:43:51,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:43:51,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-24 01:43:51,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:43:51,664 INFO L225 Difference]: With dead ends: 1688 [2024-10-24 01:43:51,664 INFO L226 Difference]: Without dead ends: 1094 [2024-10-24 01:43:51,665 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-24 01:43:51,669 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 127 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:43:51,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 392 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:43:51,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2024-10-24 01:43:51,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1092. [2024-10-24 01:43:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1091 states have (on average 1.5572868927589367) internal successors, (1699), 1091 states have internal predecessors, (1699), 0 states have call successors, (0), 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-24 01:43:51,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1699 transitions. [2024-10-24 01:43:51,702 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1699 transitions. Word has length 63 [2024-10-24 01:43:51,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:43:51,702 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1699 transitions. [2024-10-24 01:43:51,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:43:51,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1699 transitions. [2024-10-24 01:43:51,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 01:43:51,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:43:51,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:43:51,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:43:51,708 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:43:51,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:43:51,708 INFO L85 PathProgramCache]: Analyzing trace with hash 125702204, now seen corresponding path program 1 times [2024-10-24 01:43:51,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:43:51,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704966427] [2024-10-24 01:43:51,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:43:51,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:43:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:43:51,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:43:51,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:43:51,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704966427] [2024-10-24 01:43:51,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704966427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:43:51,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:43:51,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:43:51,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020003311] [2024-10-24 01:43:51,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:43:51,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:43:51,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:43:51,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:43:51,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:43:51,934 INFO L87 Difference]: Start difference. First operand 1092 states and 1699 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:43:52,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:43:52,136 INFO L93 Difference]: Finished difference Result 7440 states and 11689 transitions. [2024-10-24 01:43:52,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:43:52,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-24 01:43:52,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:43:52,176 INFO L225 Difference]: With dead ends: 7440 [2024-10-24 01:43:52,177 INFO L226 Difference]: Without dead ends: 6382 [2024-10-24 01:43:52,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:43:52,181 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 1477 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 2339 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:43:52,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 2339 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:43:52,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6382 states. [2024-10-24 01:43:52,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6382 to 2148. [2024-10-24 01:43:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2148 states, 2147 states have (on average 1.551467163483931) internal successors, (3331), 2147 states have internal predecessors, (3331), 0 states have call successors, (0), 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-24 01:43:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 3331 transitions. [2024-10-24 01:43:52,257 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 3331 transitions. Word has length 64 [2024-10-24 01:43:52,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:43:52,257 INFO L471 AbstractCegarLoop]: Abstraction has 2148 states and 3331 transitions. [2024-10-24 01:43:52,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:43:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 3331 transitions. [2024-10-24 01:43:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 01:43:52,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:43:52,259 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:43:52,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:43:52,259 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:43:52,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:43:52,260 INFO L85 PathProgramCache]: Analyzing trace with hash -417655209, now seen corresponding path program 1 times [2024-10-24 01:43:52,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:43:52,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378751484] [2024-10-24 01:43:52,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:43:52,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:43:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:43:52,523 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-24 01:43:52,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:43:52,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378751484] [2024-10-24 01:43:52,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378751484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:43:52,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:43:52,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:43:52,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243194399] [2024-10-24 01:43:52,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:43:52,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:43:52,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:43:52,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:43:52,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:43:52,526 INFO L87 Difference]: Start difference. First operand 2148 states and 3331 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-24 01:43:52,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:43:52,681 INFO L93 Difference]: Finished difference Result 11278 states and 17448 transitions. [2024-10-24 01:43:52,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:43:52,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-24 01:43:52,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:43:52,715 INFO L225 Difference]: With dead ends: 11278 [2024-10-24 01:43:52,717 INFO L226 Difference]: Without dead ends: 9164 [2024-10-24 01:43:52,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:43:52,726 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 781 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:43:52,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 960 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:43:52,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9164 states. [2024-10-24 01:43:52,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9164 to 9156. [2024-10-24 01:43:52,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9156 states, 9155 states have (on average 1.5417804478427088) internal successors, (14115), 9155 states have internal predecessors, (14115), 0 states have call successors, (0), 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-24 01:43:52,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9156 states to 9156 states and 14115 transitions. [2024-10-24 01:43:52,950 INFO L78 Accepts]: Start accepts. Automaton has 9156 states and 14115 transitions. Word has length 65 [2024-10-24 01:43:52,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:43:52,950 INFO L471 AbstractCegarLoop]: Abstraction has 9156 states and 14115 transitions. [2024-10-24 01:43:52,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-24 01:43:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand 9156 states and 14115 transitions. [2024-10-24 01:43:52,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 01:43:52,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:43:52,953 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:43:52,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:43:52,953 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:43:52,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:43:52,953 INFO L85 PathProgramCache]: Analyzing trace with hash 650635450, now seen corresponding path program 1 times [2024-10-24 01:43:52,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:43:52,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822244265] [2024-10-24 01:43:52,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:43:52,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:43:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:43:53,035 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-24 01:43:53,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:43:53,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822244265] [2024-10-24 01:43:53,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822244265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:43:53,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:43:53,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:43:53,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507666668] [2024-10-24 01:43:53,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:43:53,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:43:53,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:43:53,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:43:53,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:43:53,038 INFO L87 Difference]: Start difference. First operand 9156 states and 14115 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-24 01:43:53,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:43:53,134 INFO L93 Difference]: Finished difference Result 24680 states and 37893 transitions. [2024-10-24 01:43:53,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:43:53,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-24 01:43:53,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:43:53,204 INFO L225 Difference]: With dead ends: 24680 [2024-10-24 01:43:53,204 INFO L226 Difference]: Without dead ends: 15558 [2024-10-24 01:43:53,222 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-24 01:43:53,224 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 144 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:43:53,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 462 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:43:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15558 states. [2024-10-24 01:43:53,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15558 to 15556. [2024-10-24 01:43:53,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15556 states, 15555 states have (on average 1.520475731276117) internal successors, (23651), 15555 states have internal predecessors, (23651), 0 states have call successors, (0), 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-24 01:43:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15556 states to 15556 states and 23651 transitions. [2024-10-24 01:43:53,822 INFO L78 Accepts]: Start accepts. Automaton has 15556 states and 23651 transitions. Word has length 66 [2024-10-24 01:43:53,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:43:53,823 INFO L471 AbstractCegarLoop]: Abstraction has 15556 states and 23651 transitions. [2024-10-24 01:43:53,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-24 01:43:53,823 INFO L276 IsEmpty]: Start isEmpty. Operand 15556 states and 23651 transitions. [2024-10-24 01:43:53,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-24 01:43:53,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:43:53,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:43:53,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:43:53,824 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:43:53,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:43:53,825 INFO L85 PathProgramCache]: Analyzing trace with hash -889607872, now seen corresponding path program 1 times [2024-10-24 01:43:53,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:43:53,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701785306] [2024-10-24 01:43:53,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:43:53,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:43:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:43:53,956 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-24 01:43:53,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:43:53,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701785306] [2024-10-24 01:43:53,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701785306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:43:53,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:43:53,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:43:53,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960347461] [2024-10-24 01:43:53,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:43:53,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:43:53,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:43:53,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:43:53,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:43:53,958 INFO L87 Difference]: Start difference. First operand 15556 states and 23651 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:43:54,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:43:54,387 INFO L93 Difference]: Finished difference Result 46600 states and 70885 transitions. [2024-10-24 01:43:54,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:43:54,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-24 01:43:54,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:43:54,451 INFO L225 Difference]: With dead ends: 46600 [2024-10-24 01:43:54,451 INFO L226 Difference]: Without dead ends: 31078 [2024-10-24 01:43:54,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:43:54,479 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 843 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:43:54,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 216 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:43:54,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31078 states. [2024-10-24 01:43:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31078 to 31076. [2024-10-24 01:43:55,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31076 states, 31075 states have (on average 1.5117940466613033) internal successors, (46979), 31075 states have internal predecessors, (46979), 0 states have call successors, (0), 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-24 01:43:55,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31076 states to 31076 states and 46979 transitions. [2024-10-24 01:43:55,187 INFO L78 Accepts]: Start accepts. Automaton has 31076 states and 46979 transitions. Word has length 67 [2024-10-24 01:43:55,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:43:55,188 INFO L471 AbstractCegarLoop]: Abstraction has 31076 states and 46979 transitions. [2024-10-24 01:43:55,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:43:55,189 INFO L276 IsEmpty]: Start isEmpty. Operand 31076 states and 46979 transitions. [2024-10-24 01:43:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-24 01:43:55,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:43:55,190 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:43:55,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:43:55,190 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:43:55,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:43:55,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2008403493, now seen corresponding path program 1 times [2024-10-24 01:43:55,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:43:55,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634495106] [2024-10-24 01:43:55,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:43:55,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:43:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:43:55,633 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-24 01:43:55,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:43:55,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634495106] [2024-10-24 01:43:55,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634495106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:43:55,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:43:55,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:43:55,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079915657] [2024-10-24 01:43:55,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:43:55,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:43:55,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:43:55,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:43:55,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:43:55,635 INFO L87 Difference]: Start difference. First operand 31076 states and 46979 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:43:55,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:43:55,747 INFO L93 Difference]: Finished difference Result 32358 states and 48900 transitions. [2024-10-24 01:43:55,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:43:55,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-24 01:43:55,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:43:55,802 INFO L225 Difference]: With dead ends: 32358 [2024-10-24 01:43:55,802 INFO L226 Difference]: Without dead ends: 32356 [2024-10-24 01:43:55,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:43:55,820 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:43:55,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 749 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:43:55,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32356 states. [2024-10-24 01:43:56,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32356 to 32356. [2024-10-24 01:43:56,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32356 states, 32355 states have (on average 1.4915469015608098) internal successors, (48259), 32355 states have internal predecessors, (48259), 0 states have call successors, (0), 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-24 01:43:56,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32356 states to 32356 states and 48259 transitions. [2024-10-24 01:43:56,432 INFO L78 Accepts]: Start accepts. Automaton has 32356 states and 48259 transitions. Word has length 67 [2024-10-24 01:43:56,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:43:56,433 INFO L471 AbstractCegarLoop]: Abstraction has 32356 states and 48259 transitions. [2024-10-24 01:43:56,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:43:56,433 INFO L276 IsEmpty]: Start isEmpty. Operand 32356 states and 48259 transitions. [2024-10-24 01:43:56,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 01:43:56,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:43:56,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:43:56,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:43:56,436 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:43:56,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:43:56,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2141539230, now seen corresponding path program 1 times [2024-10-24 01:43:56,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:43:56,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309988426] [2024-10-24 01:43:56,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:43:56,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:43:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:43:56,532 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-24 01:43:56,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:43:56,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309988426] [2024-10-24 01:43:56,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309988426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:43:56,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:43:56,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:43:56,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602287870] [2024-10-24 01:43:56,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:43:56,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:43:56,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:43:56,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:43:56,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:43:56,535 INFO L87 Difference]: Start difference. First operand 32356 states and 48259 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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-24 01:43:56,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:43:56,926 INFO L93 Difference]: Finished difference Result 72282 states and 107623 transitions. [2024-10-24 01:43:56,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:43:56,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-10-24 01:43:56,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:43:56,995 INFO L225 Difference]: With dead ends: 72282 [2024-10-24 01:43:56,995 INFO L226 Difference]: Without dead ends: 39960 [2024-10-24 01:43:57,035 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-24 01:43:57,036 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 114 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:43:57,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 343 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:43:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39960 states. [2024-10-24 01:43:57,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39960 to 39814. [2024-10-24 01:43:57,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39814 states, 39813 states have (on average 1.4810489036244443) internal successors, (58965), 39813 states have internal predecessors, (58965), 0 states have call successors, (0), 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-24 01:43:57,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39814 states to 39814 states and 58965 transitions. [2024-10-24 01:43:57,993 INFO L78 Accepts]: Start accepts. Automaton has 39814 states and 58965 transitions. Word has length 68 [2024-10-24 01:43:57,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:43:57,994 INFO L471 AbstractCegarLoop]: Abstraction has 39814 states and 58965 transitions. [2024-10-24 01:43:57,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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-24 01:43:57,994 INFO L276 IsEmpty]: Start isEmpty. Operand 39814 states and 58965 transitions. [2024-10-24 01:43:58,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 01:43:58,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:43:58,010 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:43:58,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:43:58,010 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:43:58,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:43:58,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1989798597, now seen corresponding path program 1 times [2024-10-24 01:43:58,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:43:58,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200622625] [2024-10-24 01:43:58,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:43:58,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:43:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:43:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:43:58,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:43:58,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200622625] [2024-10-24 01:43:58,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200622625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:43:58,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:43:58,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:43:58,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556863875] [2024-10-24 01:43:58,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:43:58,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:43:58,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:43:58,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:43:58,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:43:58,102 INFO L87 Difference]: Start difference. First operand 39814 states and 58965 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 01:43:58,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:43:58,562 INFO L93 Difference]: Finished difference Result 102667 states and 152217 transitions. [2024-10-24 01:43:58,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:43:58,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-24 01:43:58,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:43:58,690 INFO L225 Difference]: With dead ends: 102667 [2024-10-24 01:43:58,690 INFO L226 Difference]: Without dead ends: 69257 [2024-10-24 01:43:58,718 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-24 01:43:58,719 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 117 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:43:58,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 479 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:43:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69257 states. [2024-10-24 01:43:59,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69257 to 69255. [2024-10-24 01:43:59,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69255 states, 69254 states have (on average 1.470860888901724) internal successors, (101863), 69254 states have internal predecessors, (101863), 0 states have call successors, (0), 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-24 01:43:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69255 states to 69255 states and 101863 transitions. [2024-10-24 01:43:59,861 INFO L78 Accepts]: Start accepts. Automaton has 69255 states and 101863 transitions. Word has length 95 [2024-10-24 01:43:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:43:59,861 INFO L471 AbstractCegarLoop]: Abstraction has 69255 states and 101863 transitions. [2024-10-24 01:43:59,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 01:43:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 69255 states and 101863 transitions. [2024-10-24 01:43:59,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 01:43:59,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:43:59,891 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:43:59,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:43:59,892 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:43:59,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:43:59,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1309326168, now seen corresponding path program 1 times [2024-10-24 01:43:59,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:43:59,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130741125] [2024-10-24 01:43:59,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:43:59,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:43:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:44:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:44:00,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:44:00,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130741125] [2024-10-24 01:44:00,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130741125] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:44:00,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789473319] [2024-10-24 01:44:00,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:44:00,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:44:00,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:44:00,342 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:44:00,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 01:44:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:44:00,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 01:44:00,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:44:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:44:01,303 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:44:02,093 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:44:02,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789473319] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:44:02,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:44:02,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2024-10-24 01:44:02,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12396884] [2024-10-24 01:44:02,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:44:02,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-24 01:44:02,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:44:02,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-24 01:44:02,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-10-24 01:44:02,095 INFO L87 Difference]: Start difference. First operand 69255 states and 101863 transitions. Second operand has 20 states, 20 states have (on average 13.85) internal successors, (277), 20 states have internal predecessors, (277), 0 states have call successors, (0), 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-24 01:44:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:44:13,351 INFO L93 Difference]: Finished difference Result 495257 states and 727187 transitions. [2024-10-24 01:44:13,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2024-10-24 01:44:13,352 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 13.85) internal successors, (277), 20 states have internal predecessors, (277), 0 states have call successors, (0), 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 95 [2024-10-24 01:44:13,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:44:14,000 INFO L225 Difference]: With dead ends: 495257 [2024-10-24 01:44:14,000 INFO L226 Difference]: Without dead ends: 426039 [2024-10-24 01:44:14,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11306 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4248, Invalid=22812, Unknown=0, NotChecked=0, Total=27060 [2024-10-24 01:44:14,145 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 19351 mSDsluCounter, 4401 mSDsCounter, 0 mSdLazyCounter, 4410 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19351 SdHoareTripleChecker+Valid, 4782 SdHoareTripleChecker+Invalid, 4581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 4410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:44:14,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19351 Valid, 4782 Invalid, 4581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 4410 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-24 01:44:14,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426039 states. [2024-10-24 01:44:19,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426039 to 335784. [2024-10-24 01:44:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335784 states, 335783 states have (on average 1.4490280925478658) internal successors, (486559), 335783 states have internal predecessors, (486559), 0 states have call successors, (0), 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-24 01:44:21,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335784 states to 335784 states and 486559 transitions. [2024-10-24 01:44:21,383 INFO L78 Accepts]: Start accepts. Automaton has 335784 states and 486559 transitions. Word has length 95 [2024-10-24 01:44:21,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:44:21,383 INFO L471 AbstractCegarLoop]: Abstraction has 335784 states and 486559 transitions. [2024-10-24 01:44:21,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 13.85) internal successors, (277), 20 states have internal predecessors, (277), 0 states have call successors, (0), 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-24 01:44:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 335784 states and 486559 transitions. [2024-10-24 01:44:21,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 01:44:21,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:44:21,428 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:44:21,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 01:44:21,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-24 01:44:21,629 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:44:21,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:44:21,630 INFO L85 PathProgramCache]: Analyzing trace with hash 559492012, now seen corresponding path program 1 times [2024-10-24 01:44:21,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:44:21,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430537194] [2024-10-24 01:44:21,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:44:21,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:44:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:44:21,716 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-24 01:44:21,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:44:21,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430537194] [2024-10-24 01:44:21,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430537194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:44:21,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:44:21,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:44:21,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992719950] [2024-10-24 01:44:21,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:44:21,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:44:21,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:44:21,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:44:21,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:44:21,720 INFO L87 Difference]: Start difference. First operand 335784 states and 486559 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:44:24,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:44:24,927 INFO L93 Difference]: Finished difference Result 809815 states and 1171868 transitions. [2024-10-24 01:44:24,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:44:24,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-24 01:44:24,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:44:25,880 INFO L225 Difference]: With dead ends: 809815 [2024-10-24 01:44:25,880 INFO L226 Difference]: Without dead ends: 539091 [2024-10-24 01:44:26,031 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-24 01:44:26,032 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 115 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:44:26,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 427 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:44:26,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539091 states. [2024-10-24 01:44:34,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539091 to 539089. [2024-10-24 01:44:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539089 states, 539088 states have (on average 1.4352499035407948) internal successors, (773726), 539088 states have internal predecessors, (773726), 0 states have call successors, (0), 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-24 01:44:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539089 states to 539089 states and 773726 transitions. [2024-10-24 01:44:36,815 INFO L78 Accepts]: Start accepts. Automaton has 539089 states and 773726 transitions. Word has length 96 [2024-10-24 01:44:36,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:44:36,816 INFO L471 AbstractCegarLoop]: Abstraction has 539089 states and 773726 transitions. [2024-10-24 01:44:36,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:44:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 539089 states and 773726 transitions. [2024-10-24 01:44:36,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 01:44:36,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:44:36,876 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:44:36,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:44:36,877 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:44:36,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:44:36,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1284617306, now seen corresponding path program 1 times [2024-10-24 01:44:36,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:44:36,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019566923] [2024-10-24 01:44:36,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:44:36,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:44:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:44:36,957 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-24 01:44:36,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:44:36,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019566923] [2024-10-24 01:44:36,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019566923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:44:36,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:44:36,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:44:36,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060913049] [2024-10-24 01:44:36,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:44:36,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:44:36,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:44:36,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:44:36,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:44:36,959 INFO L87 Difference]: Start difference. First operand 539089 states and 773726 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:44:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:44:39,966 INFO L93 Difference]: Finished difference Result 863192 states and 1237536 transitions. [2024-10-24 01:44:39,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:44:39,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-24 01:44:39,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:44:40,998 INFO L225 Difference]: With dead ends: 863192 [2024-10-24 01:44:40,998 INFO L226 Difference]: Without dead ends: 539091