./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.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a7994e4b0bfbe275d233e5a25c7b22888e2d55ba388328f1fc4435f77ac9412d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:39:57,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:39:57,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:39:57,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:39:57,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:39:58,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:39:58,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:39:58,027 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:39:58,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:39:58,028 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:39:58,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:39:58,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:39:58,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:39:58,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:39:58,033 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:39:58,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:39:58,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:39:58,034 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:39:58,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:39:58,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:39:58,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:39:58,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:39:58,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:39:58,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:39:58,039 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:39:58,039 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:39:58,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:39:58,039 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:39:58,040 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:39:58,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:39:58,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:39:58,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:39:58,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:39:58,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:39:58,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:39:58,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:39:58,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:39:58,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:39:58,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:39:58,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:39:58,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:39:58,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:39:58,044 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7994e4b0bfbe275d233e5a25c7b22888e2d55ba388328f1fc4435f77ac9412d [2024-10-11 03:39:58,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:39:58,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:39:58,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:39:58,327 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:39:58,327 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:39:58,328 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.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-11 03:39:59,809 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:40:00,031 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:40:00,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-11 03:40:00,046 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2ab65e261/9bfe132434b948b982f8a7257098029b/FLAGf75420e15 [2024-10-11 03:40:00,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2ab65e261/9bfe132434b948b982f8a7257098029b [2024-10-11 03:40:00,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:40:00,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:40:00,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:40:00,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:40:00,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:40:00,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:40:00" (1/1) ... [2024-10-11 03:40:00,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@588d0293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:00, skipping insertion in model container [2024-10-11 03:40:00,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:40:00" (1/1) ... [2024-10-11 03:40:00,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:40:00,309 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.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4409,4422] [2024-10-11 03:40:00,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:40:00,351 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:40:00,386 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.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4409,4422] [2024-10-11 03:40:00,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:40:00,423 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:40:00,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:00 WrapperNode [2024-10-11 03:40:00,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:40:00,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:40:00,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:40:00,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:40:00,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:00" (1/1) ... [2024-10-11 03:40:00,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:00" (1/1) ... [2024-10-11 03:40:00,481 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 361 [2024-10-11 03:40:00,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:40:00,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:40:00,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:40:00,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:40:00,498 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:00" (1/1) ... [2024-10-11 03:40:00,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:00" (1/1) ... [2024-10-11 03:40:00,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:00" (1/1) ... [2024-10-11 03:40:00,538 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:40:00,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:00" (1/1) ... [2024-10-11 03:40:00,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:00" (1/1) ... [2024-10-11 03:40:00,549 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:00" (1/1) ... [2024-10-11 03:40:00,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:00" (1/1) ... [2024-10-11 03:40:00,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:00" (1/1) ... [2024-10-11 03:40:00,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:00" (1/1) ... [2024-10-11 03:40:00,576 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:40:00,592 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:40:00,594 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:40:00,594 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:40:00,595 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:00" (1/1) ... [2024-10-11 03:40:00,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:40:00,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:40:00,665 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:40:00,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:40:00,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:40:00,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:40:00,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:40:00,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:40:00,851 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:40:00,853 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:40:01,299 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-10-11 03:40:01,299 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:40:01,345 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:40:01,347 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:40:01,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:40:01 BoogieIcfgContainer [2024-10-11 03:40:01,348 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:40:01,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:40:01,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:40:01,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:40:01,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:40:00" (1/3) ... [2024-10-11 03:40:01,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4750e183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:40:01, skipping insertion in model container [2024-10-11 03:40:01,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:40:00" (2/3) ... [2024-10-11 03:40:01,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4750e183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:40:01, skipping insertion in model container [2024-10-11 03:40:01,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:40:01" (3/3) ... [2024-10-11 03:40:01,358 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-11 03:40:01,372 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:40:01,373 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:40:01,434 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:40:01,442 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;@3a1a0a3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:40:01,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:40:01,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 83 states have (on average 1.6867469879518073) internal successors, (140), 84 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:01,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 03:40:01,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:01,461 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] [2024-10-11 03:40:01,462 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:01,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:01,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2074678528, now seen corresponding path program 1 times [2024-10-11 03:40:01,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:01,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503465283] [2024-10-11 03:40:01,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:01,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:01,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:01,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:01,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503465283] [2024-10-11 03:40:01,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503465283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:01,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:01,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:01,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075167049] [2024-10-11 03:40:01,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:01,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:01,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:01,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:01,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:01,858 INFO L87 Difference]: Start difference. First operand has 85 states, 83 states have (on average 1.6867469879518073) internal successors, (140), 84 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:01,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:01,915 INFO L93 Difference]: Finished difference Result 201 states and 320 transitions. [2024-10-11 03:40:01,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:01,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-10-11 03:40:01,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:01,927 INFO L225 Difference]: With dead ends: 201 [2024-10-11 03:40:01,927 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 03:40:01,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:01,933 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 93 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:01,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 275 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:01,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 03:40:01,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-10-11 03:40:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.5078125) internal successors, (193), 128 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 193 transitions. [2024-10-11 03:40:01,974 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 193 transitions. Word has length 37 [2024-10-11 03:40:01,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:01,974 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 193 transitions. [2024-10-11 03:40:01,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:01,975 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 193 transitions. [2024-10-11 03:40:01,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 03:40:01,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:01,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:01,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:40:01,977 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:01,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:01,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1791063870, now seen corresponding path program 1 times [2024-10-11 03:40:01,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:01,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396668204] [2024-10-11 03:40:01,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:01,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:02,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:02,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:02,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396668204] [2024-10-11 03:40:02,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396668204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:02,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:02,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:02,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296499482] [2024-10-11 03:40:02,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:02,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:02,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:02,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:02,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:02,142 INFO L87 Difference]: Start difference. First operand 129 states and 193 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:02,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:02,188 INFO L93 Difference]: Finished difference Result 317 states and 489 transitions. [2024-10-11 03:40:02,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:02,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-10-11 03:40:02,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:02,191 INFO L225 Difference]: With dead ends: 317 [2024-10-11 03:40:02,191 INFO L226 Difference]: Without dead ends: 207 [2024-10-11 03:40:02,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:02,193 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 79 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 233 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-11 03:40:02,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 233 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:02,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-11 03:40:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2024-10-11 03:40:02,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5294117647058822) internal successors, (312), 204 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:02,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 312 transitions. [2024-10-11 03:40:02,220 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 312 transitions. Word has length 38 [2024-10-11 03:40:02,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:02,221 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 312 transitions. [2024-10-11 03:40:02,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:02,221 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 312 transitions. [2024-10-11 03:40:02,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 03:40:02,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:02,223 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] [2024-10-11 03:40:02,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:40:02,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:02,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:02,224 INFO L85 PathProgramCache]: Analyzing trace with hash 71230663, now seen corresponding path program 1 times [2024-10-11 03:40:02,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:02,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882600444] [2024-10-11 03:40:02,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:02,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:02,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:02,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882600444] [2024-10-11 03:40:02,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882600444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:02,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:02,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:40:02,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470299158] [2024-10-11 03:40:02,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:02,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:40:02,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:02,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:40:02,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:40:02,458 INFO L87 Difference]: Start difference. First operand 205 states and 312 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:02,577 INFO L93 Difference]: Finished difference Result 949 states and 1484 transitions. [2024-10-11 03:40:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:40:02,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-10-11 03:40:02,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:02,585 INFO L225 Difference]: With dead ends: 949 [2024-10-11 03:40:02,585 INFO L226 Difference]: Without dead ends: 763 [2024-10-11 03:40:02,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11 03:40:02,588 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 501 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:02,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 674 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:40:02,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2024-10-11 03:40:02,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 389. [2024-10-11 03:40:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 1.5360824742268042) internal successors, (596), 388 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 596 transitions. [2024-10-11 03:40:02,636 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 596 transitions. Word has length 39 [2024-10-11 03:40:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:02,636 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 596 transitions. [2024-10-11 03:40:02,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 596 transitions. [2024-10-11 03:40:02,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 03:40:02,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:02,638 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] [2024-10-11 03:40:02,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:40:02,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:02,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:02,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2106273057, now seen corresponding path program 1 times [2024-10-11 03:40:02,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:02,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744406158] [2024-10-11 03:40:02,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:02,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:02,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:02,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:02,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744406158] [2024-10-11 03:40:02,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744406158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:02,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:02,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:40:02,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299024013] [2024-10-11 03:40:02,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:02,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:40:02,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:02,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:40:02,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:40:02,830 INFO L87 Difference]: Start difference. First operand 389 states and 596 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:02,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:02,906 INFO L93 Difference]: Finished difference Result 1347 states and 2079 transitions. [2024-10-11 03:40:02,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:40:02,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-10-11 03:40:02,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:02,911 INFO L225 Difference]: With dead ends: 1347 [2024-10-11 03:40:02,911 INFO L226 Difference]: Without dead ends: 977 [2024-10-11 03:40:02,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:40:02,918 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 253 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:02,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 438 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:40:02,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-10-11 03:40:02,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 973. [2024-10-11 03:40:02,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 972 states have (on average 1.5349794238683128) internal successors, (1492), 972 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:02,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1492 transitions. [2024-10-11 03:40:02,947 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1492 transitions. Word has length 40 [2024-10-11 03:40:02,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:02,948 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1492 transitions. [2024-10-11 03:40:02,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:02,948 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1492 transitions. [2024-10-11 03:40:02,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 03:40:02,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:02,950 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] [2024-10-11 03:40:02,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:40:02,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:02,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:02,951 INFO L85 PathProgramCache]: Analyzing trace with hash -2092318921, now seen corresponding path program 1 times [2024-10-11 03:40:02,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:02,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233800370] [2024-10-11 03:40:02,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:02,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:03,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:03,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:03,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233800370] [2024-10-11 03:40:03,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233800370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:03,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:03,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:03,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460299726] [2024-10-11 03:40:03,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:03,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:03,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:03,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:03,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:03,052 INFO L87 Difference]: Start difference. First operand 973 states and 1492 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:03,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:03,083 INFO L93 Difference]: Finished difference Result 2489 states and 3806 transitions. [2024-10-11 03:40:03,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:03,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-10-11 03:40:03,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:03,090 INFO L225 Difference]: With dead ends: 2489 [2024-10-11 03:40:03,090 INFO L226 Difference]: Without dead ends: 1535 [2024-10-11 03:40:03,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:03,095 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 86 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 273 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-11 03:40:03,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 273 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:03,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2024-10-11 03:40:03,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1533. [2024-10-11 03:40:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1532 states have (on average 1.5065274151436032) internal successors, (2308), 1532 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2308 transitions. [2024-10-11 03:40:03,136 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2308 transitions. Word has length 41 [2024-10-11 03:40:03,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:03,137 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 2308 transitions. [2024-10-11 03:40:03,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:03,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2308 transitions. [2024-10-11 03:40:03,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 03:40:03,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:03,142 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] [2024-10-11 03:40:03,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:40:03,142 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:03,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:03,143 INFO L85 PathProgramCache]: Analyzing trace with hash 841422888, now seen corresponding path program 1 times [2024-10-11 03:40:03,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:03,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648386824] [2024-10-11 03:40:03,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:03,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:03,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:03,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:03,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648386824] [2024-10-11 03:40:03,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648386824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:03,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:03,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:40:03,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874830523] [2024-10-11 03:40:03,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:03,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:40:03,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:03,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:40:03,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:40:03,277 INFO L87 Difference]: Start difference. First operand 1533 states and 2308 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:03,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:03,448 INFO L93 Difference]: Finished difference Result 4105 states and 6198 transitions. [2024-10-11 03:40:03,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:40:03,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-10-11 03:40:03,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:03,460 INFO L225 Difference]: With dead ends: 4105 [2024-10-11 03:40:03,461 INFO L226 Difference]: Without dead ends: 2591 [2024-10-11 03:40:03,464 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-11 03:40:03,465 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 524 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:03,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 135 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:40:03,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2024-10-11 03:40:03,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2589. [2024-10-11 03:40:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2589 states, 2588 states have (on average 1.4945904173106646) internal successors, (3868), 2588 states have internal predecessors, (3868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:03,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2589 states and 3868 transitions. [2024-10-11 03:40:03,524 INFO L78 Accepts]: Start accepts. Automaton has 2589 states and 3868 transitions. Word has length 42 [2024-10-11 03:40:03,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:03,525 INFO L471 AbstractCegarLoop]: Abstraction has 2589 states and 3868 transitions. [2024-10-11 03:40:03,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:03,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2589 states and 3868 transitions. [2024-10-11 03:40:03,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 03:40:03,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:03,531 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] [2024-10-11 03:40:03,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:40:03,531 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:03,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:03,532 INFO L85 PathProgramCache]: Analyzing trace with hash 27010893, now seen corresponding path program 1 times [2024-10-11 03:40:03,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:03,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091060609] [2024-10-11 03:40:03,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:03,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:03,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:03,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:03,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091060609] [2024-10-11 03:40:03,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091060609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:03,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:03,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:40:03,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131142625] [2024-10-11 03:40:03,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:03,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:40:03,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:03,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:40:03,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:40:03,846 INFO L87 Difference]: Start difference. First operand 2589 states and 3868 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:03,885 INFO L93 Difference]: Finished difference Result 2751 states and 4109 transitions. [2024-10-11 03:40:03,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:40:03,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-10-11 03:40:03,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:03,897 INFO L225 Difference]: With dead ends: 2751 [2024-10-11 03:40:03,897 INFO L226 Difference]: Without dead ends: 2749 [2024-10-11 03:40:03,899 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-11 03:40:03,899 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 457 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-11 03:40:03,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 457 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:03,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2749 states. [2024-10-11 03:40:03,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2749 to 2749. [2024-10-11 03:40:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2749 states, 2748 states have (on average 1.4657933042212519) internal successors, (4028), 2748 states have internal predecessors, (4028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:03,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2749 states and 4028 transitions. [2024-10-11 03:40:03,968 INFO L78 Accepts]: Start accepts. Automaton has 2749 states and 4028 transitions. Word has length 42 [2024-10-11 03:40:03,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:03,969 INFO L471 AbstractCegarLoop]: Abstraction has 2749 states and 4028 transitions. [2024-10-11 03:40:03,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 4028 transitions. [2024-10-11 03:40:03,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 03:40:03,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:03,970 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:03,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:40:03,970 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:03,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:03,971 INFO L85 PathProgramCache]: Analyzing trace with hash 847910697, now seen corresponding path program 1 times [2024-10-11 03:40:03,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:03,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940288686] [2024-10-11 03:40:03,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:03,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:04,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:04,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940288686] [2024-10-11 03:40:04,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940288686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:04,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:04,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:04,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693589485] [2024-10-11 03:40:04,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:04,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:04,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:04,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:04,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:04,054 INFO L87 Difference]: Start difference. First operand 2749 states and 4028 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:04,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:04,100 INFO L93 Difference]: Finished difference Result 6191 states and 9052 transitions. [2024-10-11 03:40:04,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:04,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-11 03:40:04,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:04,113 INFO L225 Difference]: With dead ends: 6191 [2024-10-11 03:40:04,113 INFO L226 Difference]: Without dead ends: 3461 [2024-10-11 03:40:04,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:04,120 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 66 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 212 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-11 03:40:04,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 212 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:04,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2024-10-11 03:40:04,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 3439. [2024-10-11 03:40:04,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3439 states, 3438 states have (on average 1.4490983129726585) internal successors, (4982), 3438 states have internal predecessors, (4982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3439 states to 3439 states and 4982 transitions. [2024-10-11 03:40:04,208 INFO L78 Accepts]: Start accepts. Automaton has 3439 states and 4982 transitions. Word has length 43 [2024-10-11 03:40:04,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:04,209 INFO L471 AbstractCegarLoop]: Abstraction has 3439 states and 4982 transitions. [2024-10-11 03:40:04,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:04,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3439 states and 4982 transitions. [2024-10-11 03:40:04,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 03:40:04,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:04,212 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] [2024-10-11 03:40:04,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:40:04,212 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:04,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:04,213 INFO L85 PathProgramCache]: Analyzing trace with hash 449838288, now seen corresponding path program 1 times [2024-10-11 03:40:04,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:04,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009596592] [2024-10-11 03:40:04,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:04,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:04,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:04,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009596592] [2024-10-11 03:40:04,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009596592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:04,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:04,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:04,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775881496] [2024-10-11 03:40:04,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:04,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:04,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:04,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:04,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:04,294 INFO L87 Difference]: Start difference. First operand 3439 states and 4982 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-11 03:40:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:04,350 INFO L93 Difference]: Finished difference Result 8580 states and 12442 transitions. [2024-10-11 03:40:04,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:04,351 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-11 03:40:04,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:04,371 INFO L225 Difference]: With dead ends: 8580 [2024-10-11 03:40:04,372 INFO L226 Difference]: Without dead ends: 5762 [2024-10-11 03:40:04,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:04,379 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 69 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 275 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-11 03:40:04,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 275 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:04,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5762 states. [2024-10-11 03:40:04,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5762 to 5760. [2024-10-11 03:40:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5760 states, 5759 states have (on average 1.431498524049314) internal successors, (8244), 5759 states have internal predecessors, (8244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5760 states to 5760 states and 8244 transitions. [2024-10-11 03:40:04,512 INFO L78 Accepts]: Start accepts. Automaton has 5760 states and 8244 transitions. Word has length 62 [2024-10-11 03:40:04,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:04,514 INFO L471 AbstractCegarLoop]: Abstraction has 5760 states and 8244 transitions. [2024-10-11 03:40:04,514 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-11 03:40:04,514 INFO L276 IsEmpty]: Start isEmpty. Operand 5760 states and 8244 transitions. [2024-10-11 03:40:04,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 03:40:04,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:04,518 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:04,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:40:04,519 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:04,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:04,519 INFO L85 PathProgramCache]: Analyzing trace with hash -666800049, now seen corresponding path program 1 times [2024-10-11 03:40:04,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:04,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638809867] [2024-10-11 03:40:04,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:04,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:04,862 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:04,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:04,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638809867] [2024-10-11 03:40:04,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638809867] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:40:04,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154966220] [2024-10-11 03:40:04,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:04,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:40:04,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:40:04,866 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:40:04,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:40:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:04,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 03:40:05,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:40:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:05,543 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:40:05,955 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:05,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154966220] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:40:05,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:40:05,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2024-10-11 03:40:05,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906771699] [2024-10-11 03:40:05,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:40:05,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 03:40:05,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:05,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 03:40:05,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-10-11 03:40:05,958 INFO L87 Difference]: Start difference. First operand 5760 states and 8244 transitions. Second operand has 20 states, 20 states have (on average 8.9) internal successors, (178), 20 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:11,975 INFO L93 Difference]: Finished difference Result 34397 states and 48974 transitions. [2024-10-11 03:40:11,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-10-11 03:40:11,976 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 8.9) internal successors, (178), 20 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-11 03:40:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:12,061 INFO L225 Difference]: With dead ends: 34397 [2024-10-11 03:40:12,061 INFO L226 Difference]: Without dead ends: 28659 [2024-10-11 03:40:12,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5836 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2820, Invalid=12432, Unknown=0, NotChecked=0, Total=15252 [2024-10-11 03:40:12,083 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 6838 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 2113 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6838 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 2113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:12,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6838 Valid, 1878 Invalid, 2244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 2113 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 03:40:12,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28659 states. [2024-10-11 03:40:12,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28659 to 21187. [2024-10-11 03:40:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21187 states, 21186 states have (on average 1.4064948550929859) internal successors, (29798), 21186 states have internal predecessors, (29798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:12,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21187 states to 21187 states and 29798 transitions. [2024-10-11 03:40:12,826 INFO L78 Accepts]: Start accepts. Automaton has 21187 states and 29798 transitions. Word has length 62 [2024-10-11 03:40:12,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:12,826 INFO L471 AbstractCegarLoop]: Abstraction has 21187 states and 29798 transitions. [2024-10-11 03:40:12,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.9) internal successors, (178), 20 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 21187 states and 29798 transitions. [2024-10-11 03:40:12,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:40:12,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:12,831 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:12,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:40:13,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 03:40:13,037 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:13,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:13,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1808848488, now seen corresponding path program 1 times [2024-10-11 03:40:13,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:13,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110810523] [2024-10-11 03:40:13,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:13,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:13,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:13,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110810523] [2024-10-11 03:40:13,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110810523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:13,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:13,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:13,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827499012] [2024-10-11 03:40:13,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:13,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:13,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:13,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:13,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:13,167 INFO L87 Difference]: Start difference. First operand 21187 states and 29798 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-11 03:40:13,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:13,273 INFO L93 Difference]: Finished difference Result 41448 states and 57915 transitions. [2024-10-11 03:40:13,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:13,273 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-11 03:40:13,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:13,335 INFO L225 Difference]: With dead ends: 41448 [2024-10-11 03:40:13,335 INFO L226 Difference]: Without dead ends: 28703 [2024-10-11 03:40:13,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:13,360 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 67 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 264 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-11 03:40:13,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 264 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:13,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28703 states. [2024-10-11 03:40:13,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28703 to 28701. [2024-10-11 03:40:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28701 states, 28700 states have (on average 1.3816376306620208) internal successors, (39653), 28700 states have internal predecessors, (39653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28701 states to 28701 states and 39653 transitions. [2024-10-11 03:40:14,163 INFO L78 Accepts]: Start accepts. Automaton has 28701 states and 39653 transitions. Word has length 63 [2024-10-11 03:40:14,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:14,163 INFO L471 AbstractCegarLoop]: Abstraction has 28701 states and 39653 transitions. [2024-10-11 03:40:14,163 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-11 03:40:14,163 INFO L276 IsEmpty]: Start isEmpty. Operand 28701 states and 39653 transitions. [2024-10-11 03:40:14,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:40:14,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:14,176 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:14,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:40:14,178 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:14,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:14,178 INFO L85 PathProgramCache]: Analyzing trace with hash 626233138, now seen corresponding path program 1 times [2024-10-11 03:40:14,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:14,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125260550] [2024-10-11 03:40:14,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:14,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:14,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:14,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:14,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125260550] [2024-10-11 03:40:14,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125260550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:14,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:14,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:14,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315043955] [2024-10-11 03:40:14,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:14,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:14,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:14,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:14,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:14,265 INFO L87 Difference]: Start difference. First operand 28701 states and 39653 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-11 03:40:14,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:14,446 INFO L93 Difference]: Finished difference Result 40143 states and 55295 transitions. [2024-10-11 03:40:14,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:14,446 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-11 03:40:14,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:14,486 INFO L225 Difference]: With dead ends: 40143 [2024-10-11 03:40:14,486 INFO L226 Difference]: Without dead ends: 24407 [2024-10-11 03:40:14,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:14,511 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 64 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:14,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 248 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:14,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24407 states. [2024-10-11 03:40:14,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24407 to 23101. [2024-10-11 03:40:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23101 states, 23100 states have (on average 1.3666666666666667) internal successors, (31570), 23100 states have internal predecessors, (31570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23101 states to 23101 states and 31570 transitions. [2024-10-11 03:40:15,019 INFO L78 Accepts]: Start accepts. Automaton has 23101 states and 31570 transitions. Word has length 63 [2024-10-11 03:40:15,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:15,019 INFO L471 AbstractCegarLoop]: Abstraction has 23101 states and 31570 transitions. [2024-10-11 03:40:15,019 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-11 03:40:15,019 INFO L276 IsEmpty]: Start isEmpty. Operand 23101 states and 31570 transitions. [2024-10-11 03:40:15,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:40:15,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:15,023 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:15,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:40:15,024 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:15,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:15,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1577742319, now seen corresponding path program 1 times [2024-10-11 03:40:15,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:15,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712971331] [2024-10-11 03:40:15,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:15,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:15,125 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:40:15,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:15,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712971331] [2024-10-11 03:40:15,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712971331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:15,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:15,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:40:15,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949255648] [2024-10-11 03:40:15,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:15,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:40:15,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:15,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:40:15,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:40:15,128 INFO L87 Difference]: Start difference. First operand 23101 states and 31570 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:15,317 INFO L93 Difference]: Finished difference Result 43766 states and 60206 transitions. [2024-10-11 03:40:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:40:15,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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 63 [2024-10-11 03:40:15,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:15,368 INFO L225 Difference]: With dead ends: 43766 [2024-10-11 03:40:15,368 INFO L226 Difference]: Without dead ends: 34544 [2024-10-11 03:40:15,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:40:15,386 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 343 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:15,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 562 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:15,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34544 states. [2024-10-11 03:40:15,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34544 to 30802. [2024-10-11 03:40:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30802 states, 30801 states have (on average 1.3607999740268173) internal successors, (41914), 30801 states have internal predecessors, (41914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:15,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30802 states to 30802 states and 41914 transitions. [2024-10-11 03:40:15,917 INFO L78 Accepts]: Start accepts. Automaton has 30802 states and 41914 transitions. Word has length 63 [2024-10-11 03:40:15,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:15,918 INFO L471 AbstractCegarLoop]: Abstraction has 30802 states and 41914 transitions. [2024-10-11 03:40:15,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 30802 states and 41914 transitions. [2024-10-11 03:40:15,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:40:15,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:15,922 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:15,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:40:15,923 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:15,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:15,923 INFO L85 PathProgramCache]: Analyzing trace with hash -298940458, now seen corresponding path program 1 times [2024-10-11 03:40:15,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:15,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839039253] [2024-10-11 03:40:15,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:15,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:15,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:15,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:15,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839039253] [2024-10-11 03:40:15,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839039253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:15,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:15,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:15,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464176722] [2024-10-11 03:40:15,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:15,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:15,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:15,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:15,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:15,991 INFO L87 Difference]: Start difference. First operand 30802 states and 41914 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-11 03:40:16,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:16,156 INFO L93 Difference]: Finished difference Result 53761 states and 72702 transitions. [2024-10-11 03:40:16,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:16,157 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-11 03:40:16,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:16,194 INFO L225 Difference]: With dead ends: 53761 [2024-10-11 03:40:16,195 INFO L226 Difference]: Without dead ends: 31791 [2024-10-11 03:40:16,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:16,219 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 67 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:16,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 266 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:16,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31791 states. [2024-10-11 03:40:16,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31791 to 30845. [2024-10-11 03:40:16,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30845 states, 30844 states have (on average 1.3416872001037479) internal successors, (41383), 30844 states have internal predecessors, (41383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30845 states to 30845 states and 41383 transitions. [2024-10-11 03:40:16,684 INFO L78 Accepts]: Start accepts. Automaton has 30845 states and 41383 transitions. Word has length 63 [2024-10-11 03:40:16,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:16,684 INFO L471 AbstractCegarLoop]: Abstraction has 30845 states and 41383 transitions. [2024-10-11 03:40:16,685 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-11 03:40:16,685 INFO L276 IsEmpty]: Start isEmpty. Operand 30845 states and 41383 transitions. [2024-10-11 03:40:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:40:16,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:16,843 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:16,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:40:16,844 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:16,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:16,844 INFO L85 PathProgramCache]: Analyzing trace with hash -2084949564, now seen corresponding path program 1 times [2024-10-11 03:40:16,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:16,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772218815] [2024-10-11 03:40:16,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:16,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:16,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 03:40:16,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:16,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772218815] [2024-10-11 03:40:16,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772218815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:16,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:16,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:40:16,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220287471] [2024-10-11 03:40:16,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:16,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:40:16,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:16,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:40:16,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:40:16,936 INFO L87 Difference]: Start difference. First operand 30845 states and 41383 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-11 03:40:17,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:17,064 INFO L93 Difference]: Finished difference Result 46722 states and 63227 transitions. [2024-10-11 03:40:17,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:40:17,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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 63 [2024-10-11 03:40:17,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:17,111 INFO L225 Difference]: With dead ends: 46722 [2024-10-11 03:40:17,111 INFO L226 Difference]: Without dead ends: 40532 [2024-10-11 03:40:17,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:40:17,127 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 350 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:17,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 562 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:17,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40532 states. [2024-10-11 03:40:17,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40532 to 36799. [2024-10-11 03:40:17,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36799 states, 36798 states have (on average 1.3412413718136855) internal successors, (49355), 36798 states have internal predecessors, (49355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:17,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36799 states to 36799 states and 49355 transitions. [2024-10-11 03:40:17,807 INFO L78 Accepts]: Start accepts. Automaton has 36799 states and 49355 transitions. Word has length 63 [2024-10-11 03:40:17,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:17,807 INFO L471 AbstractCegarLoop]: Abstraction has 36799 states and 49355 transitions. [2024-10-11 03:40:17,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-11 03:40:17,807 INFO L276 IsEmpty]: Start isEmpty. Operand 36799 states and 49355 transitions. [2024-10-11 03:40:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 03:40:17,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:17,811 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:40:17,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:40:17,811 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:17,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:17,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1537795674, now seen corresponding path program 1 times [2024-10-11 03:40:17,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:17,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940818940] [2024-10-11 03:40:17,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:17,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:40:17,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:17,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940818940] [2024-10-11 03:40:17,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940818940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:17,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:17,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:40:17,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706130205] [2024-10-11 03:40:17,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:17,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:40:17,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:17,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:40:17,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:40:17,927 INFO L87 Difference]: Start difference. First operand 36799 states and 49355 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:18,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:18,128 INFO L93 Difference]: Finished difference Result 53351 states and 71995 transitions. [2024-10-11 03:40:18,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:40:18,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-11 03:40:18,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:18,198 INFO L225 Difference]: With dead ends: 53351 [2024-10-11 03:40:18,198 INFO L226 Difference]: Without dead ends: 45906 [2024-10-11 03:40:18,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:40:18,221 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 333 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:18,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 590 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:18,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45906 states. [2024-10-11 03:40:18,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45906 to 42160. [2024-10-11 03:40:19,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42160 states, 42159 states have (on average 1.3383856353329064) internal successors, (56425), 42159 states have internal predecessors, (56425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:19,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42160 states to 42160 states and 56425 transitions. [2024-10-11 03:40:19,083 INFO L78 Accepts]: Start accepts. Automaton has 42160 states and 56425 transitions. Word has length 64 [2024-10-11 03:40:19,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:19,084 INFO L471 AbstractCegarLoop]: Abstraction has 42160 states and 56425 transitions. [2024-10-11 03:40:19,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:19,084 INFO L276 IsEmpty]: Start isEmpty. Operand 42160 states and 56425 transitions. [2024-10-11 03:40:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 03:40:19,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:19,089 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:19,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:40:19,089 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:19,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:19,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1526115763, now seen corresponding path program 1 times [2024-10-11 03:40:19,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:19,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249322438] [2024-10-11 03:40:19,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:19,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:19,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 03:40:19,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:19,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249322438] [2024-10-11 03:40:19,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249322438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:19,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:19,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:40:19,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604748651] [2024-10-11 03:40:19,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:19,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:40:19,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:19,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:40:19,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:40:19,204 INFO L87 Difference]: Start difference. First operand 42160 states and 56425 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:19,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:19,544 INFO L93 Difference]: Finished difference Result 101564 states and 135675 transitions. [2024-10-11 03:40:19,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:40:19,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 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 68 [2024-10-11 03:40:19,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:19,639 INFO L225 Difference]: With dead ends: 101564 [2024-10-11 03:40:19,639 INFO L226 Difference]: Without dead ends: 59463 [2024-10-11 03:40:19,685 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-11 03:40:19,686 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 480 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:19,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 139 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:40:19,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59463 states. [2024-10-11 03:40:20,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59463 to 59107. [2024-10-11 03:40:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59107 states, 59106 states have (on average 1.3236558048252292) internal successors, (78236), 59106 states have internal predecessors, (78236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:20,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59107 states to 59107 states and 78236 transitions. [2024-10-11 03:40:20,505 INFO L78 Accepts]: Start accepts. Automaton has 59107 states and 78236 transitions. Word has length 68 [2024-10-11 03:40:20,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:20,506 INFO L471 AbstractCegarLoop]: Abstraction has 59107 states and 78236 transitions. [2024-10-11 03:40:20,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:20,506 INFO L276 IsEmpty]: Start isEmpty. Operand 59107 states and 78236 transitions. [2024-10-11 03:40:20,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 03:40:20,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:20,511 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:20,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:40:20,511 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:20,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:20,511 INFO L85 PathProgramCache]: Analyzing trace with hash 458570350, now seen corresponding path program 1 times [2024-10-11 03:40:20,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:20,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405612177] [2024-10-11 03:40:20,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:20,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:20,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:20,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:20,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405612177] [2024-10-11 03:40:20,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405612177] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:40:20,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105238687] [2024-10-11 03:40:20,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:20,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:40:20,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:40:20,638 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:40:20,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:40:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:20,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:40:20,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:40:20,958 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:20,958 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:40:21,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:21,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105238687] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:40:21,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:40:21,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-11 03:40:21,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819751793] [2024-10-11 03:40:21,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:40:21,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:40:21,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:21,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:40:21,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:40:21,050 INFO L87 Difference]: Start difference. First operand 59107 states and 78236 transitions. Second operand has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:21,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:21,762 INFO L93 Difference]: Finished difference Result 98578 states and 130175 transitions. [2024-10-11 03:40:21,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:40:21,763 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 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-11 03:40:21,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:21,842 INFO L225 Difference]: With dead ends: 98578 [2024-10-11 03:40:21,842 INFO L226 Difference]: Without dead ends: 71033 [2024-10-11 03:40:21,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 126 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:40:21,872 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 894 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:21,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 288 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:40:21,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71033 states. [2024-10-11 03:40:22,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71033 to 61033. [2024-10-11 03:40:22,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61033 states, 61032 states have (on average 1.3143924498623674) internal successors, (80220), 61032 states have internal predecessors, (80220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61033 states to 61033 states and 80220 transitions. [2024-10-11 03:40:22,759 INFO L78 Accepts]: Start accepts. Automaton has 61033 states and 80220 transitions. Word has length 68 [2024-10-11 03:40:22,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:22,759 INFO L471 AbstractCegarLoop]: Abstraction has 61033 states and 80220 transitions. [2024-10-11 03:40:22,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:22,760 INFO L276 IsEmpty]: Start isEmpty. Operand 61033 states and 80220 transitions. [2024-10-11 03:40:22,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 03:40:22,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:22,765 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:22,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:40:22,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 03:40:22,966 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:22,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:22,967 INFO L85 PathProgramCache]: Analyzing trace with hash -297395949, now seen corresponding path program 1 times [2024-10-11 03:40:22,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:22,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248140488] [2024-10-11 03:40:22,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:22,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:23,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:40:23,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:23,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248140488] [2024-10-11 03:40:23,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248140488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:23,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:23,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:40:23,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977094028] [2024-10-11 03:40:23,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:23,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:40:23,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:23,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:40:23,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:40:23,061 INFO L87 Difference]: Start difference. First operand 61033 states and 80220 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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-11 03:40:23,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:23,449 INFO L93 Difference]: Finished difference Result 138275 states and 181467 transitions. [2024-10-11 03:40:23,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:40:23,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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 68 [2024-10-11 03:40:23,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:23,543 INFO L225 Difference]: With dead ends: 138275 [2024-10-11 03:40:23,543 INFO L226 Difference]: Without dead ends: 77420 [2024-10-11 03:40:23,595 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-11 03:40:23,596 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 462 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:23,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 147 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:40:23,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77420 states. [2024-10-11 03:40:24,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77420 to 77111. [2024-10-11 03:40:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77111 states, 77110 states have (on average 1.2990922059395669) internal successors, (100173), 77110 states have internal predecessors, (100173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77111 states to 77111 states and 100173 transitions. [2024-10-11 03:40:24,821 INFO L78 Accepts]: Start accepts. Automaton has 77111 states and 100173 transitions. Word has length 68 [2024-10-11 03:40:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:24,821 INFO L471 AbstractCegarLoop]: Abstraction has 77111 states and 100173 transitions. [2024-10-11 03:40:24,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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-11 03:40:24,821 INFO L276 IsEmpty]: Start isEmpty. Operand 77111 states and 100173 transitions. [2024-10-11 03:40:24,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 03:40:24,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:24,824 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:24,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:40:24,825 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:24,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:24,825 INFO L85 PathProgramCache]: Analyzing trace with hash -454343816, now seen corresponding path program 1 times [2024-10-11 03:40:24,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:24,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331114626] [2024-10-11 03:40:24,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:24,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:24,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:24,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:24,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331114626] [2024-10-11 03:40:24,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331114626] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:40:24,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986861798] [2024-10-11 03:40:24,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:24,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:40:24,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:40:24,933 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:40:24,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:40:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:25,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:40:25,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:40:25,224 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:25,224 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:40:25,318 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:25,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986861798] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:40:25,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:40:25,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-11 03:40:25,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137596213] [2024-10-11 03:40:25,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:40:25,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:40:25,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:25,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:40:25,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:40:25,322 INFO L87 Difference]: Start difference. First operand 77111 states and 100173 transitions. Second operand has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:26,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:26,535 INFO L93 Difference]: Finished difference Result 157662 states and 205679 transitions. [2024-10-11 03:40:26,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:40:26,535 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 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-11 03:40:26,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:26,662 INFO L225 Difference]: With dead ends: 157662 [2024-10-11 03:40:26,662 INFO L226 Difference]: Without dead ends: 97299 [2024-10-11 03:40:26,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 126 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:40:26,716 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 1093 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:26,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 470 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:40:26,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97299 states. [2024-10-11 03:40:27,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97299 to 80600. [2024-10-11 03:40:27,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80600 states, 80599 states have (on average 1.2975595230710057) internal successors, (104582), 80599 states have internal predecessors, (104582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80600 states to 80600 states and 104582 transitions. [2024-10-11 03:40:27,871 INFO L78 Accepts]: Start accepts. Automaton has 80600 states and 104582 transitions. Word has length 68 [2024-10-11 03:40:27,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:27,871 INFO L471 AbstractCegarLoop]: Abstraction has 80600 states and 104582 transitions. [2024-10-11 03:40:27,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:27,871 INFO L276 IsEmpty]: Start isEmpty. Operand 80600 states and 104582 transitions. [2024-10-11 03:40:27,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:40:27,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:27,874 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:40:27,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 03:40:28,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:40:28,075 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:28,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:28,076 INFO L85 PathProgramCache]: Analyzing trace with hash -966988150, now seen corresponding path program 1 times [2024-10-11 03:40:28,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:28,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455361095] [2024-10-11 03:40:28,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:28,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:28,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:28,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455361095] [2024-10-11 03:40:28,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455361095] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:40:28,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796843413] [2024-10-11 03:40:28,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:28,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:40:28,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:40:28,187 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:40:28,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:40:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:28,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:40:28,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:40:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:28,502 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:40:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:28,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796843413] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:40:28,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:40:28,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-11 03:40:28,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220472467] [2024-10-11 03:40:28,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:40:28,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:40:28,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:28,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:40:28,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:40:28,598 INFO L87 Difference]: Start difference. First operand 80600 states and 104582 transitions. Second operand has 11 states, 11 states have (on average 11.0) internal successors, (121), 10 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:29,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:29,720 INFO L93 Difference]: Finished difference Result 161483 states and 210425 transitions. [2024-10-11 03:40:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:40:29,721 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 10 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-11 03:40:29,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:29,910 INFO L225 Difference]: With dead ends: 161483 [2024-10-11 03:40:29,910 INFO L226 Difference]: Without dead ends: 119213 [2024-10-11 03:40:29,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 128 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:40:29,942 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 947 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:29,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 334 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:40:30,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119213 states. [2024-10-11 03:40:31,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119213 to 91255. [2024-10-11 03:40:31,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91255 states, 91254 states have (on average 1.2983430863304621) internal successors, (118479), 91254 states have internal predecessors, (118479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91255 states to 91255 states and 118479 transitions. [2024-10-11 03:40:31,582 INFO L78 Accepts]: Start accepts. Automaton has 91255 states and 118479 transitions. Word has length 69 [2024-10-11 03:40:31,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:31,582 INFO L471 AbstractCegarLoop]: Abstraction has 91255 states and 118479 transitions. [2024-10-11 03:40:31,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 10 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:31,582 INFO L276 IsEmpty]: Start isEmpty. Operand 91255 states and 118479 transitions. [2024-10-11 03:40:31,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 03:40:31,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:31,587 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:40:31,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 03:40:31,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-11 03:40:31,788 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:31,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:31,788 INFO L85 PathProgramCache]: Analyzing trace with hash 822715612, now seen corresponding path program 1 times [2024-10-11 03:40:31,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:31,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915644059] [2024-10-11 03:40:31,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:31,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:32,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:32,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915644059] [2024-10-11 03:40:32,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915644059] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:40:32,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931284174] [2024-10-11 03:40:32,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:32,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:40:32,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:40:32,066 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:40:32,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 03:40:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:32,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 03:40:32,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:40:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:33,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:40:35,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:35,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931284174] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:40:35,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:40:35,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 16] total 34 [2024-10-11 03:40:35,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650639823] [2024-10-11 03:40:35,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:40:35,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 03:40:35,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:35,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 03:40:35,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 03:40:35,326 INFO L87 Difference]: Start difference. First operand 91255 states and 118479 transitions. Second operand has 35 states, 35 states have (on average 5.542857142857143) internal successors, (194), 34 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:51,586 INFO L93 Difference]: Finished difference Result 493262 states and 635571 transitions. [2024-10-11 03:40:51,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 271 states. [2024-10-11 03:40:51,587 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 5.542857142857143) internal successors, (194), 34 states have internal predecessors, (194), 0 states have call successors, (0), 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 70 [2024-10-11 03:40:51,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:52,877 INFO L225 Difference]: With dead ends: 493262 [2024-10-11 03:40:52,877 INFO L226 Difference]: Without dead ends: 402581 [2024-10-11 03:40:52,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41653 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=15132, Invalid=75770, Unknown=0, NotChecked=0, Total=90902 [2024-10-11 03:40:52,999 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 10534 mSDsluCounter, 3063 mSDsCounter, 0 mSdLazyCounter, 4507 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10534 SdHoareTripleChecker+Valid, 3307 SdHoareTripleChecker+Invalid, 4757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 4507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:53,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10534 Valid, 3307 Invalid, 4757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 4507 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 03:40:53,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402581 states. [2024-10-11 03:40:56,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402581 to 192929. [2024-10-11 03:40:56,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192929 states, 192928 states have (on average 1.295908318129043) internal successors, (250017), 192928 states have internal predecessors, (250017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192929 states to 192929 states and 250017 transitions. [2024-10-11 03:40:57,314 INFO L78 Accepts]: Start accepts. Automaton has 192929 states and 250017 transitions. Word has length 70 [2024-10-11 03:40:57,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:57,315 INFO L471 AbstractCegarLoop]: Abstraction has 192929 states and 250017 transitions. [2024-10-11 03:40:57,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.542857142857143) internal successors, (194), 34 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:57,315 INFO L276 IsEmpty]: Start isEmpty. Operand 192929 states and 250017 transitions. [2024-10-11 03:40:57,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:40:57,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:57,320 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:57,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 03:40:57,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 03:40:57,521 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:57,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:57,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1577076904, now seen corresponding path program 1 times [2024-10-11 03:40:57,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:57,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146706555] [2024-10-11 03:40:57,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:57,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:57,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:57,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:57,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146706555] [2024-10-11 03:40:57,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146706555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:57,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:57,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:57,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066387910] [2024-10-11 03:40:57,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:57,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:57,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:57,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:57,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:57,611 INFO L87 Difference]: Start difference. First operand 192929 states and 250017 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:58,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:58,190 INFO L93 Difference]: Finished difference Result 216210 states and 279997 transitions. [2024-10-11 03:40:58,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:58,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-11 03:40:58,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:58,419 INFO L225 Difference]: With dead ends: 216210 [2024-10-11 03:40:58,419 INFO L226 Difference]: Without dead ends: 173735 [2024-10-11 03:40:58,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:58,495 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 59 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:58,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 283 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:58,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173735 states. [2024-10-11 03:41:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173735 to 170543. [2024-10-11 03:41:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170543 states, 170542 states have (on average 1.2810275474663133) internal successors, (218469), 170542 states have internal predecessors, (218469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170543 states to 170543 states and 218469 transitions. [2024-10-11 03:41:01,401 INFO L78 Accepts]: Start accepts. Automaton has 170543 states and 218469 transitions. Word has length 71 [2024-10-11 03:41:01,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:01,401 INFO L471 AbstractCegarLoop]: Abstraction has 170543 states and 218469 transitions. [2024-10-11 03:41:01,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 170543 states and 218469 transitions. [2024-10-11 03:41:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:41:01,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:01,406 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:41:01,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:41:01,406 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:41:01,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:01,407 INFO L85 PathProgramCache]: Analyzing trace with hash 354425678, now seen corresponding path program 1 times [2024-10-11 03:41:01,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:01,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227076055] [2024-10-11 03:41:01,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:01,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 03:41:01,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:01,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227076055] [2024-10-11 03:41:01,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227076055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:01,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:01,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:41:01,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360810228] [2024-10-11 03:41:01,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:01,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:41:01,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:01,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:41:01,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:41:01,448 INFO L87 Difference]: Start difference. First operand 170543 states and 218469 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-11 03:41:03,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:03,075 INFO L93 Difference]: Finished difference Result 309539 states and 397050 transitions. [2024-10-11 03:41:03,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:41:03,075 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 71 [2024-10-11 03:41:03,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:03,356 INFO L225 Difference]: With dead ends: 309539 [2024-10-11 03:41:03,356 INFO L226 Difference]: Without dead ends: 140461 [2024-10-11 03:41:03,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:41:03,445 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 81 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:03,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 115 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:41:03,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140461 states. [2024-10-11 03:41:05,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140461 to 139656. [2024-10-11 03:41:05,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139656 states, 139655 states have (on average 1.2632129175468119) internal successors, (176414), 139655 states have internal predecessors, (176414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139656 states to 139656 states and 176414 transitions. [2024-10-11 03:41:05,405 INFO L78 Accepts]: Start accepts. Automaton has 139656 states and 176414 transitions. Word has length 71 [2024-10-11 03:41:05,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:05,405 INFO L471 AbstractCegarLoop]: Abstraction has 139656 states and 176414 transitions. [2024-10-11 03:41:05,405 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-11 03:41:05,405 INFO L276 IsEmpty]: Start isEmpty. Operand 139656 states and 176414 transitions. [2024-10-11 03:41:05,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:41:05,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:05,409 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:41:05,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:41:05,409 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:41:05,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:05,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1111217540, now seen corresponding path program 1 times [2024-10-11 03:41:05,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:05,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517314817] [2024-10-11 03:41:05,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:05,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 03:41:05,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:05,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517314817] [2024-10-11 03:41:05,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517314817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:41:05,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:41:05,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:41:05,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620012165] [2024-10-11 03:41:05,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:41:05,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:41:05,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:41:05,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:41:05,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:41:05,449 INFO L87 Difference]: Start difference. First operand 139656 states and 176414 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:07,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:41:07,011 INFO L93 Difference]: Finished difference Result 235908 states and 298456 transitions. [2024-10-11 03:41:07,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:41:07,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-11 03:41:07,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:41:07,154 INFO L225 Difference]: With dead ends: 235908 [2024-10-11 03:41:07,154 INFO L226 Difference]: Without dead ends: 97172 [2024-10-11 03:41:07,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:41:07,232 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 85 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:41:07,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 141 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:41:07,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97172 states. [2024-10-11 03:41:08,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97172 to 97172. [2024-10-11 03:41:08,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97172 states, 97171 states have (on average 1.2488808389334267) internal successors, (121355), 97171 states have internal predecessors, (121355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97172 states to 97172 states and 121355 transitions. [2024-10-11 03:41:08,747 INFO L78 Accepts]: Start accepts. Automaton has 97172 states and 121355 transitions. Word has length 71 [2024-10-11 03:41:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:41:08,747 INFO L471 AbstractCegarLoop]: Abstraction has 97172 states and 121355 transitions. [2024-10-11 03:41:08,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:41:08,748 INFO L276 IsEmpty]: Start isEmpty. Operand 97172 states and 121355 transitions. [2024-10-11 03:41:08,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 03:41:08,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:41:08,750 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:41:08,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:41:08,751 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:41:08,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:41:08,751 INFO L85 PathProgramCache]: Analyzing trace with hash 383821522, now seen corresponding path program 1 times [2024-10-11 03:41:08,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:41:08,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281000427] [2024-10-11 03:41:08,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:08,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:41:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:41:09,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:41:09,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281000427] [2024-10-11 03:41:09,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281000427] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:41:09,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549629982] [2024-10-11 03:41:09,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:41:09,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:41:09,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:41:09,352 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:41:09,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 03:41:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:41:09,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-11 03:41:09,474 INFO L278 TraceCheckSpWp]: Computing forward predicates...