./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label09.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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label09.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 00613173bfd5be4a2d23c5cbdde33ad3a2bf8c778a3dcd5e833889c0a53ce55c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:43:15,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:43:15,350 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:43:15,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:43:15,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:43:15,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:43:15,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:43:15,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:43:15,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:43:15,393 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:43:15,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:43:15,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:43:15,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:43:15,396 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:43:15,396 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:43:15,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:43:15,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:43:15,397 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:43:15,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:43:15,398 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:43:15,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:43:15,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:43:15,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:43:15,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:43:15,403 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:43:15,404 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:43:15,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:43:15,404 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:43:15,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:43:15,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:43:15,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:43:15,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:43:15,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:43:15,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:43:15,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:43:15,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:43:15,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:43:15,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:43:15,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:43:15,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:43:15,407 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:43:15,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:43:15,408 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 -> 00613173bfd5be4a2d23c5cbdde33ad3a2bf8c778a3dcd5e833889c0a53ce55c [2024-10-11 04:43:15,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:43:15,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:43:15,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:43:15,685 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:43:15,685 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:43:15,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-10-11 04:43:17,145 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:43:17,604 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:43:17,605 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-10-11 04:43:17,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/85513292b/d46326341f3349518bc394018695519d/FLAGed484e462 [2024-10-11 04:43:17,658 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/85513292b/d46326341f3349518bc394018695519d [2024-10-11 04:43:17,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:43:17,664 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:43:17,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:43:17,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:43:17,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:43:17,673 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:43:17" (1/1) ... [2024-10-11 04:43:17,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6795e635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:17, skipping insertion in model container [2024-10-11 04:43:17,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:43:17" (1/1) ... [2024-10-11 04:43:17,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:43:18,113 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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label09.c[6450,6463] [2024-10-11 04:43:18,189 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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label09.c[14198,14211] [2024-10-11 04:43:18,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:43:18,911 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:43:18,946 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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label09.c[6450,6463] [2024-10-11 04:43:18,961 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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label09.c[14198,14211] [2024-10-11 04:43:19,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:43:19,389 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:43:19,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19 WrapperNode [2024-10-11 04:43:19,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:43:19,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:43:19,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:43:19,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:43:19,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:19,459 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:19,754 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4983 [2024-10-11 04:43:19,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:43:19,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:43:19,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:43:19,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:43:19,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:19,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:19,820 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:20,048 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 04:43:20,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:20,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:20,204 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:20,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:20,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:20,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:20,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:43:20,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:43:20,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:43:20,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:43:20,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:20,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:43:20,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:20,407 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 04:43:20,409 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 04:43:20,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:43:20,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:43:20,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:43:20,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:43:20,554 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:43:20,555 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:43:24,971 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2024-10-11 04:43:24,971 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:43:25,039 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:43:25,039 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:43:25,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:43:25 BoogieIcfgContainer [2024-10-11 04:43:25,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:43:25,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:43:25,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:43:25,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:43:25,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:43:17" (1/3) ... [2024-10-11 04:43:25,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f534105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:43:25, skipping insertion in model container [2024-10-11 04:43:25,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (2/3) ... [2024-10-11 04:43:25,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f534105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:43:25, skipping insertion in model container [2024-10-11 04:43:25,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:43:25" (3/3) ... [2024-10-11 04:43:25,048 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-10-11 04:43:25,064 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:43:25,064 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:43:25,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:43:25,177 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;@5d8f63c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:43:25,178 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:43:25,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 809 states, 806 states have (on average 1.978908188585608) internal successors, (1595), 808 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states 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 04:43:25,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 04:43:25,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:25,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:43:25,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:25,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:25,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1341170347, now seen corresponding path program 1 times [2024-10-11 04:43:25,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:25,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467076056] [2024-10-11 04:43:25,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:25,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:25,449 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 04:43:25,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:25,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467076056] [2024-10-11 04:43:25,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467076056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:25,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:25,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:43:25,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054795158] [2024-10-11 04:43:25,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:25,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 04:43:25,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:25,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 04:43:25,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:43:25,487 INFO L87 Difference]: Start difference. First operand has 809 states, 806 states have (on average 1.978908188585608) internal successors, (1595), 808 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 04:43:25,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:25,601 INFO L93 Difference]: Finished difference Result 1597 states and 3151 transitions. [2024-10-11 04:43:25,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 04:43:25,605 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-10-11 04:43:25,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:25,628 INFO L225 Difference]: With dead ends: 1597 [2024-10-11 04:43:25,629 INFO L226 Difference]: Without dead ends: 805 [2024-10-11 04:43:25,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:43:25,643 INFO L432 NwaCegarLoop]: 1523 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:25,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1523 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:43:25,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-10-11 04:43:25,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2024-10-11 04:43:25,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 803 states have (on average 1.8978829389788294) internal successors, (1524), 804 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states 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 04:43:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1524 transitions. [2024-10-11 04:43:25,746 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1524 transitions. Word has length 17 [2024-10-11 04:43:25,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:25,746 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1524 transitions. [2024-10-11 04:43:25,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 04:43:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1524 transitions. [2024-10-11 04:43:25,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 04:43:25,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:25,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:43:25,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:43:25,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:25,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:25,751 INFO L85 PathProgramCache]: Analyzing trace with hash 754364333, now seen corresponding path program 1 times [2024-10-11 04:43:25,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:25,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261261883] [2024-10-11 04:43:25,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:25,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:25,912 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 04:43:25,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:25,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261261883] [2024-10-11 04:43:25,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261261883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:25,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:25,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:43:25,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914347055] [2024-10-11 04:43:25,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:25,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:43:25,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:25,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:43:25,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:43:25,916 INFO L87 Difference]: Start difference. First operand 805 states and 1524 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 04:43:25,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:25,987 INFO L93 Difference]: Finished difference Result 839 states and 1576 transitions. [2024-10-11 04:43:25,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:43:25,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-10-11 04:43:25,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:25,991 INFO L225 Difference]: With dead ends: 839 [2024-10-11 04:43:25,991 INFO L226 Difference]: Without dead ends: 805 [2024-10-11 04:43:25,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:43:25,993 INFO L432 NwaCegarLoop]: 1521 mSDtfsCounter, 0 mSDsluCounter, 3022 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4543 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:25,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4543 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:43:25,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-10-11 04:43:26,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2024-10-11 04:43:26,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 803 states have (on average 1.8779576587795765) internal successors, (1508), 804 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states 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 04:43:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1508 transitions. [2024-10-11 04:43:26,008 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1508 transitions. Word has length 17 [2024-10-11 04:43:26,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:26,009 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1508 transitions. [2024-10-11 04:43:26,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 04:43:26,009 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1508 transitions. [2024-10-11 04:43:26,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 04:43:26,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:26,010 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] [2024-10-11 04:43:26,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:43:26,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:26,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:26,011 INFO L85 PathProgramCache]: Analyzing trace with hash 985450657, now seen corresponding path program 1 times [2024-10-11 04:43:26,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:26,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320897625] [2024-10-11 04:43:26,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:26,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:26,197 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 04:43:26,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:26,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320897625] [2024-10-11 04:43:26,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320897625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:26,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:26,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:43:26,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276560865] [2024-10-11 04:43:26,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:26,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:43:26,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:26,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:43:26,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:43:26,200 INFO L87 Difference]: Start difference. First operand 805 states and 1508 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 04:43:26,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:26,345 INFO L93 Difference]: Finished difference Result 991 states and 1802 transitions. [2024-10-11 04:43:26,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:43:26,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-10-11 04:43:26,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:26,351 INFO L225 Difference]: With dead ends: 991 [2024-10-11 04:43:26,351 INFO L226 Difference]: Without dead ends: 960 [2024-10-11 04:43:26,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:43:26,353 INFO L432 NwaCegarLoop]: 1499 mSDtfsCounter, 4669 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4669 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:26,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4669 Valid, 1742 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:43:26,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-10-11 04:43:26,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 834. [2024-10-11 04:43:26,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 832 states have (on average 1.8677884615384615) internal successors, (1554), 833 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states 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 04:43:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1554 transitions. [2024-10-11 04:43:26,376 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1554 transitions. Word has length 32 [2024-10-11 04:43:26,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:26,379 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1554 transitions. [2024-10-11 04:43:26,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 04:43:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1554 transitions. [2024-10-11 04:43:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 04:43:26,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:26,381 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] [2024-10-11 04:43:26,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:43:26,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:26,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:26,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2002586129, now seen corresponding path program 1 times [2024-10-11 04:43:26,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:26,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263706015] [2024-10-11 04:43:26,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:26,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:26,481 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 04:43:26,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:26,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263706015] [2024-10-11 04:43:26,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263706015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:26,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:26,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:26,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653185043] [2024-10-11 04:43:26,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:26,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:26,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:26,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:26,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:26,485 INFO L87 Difference]: Start difference. First operand 834 states and 1554 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 04:43:26,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:26,553 INFO L93 Difference]: Finished difference Result 943 states and 1725 transitions. [2024-10-11 04:43:26,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:26,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-11 04:43:26,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:26,558 INFO L225 Difference]: With dead ends: 943 [2024-10-11 04:43:26,558 INFO L226 Difference]: Without dead ends: 883 [2024-10-11 04:43:26,559 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 04:43:26,560 INFO L432 NwaCegarLoop]: 1501 mSDtfsCounter, 1466 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:26,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 1542 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:43:26,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-10-11 04:43:26,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 879. [2024-10-11 04:43:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 877 states have (on average 1.8494868871151653) internal successors, (1622), 878 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states 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 04:43:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1622 transitions. [2024-10-11 04:43:26,578 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1622 transitions. Word has length 34 [2024-10-11 04:43:26,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:26,578 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1622 transitions. [2024-10-11 04:43:26,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 04:43:26,579 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1622 transitions. [2024-10-11 04:43:26,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 04:43:26,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:26,580 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] [2024-10-11 04:43:26,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:43:26,580 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:26,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:26,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2004731081, now seen corresponding path program 1 times [2024-10-11 04:43:26,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:26,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963831953] [2024-10-11 04:43:26,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:26,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:26,754 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 04:43:26,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:26,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963831953] [2024-10-11 04:43:26,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963831953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:26,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:26,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:43:26,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871544125] [2024-10-11 04:43:26,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:26,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:43:26,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:26,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:43:26,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:43:26,759 INFO L87 Difference]: Start difference. First operand 879 states and 1622 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 04:43:26,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:26,848 INFO L93 Difference]: Finished difference Result 986 states and 1786 transitions. [2024-10-11 04:43:26,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:43:26,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-11 04:43:26,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:26,853 INFO L225 Difference]: With dead ends: 986 [2024-10-11 04:43:26,853 INFO L226 Difference]: Without dead ends: 881 [2024-10-11 04:43:26,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:43:26,857 INFO L432 NwaCegarLoop]: 1500 mSDtfsCounter, 4420 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4420 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:26,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4420 Valid, 1588 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:43:26,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-10-11 04:43:26,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2024-10-11 04:43:26,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 877 states have (on average 1.847206385404789) internal successors, (1620), 878 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states 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 04:43:26,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1620 transitions. [2024-10-11 04:43:26,882 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1620 transitions. Word has length 34 [2024-10-11 04:43:26,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:26,883 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1620 transitions. [2024-10-11 04:43:26,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 04:43:26,883 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1620 transitions. [2024-10-11 04:43:26,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 04:43:26,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:26,887 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] [2024-10-11 04:43:26,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:43:26,887 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:26,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:26,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1888766543, now seen corresponding path program 1 times [2024-10-11 04:43:26,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:26,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129645380] [2024-10-11 04:43:26,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:26,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:27,030 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 04:43:27,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:27,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129645380] [2024-10-11 04:43:27,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129645380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:27,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:27,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:43:27,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726209881] [2024-10-11 04:43:27,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:27,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:43:27,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:27,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:43:27,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:43:27,034 INFO L87 Difference]: Start difference. First operand 879 states and 1620 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 04:43:27,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:27,073 INFO L93 Difference]: Finished difference Result 885 states and 1627 transitions. [2024-10-11 04:43:27,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:43:27,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-11 04:43:27,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:27,079 INFO L225 Difference]: With dead ends: 885 [2024-10-11 04:43:27,079 INFO L226 Difference]: Without dead ends: 883 [2024-10-11 04:43:27,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:43:27,082 INFO L432 NwaCegarLoop]: 1504 mSDtfsCounter, 0 mSDsluCounter, 3000 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4504 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:27,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4504 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:43:27,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-10-11 04:43:27,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2024-10-11 04:43:27,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.8422247446083995) internal successors, (1623), 882 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states 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 04:43:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1623 transitions. [2024-10-11 04:43:27,099 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1623 transitions. Word has length 35 [2024-10-11 04:43:27,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:27,101 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1623 transitions. [2024-10-11 04:43:27,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 04:43:27,102 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1623 transitions. [2024-10-11 04:43:27,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:43:27,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:27,104 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] [2024-10-11 04:43:27,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:43:27,105 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:27,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:27,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1678864809, now seen corresponding path program 1 times [2024-10-11 04:43:27,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:27,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991888503] [2024-10-11 04:43:27,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:27,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:27,154 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 04:43:27,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:27,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991888503] [2024-10-11 04:43:27,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991888503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:27,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:27,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:27,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042342448] [2024-10-11 04:43:27,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:27,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:27,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:27,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:27,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:27,157 INFO L87 Difference]: Start difference. First operand 883 states and 1623 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 04:43:27,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:27,187 INFO L93 Difference]: Finished difference Result 1085 states and 1923 transitions. [2024-10-11 04:43:27,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:27,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-10-11 04:43:27,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:27,192 INFO L225 Difference]: With dead ends: 1085 [2024-10-11 04:43:27,192 INFO L226 Difference]: Without dead ends: 976 [2024-10-11 04:43:27,194 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 04:43:27,195 INFO L432 NwaCegarLoop]: 1520 mSDtfsCounter, 1473 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 1577 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 04:43:27,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 1577 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:43:27,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-11 04:43:27,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 974. [2024-10-11 04:43:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 972 states have (on average 1.8045267489711934) internal successors, (1754), 973 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states 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 04:43:27,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1754 transitions. [2024-10-11 04:43:27,214 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1754 transitions. Word has length 36 [2024-10-11 04:43:27,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:27,214 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1754 transitions. [2024-10-11 04:43:27,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 04:43:27,215 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1754 transitions. [2024-10-11 04:43:27,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:43:27,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:27,216 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] [2024-10-11 04:43:27,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:43:27,216 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:27,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:27,216 INFO L85 PathProgramCache]: Analyzing trace with hash 790131369, now seen corresponding path program 1 times [2024-10-11 04:43:27,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:27,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29114263] [2024-10-11 04:43:27,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:27,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:27,262 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 04:43:27,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:27,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29114263] [2024-10-11 04:43:27,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29114263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:27,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:27,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:27,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801651337] [2024-10-11 04:43:27,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:27,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:27,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:27,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:27,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:27,264 INFO L87 Difference]: Start difference. First operand 974 states and 1754 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 04:43:27,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:27,295 INFO L93 Difference]: Finished difference Result 1342 states and 2288 transitions. [2024-10-11 04:43:27,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:27,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-10-11 04:43:27,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:27,300 INFO L225 Difference]: With dead ends: 1342 [2024-10-11 04:43:27,300 INFO L226 Difference]: Without dead ends: 1142 [2024-10-11 04:43:27,300 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 04:43:27,301 INFO L432 NwaCegarLoop]: 1530 mSDtfsCounter, 1475 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1583 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 04:43:27,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1583 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:43:27,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2024-10-11 04:43:27,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1140. [2024-10-11 04:43:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1138 states have (on average 1.7434094903339192) internal successors, (1984), 1139 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states 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 04:43:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1984 transitions. [2024-10-11 04:43:27,322 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1984 transitions. Word has length 36 [2024-10-11 04:43:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:27,322 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1984 transitions. [2024-10-11 04:43:27,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 04:43:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1984 transitions. [2024-10-11 04:43:27,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 04:43:27,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:27,323 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 04:43:27,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:43:27,323 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:27,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:27,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1280796238, now seen corresponding path program 1 times [2024-10-11 04:43:27,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:27,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440681523] [2024-10-11 04:43:27,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:27,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:27,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:27,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:27,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440681523] [2024-10-11 04:43:27,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440681523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:27,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:27,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:27,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645268457] [2024-10-11 04:43:27,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:27,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:27,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:27,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:27,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:27,370 INFO L87 Difference]: Start difference. First operand 1140 states and 1984 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 04:43:27,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:27,406 INFO L93 Difference]: Finished difference Result 1531 states and 2558 transitions. [2024-10-11 04:43:27,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:27,407 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 04:43:27,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:27,413 INFO L225 Difference]: With dead ends: 1531 [2024-10-11 04:43:27,413 INFO L226 Difference]: Without dead ends: 1312 [2024-10-11 04:43:27,414 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 04:43:27,416 INFO L432 NwaCegarLoop]: 1535 mSDtfsCounter, 1474 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1584 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 04:43:27,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1584 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:43:27,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2024-10-11 04:43:27,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1310. [2024-10-11 04:43:27,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1308 states have (on average 1.698776758409786) internal successors, (2222), 1309 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states 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 04:43:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 2222 transitions. [2024-10-11 04:43:27,448 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 2222 transitions. Word has length 38 [2024-10-11 04:43:27,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:27,449 INFO L471 AbstractCegarLoop]: Abstraction has 1310 states and 2222 transitions. [2024-10-11 04:43:27,449 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 04:43:27,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 2222 transitions. [2024-10-11 04:43:27,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:43:27,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:27,450 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] [2024-10-11 04:43:27,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:43:27,450 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:27,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:27,451 INFO L85 PathProgramCache]: Analyzing trace with hash 754629938, now seen corresponding path program 1 times [2024-10-11 04:43:27,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:27,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611417935] [2024-10-11 04:43:27,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:27,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:27,564 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 04:43:27,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:27,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611417935] [2024-10-11 04:43:27,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611417935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:27,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:27,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:43:27,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020249560] [2024-10-11 04:43:27,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:27,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:43:27,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:27,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:43:27,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:43:27,567 INFO L87 Difference]: Start difference. First operand 1310 states and 2222 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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 04:43:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:27,677 INFO L93 Difference]: Finished difference Result 3034 states and 4670 transitions. [2024-10-11 04:43:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:43:27,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 04:43:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:27,692 INFO L225 Difference]: With dead ends: 3034 [2024-10-11 04:43:27,692 INFO L226 Difference]: Without dead ends: 2500 [2024-10-11 04:43:27,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 04:43:27,694 INFO L432 NwaCegarLoop]: 1543 mSDtfsCounter, 3051 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3051 SdHoareTripleChecker+Valid, 3138 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:27,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3051 Valid, 3138 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:43:27,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2024-10-11 04:43:27,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 1842. [2024-10-11 04:43:27,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1840 states have (on average 1.6141304347826086) internal successors, (2970), 1841 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states 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 04:43:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2970 transitions. [2024-10-11 04:43:27,745 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2970 transitions. Word has length 50 [2024-10-11 04:43:27,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:27,745 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2970 transitions. [2024-10-11 04:43:27,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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 04:43:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2970 transitions. [2024-10-11 04:43:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:43:27,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:27,747 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] [2024-10-11 04:43:27,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:43:27,747 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:27,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:27,748 INFO L85 PathProgramCache]: Analyzing trace with hash -134103502, now seen corresponding path program 1 times [2024-10-11 04:43:27,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:27,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852696970] [2024-10-11 04:43:27,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:27,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:27,869 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 04:43:27,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:27,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852696970] [2024-10-11 04:43:27,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852696970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:27,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:27,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:43:27,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461978769] [2024-10-11 04:43:27,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:27,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:43:27,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:27,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:43:27,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:43:27,872 INFO L87 Difference]: Start difference. First operand 1842 states and 2970 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:27,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:27,996 INFO L93 Difference]: Finished difference Result 3566 states and 5418 transitions. [2024-10-11 04:43:27,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:43:27,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 04:43:27,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:28,010 INFO L225 Difference]: With dead ends: 3566 [2024-10-11 04:43:28,011 INFO L226 Difference]: Without dead ends: 3032 [2024-10-11 04:43:28,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 04:43:28,013 INFO L432 NwaCegarLoop]: 1544 mSDtfsCounter, 3043 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3043 SdHoareTripleChecker+Valid, 3153 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:28,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3043 Valid, 3153 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:43:28,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2024-10-11 04:43:28,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 2642. [2024-10-11 04:43:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2642 states, 2640 states have (on average 1.5462121212121211) internal successors, (4082), 2641 states have internal predecessors, (4082), 0 states have call successors, (0), 0 states 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 04:43:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2642 states and 4082 transitions. [2024-10-11 04:43:28,088 INFO L78 Accepts]: Start accepts. Automaton has 2642 states and 4082 transitions. Word has length 50 [2024-10-11 04:43:28,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:28,089 INFO L471 AbstractCegarLoop]: Abstraction has 2642 states and 4082 transitions. [2024-10-11 04:43:28,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:28,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2642 states and 4082 transitions. [2024-10-11 04:43:28,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 04:43:28,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:28,090 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:43:28,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:43:28,090 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:28,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:28,091 INFO L85 PathProgramCache]: Analyzing trace with hash -770647782, now seen corresponding path program 1 times [2024-10-11 04:43:28,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:28,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688461739] [2024-10-11 04:43:28,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:28,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:28,173 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 04:43:28,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:28,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688461739] [2024-10-11 04:43:28,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688461739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:28,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:28,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:28,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860673028] [2024-10-11 04:43:28,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:28,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:28,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:28,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:28,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:28,176 INFO L87 Difference]: Start difference. First operand 2642 states and 4082 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:28,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:28,224 INFO L93 Difference]: Finished difference Result 4005 states and 6032 transitions. [2024-10-11 04:43:28,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:28,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-11 04:43:28,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:28,232 INFO L225 Difference]: With dead ends: 4005 [2024-10-11 04:43:28,232 INFO L226 Difference]: Without dead ends: 2139 [2024-10-11 04:43:28,235 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 04:43:28,235 INFO L432 NwaCegarLoop]: 1529 mSDtfsCounter, 34 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3020 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:28,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3020 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:43:28,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2024-10-11 04:43:28,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2137. [2024-10-11 04:43:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 2135 states have (on average 1.5836065573770493) internal successors, (3381), 2136 states have internal predecessors, (3381), 0 states have call successors, (0), 0 states 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 04:43:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3381 transitions. [2024-10-11 04:43:28,291 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3381 transitions. Word has length 52 [2024-10-11 04:43:28,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:28,291 INFO L471 AbstractCegarLoop]: Abstraction has 2137 states and 3381 transitions. [2024-10-11 04:43:28,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:28,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3381 transitions. [2024-10-11 04:43:28,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 04:43:28,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:28,292 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] [2024-10-11 04:43:28,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:43:28,293 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:28,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:28,293 INFO L85 PathProgramCache]: Analyzing trace with hash -2145651817, now seen corresponding path program 1 times [2024-10-11 04:43:28,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:28,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534384316] [2024-10-11 04:43:28,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:28,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:28,380 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 04:43:28,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:28,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534384316] [2024-10-11 04:43:28,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534384316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:28,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:28,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:43:28,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395239579] [2024-10-11 04:43:28,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:28,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:43:28,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:28,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:43:28,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:43:28,383 INFO L87 Difference]: Start difference. First operand 2137 states and 3381 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:28,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:28,495 INFO L93 Difference]: Finished difference Result 3297 states and 5041 transitions. [2024-10-11 04:43:28,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:43:28,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-11 04:43:28,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:28,507 INFO L225 Difference]: With dead ends: 3297 [2024-10-11 04:43:28,507 INFO L226 Difference]: Without dead ends: 2911 [2024-10-11 04:43:28,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 04:43:28,510 INFO L432 NwaCegarLoop]: 1541 mSDtfsCounter, 3043 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3043 SdHoareTripleChecker+Valid, 3138 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:28,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3043 Valid, 3138 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:43:28,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2024-10-11 04:43:28,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2521. [2024-10-11 04:43:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2521 states, 2519 states have (on average 1.5581579992060341) internal successors, (3925), 2520 states have internal predecessors, (3925), 0 states have call successors, (0), 0 states 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 04:43:28,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 3925 transitions. [2024-10-11 04:43:28,581 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 3925 transitions. Word has length 52 [2024-10-11 04:43:28,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:28,582 INFO L471 AbstractCegarLoop]: Abstraction has 2521 states and 3925 transitions. [2024-10-11 04:43:28,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:28,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 3925 transitions. [2024-10-11 04:43:28,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 04:43:28,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:28,583 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:43:28,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:43:28,584 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:28,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:28,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1651769552, now seen corresponding path program 1 times [2024-10-11 04:43:28,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:28,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229762568] [2024-10-11 04:43:28,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:28,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:28,688 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 04:43:28,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:28,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229762568] [2024-10-11 04:43:28,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229762568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:28,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:28,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:28,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436930153] [2024-10-11 04:43:28,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:28,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:28,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:28,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:28,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:28,690 INFO L87 Difference]: Start difference. First operand 2521 states and 3925 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:28,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:28,730 INFO L93 Difference]: Finished difference Result 3389 states and 5151 transitions. [2024-10-11 04:43:28,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:28,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-11 04:43:28,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:28,737 INFO L225 Difference]: With dead ends: 3389 [2024-10-11 04:43:28,738 INFO L226 Difference]: Without dead ends: 1659 [2024-10-11 04:43:28,740 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 04:43:28,741 INFO L432 NwaCegarLoop]: 1522 mSDtfsCounter, 29 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3005 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:28,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3005 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:43:28,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2024-10-11 04:43:28,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1657. [2024-10-11 04:43:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1655 states have (on average 1.6211480362537765) internal successors, (2683), 1656 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states 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 04:43:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2683 transitions. [2024-10-11 04:43:28,781 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2683 transitions. Word has length 53 [2024-10-11 04:43:28,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:28,781 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2683 transitions. [2024-10-11 04:43:28,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2683 transitions. [2024-10-11 04:43:28,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:43:28,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:28,782 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] [2024-10-11 04:43:28,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:43:28,783 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:28,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:28,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1255624482, now seen corresponding path program 1 times [2024-10-11 04:43:28,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:28,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431152291] [2024-10-11 04:43:28,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:28,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:28,855 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 04:43:28,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:28,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431152291] [2024-10-11 04:43:28,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431152291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:28,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:28,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:28,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379536690] [2024-10-11 04:43:28,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:28,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:28,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:28,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:28,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:28,857 INFO L87 Difference]: Start difference. First operand 1657 states and 2683 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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 04:43:28,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:28,894 INFO L93 Difference]: Finished difference Result 2093 states and 3288 transitions. [2024-10-11 04:43:28,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:28,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-11 04:43:28,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:28,899 INFO L225 Difference]: With dead ends: 2093 [2024-10-11 04:43:28,899 INFO L226 Difference]: Without dead ends: 1227 [2024-10-11 04:43:28,901 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 04:43:28,901 INFO L432 NwaCegarLoop]: 1515 mSDtfsCounter, 26 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2990 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:28,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2990 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:43:28,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2024-10-11 04:43:28,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1225. [2024-10-11 04:43:28,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1223 states have (on average 1.6933769419460343) internal successors, (2071), 1224 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states 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 04:43:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 2071 transitions. [2024-10-11 04:43:28,957 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 2071 transitions. Word has length 55 [2024-10-11 04:43:28,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:28,957 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 2071 transitions. [2024-10-11 04:43:28,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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 04:43:28,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 2071 transitions. [2024-10-11 04:43:28,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 04:43:28,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:28,959 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] [2024-10-11 04:43:28,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:43:28,959 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:28,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:28,960 INFO L85 PathProgramCache]: Analyzing trace with hash -796404724, now seen corresponding path program 1 times [2024-10-11 04:43:28,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:28,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979783890] [2024-10-11 04:43:28,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:28,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:30,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:30,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979783890] [2024-10-11 04:43:30,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979783890] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:43:30,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195028224] [2024-10-11 04:43:30,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:30,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:30,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:30,999 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 04:43:31,000 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 04:43:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:31,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 04:43:31,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:43:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:43:31,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:43:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:43:31,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195028224] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:43:31,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:43:31,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 18 [2024-10-11 04:43:31,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184821255] [2024-10-11 04:43:31,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:43:31,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 04:43:31,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:31,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 04:43:31,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-10-11 04:43:31,458 INFO L87 Difference]: Start difference. First operand 1225 states and 2071 transitions. Second operand has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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 04:43:34,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:34,245 INFO L93 Difference]: Finished difference Result 3534 states and 5153 transitions. [2024-10-11 04:43:34,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-11 04:43:34,246 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 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 57 [2024-10-11 04:43:34,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:34,257 INFO L225 Difference]: With dead ends: 3534 [2024-10-11 04:43:34,259 INFO L226 Difference]: Without dead ends: 3100 [2024-10-11 04:43:34,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=719, Invalid=3063, Unknown=0, NotChecked=0, Total=3782 [2024-10-11 04:43:34,263 INFO L432 NwaCegarLoop]: 1492 mSDtfsCounter, 14185 mSDsluCounter, 6142 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14185 SdHoareTripleChecker+Valid, 7634 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:34,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14185 Valid, 7634 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 04:43:34,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2024-10-11 04:43:34,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3022. [2024-10-11 04:43:34,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3022 states, 3020 states have (on average 1.429139072847682) internal successors, (4316), 3021 states have internal predecessors, (4316), 0 states have call successors, (0), 0 states 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 04:43:34,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 4316 transitions. [2024-10-11 04:43:34,398 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 4316 transitions. Word has length 57 [2024-10-11 04:43:34,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:34,398 INFO L471 AbstractCegarLoop]: Abstraction has 3022 states and 4316 transitions. [2024-10-11 04:43:34,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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 04:43:34,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 4316 transitions. [2024-10-11 04:43:34,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 04:43:34,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:34,401 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] [2024-10-11 04:43:34,419 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 04:43:34,601 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,SelfDestructingSolverStorable15 [2024-10-11 04:43:34,602 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:34,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:34,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1764927261, now seen corresponding path program 1 times [2024-10-11 04:43:34,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:34,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927108805] [2024-10-11 04:43:34,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:34,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:36,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:36,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927108805] [2024-10-11 04:43:36,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927108805] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:43:36,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446872231] [2024-10-11 04:43:36,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:36,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:36,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:36,949 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 04:43:36,951 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 04:43:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:37,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:43:37,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:43:37,401 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:37,401 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:43:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:38,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446872231] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:43:38,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:43:38,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2024-10-11 04:43:38,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510420484] [2024-10-11 04:43:38,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:43:38,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 04:43:38,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:38,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 04:43:38,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2024-10-11 04:43:38,026 INFO L87 Difference]: Start difference. First operand 3022 states and 4316 transitions. Second operand has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 25 states have internal predecessors, (141), 0 states have call successors, (0), 0 states 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 04:43:38,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:38,712 INFO L93 Difference]: Finished difference Result 7049 states and 9489 transitions. [2024-10-11 04:43:38,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:43:38,713 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 25 states have internal predecessors, (141), 0 states have call successors, (0), 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 58 [2024-10-11 04:43:38,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:38,733 INFO L225 Difference]: With dead ends: 7049 [2024-10-11 04:43:38,733 INFO L226 Difference]: Without dead ends: 5208 [2024-10-11 04:43:38,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=298, Invalid=1034, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 04:43:38,738 INFO L432 NwaCegarLoop]: 1489 mSDtfsCounter, 10443 mSDsluCounter, 3232 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10443 SdHoareTripleChecker+Valid, 4721 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:38,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10443 Valid, 4721 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:43:38,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5208 states. [2024-10-11 04:43:38,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5208 to 5142. [2024-10-11 04:43:38,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5142 states, 5140 states have (on average 1.348443579766537) internal successors, (6931), 5141 states have internal predecessors, (6931), 0 states have call successors, (0), 0 states 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 04:43:38,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5142 states to 5142 states and 6931 transitions. [2024-10-11 04:43:38,906 INFO L78 Accepts]: Start accepts. Automaton has 5142 states and 6931 transitions. Word has length 58 [2024-10-11 04:43:38,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:38,906 INFO L471 AbstractCegarLoop]: Abstraction has 5142 states and 6931 transitions. [2024-10-11 04:43:38,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 25 states have internal predecessors, (141), 0 states have call successors, (0), 0 states 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 04:43:38,907 INFO L276 IsEmpty]: Start isEmpty. Operand 5142 states and 6931 transitions. [2024-10-11 04:43:38,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 04:43:38,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:38,908 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] [2024-10-11 04:43:38,925 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 04:43:39,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 04:43:39,108 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:39,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:39,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1859501361, now seen corresponding path program 1 times [2024-10-11 04:43:39,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:39,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534470055] [2024-10-11 04:43:39,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:39,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:39,451 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 04:43:39,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:39,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534470055] [2024-10-11 04:43:39,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534470055] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:43:39,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512924468] [2024-10-11 04:43:39,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:39,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:39,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:39,455 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 04:43:39,457 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 04:43:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:39,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 04:43:39,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:43:40,127 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 04:43:40,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:43:40,926 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 04:43:40,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512924468] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:43:40,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:43:40,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-10-11 04:43:40,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980945392] [2024-10-11 04:43:40,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:43:40,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 04:43:40,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:40,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 04:43:40,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2024-10-11 04:43:40,928 INFO L87 Difference]: Start difference. First operand 5142 states and 6931 transitions. Second operand has 32 states, 32 states have (on average 4.65625) internal successors, (149), 32 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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 04:43:43,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:43,808 INFO L93 Difference]: Finished difference Result 14701 states and 19039 transitions. [2024-10-11 04:43:43,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-10-11 04:43:43,809 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.65625) internal successors, (149), 32 states have internal predecessors, (149), 0 states have call successors, (0), 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 58 [2024-10-11 04:43:43,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:43,828 INFO L225 Difference]: With dead ends: 14701 [2024-10-11 04:43:43,828 INFO L226 Difference]: Without dead ends: 10839 [2024-10-11 04:43:43,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1630 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1214, Invalid=5592, Unknown=0, NotChecked=0, Total=6806 [2024-10-11 04:43:43,839 INFO L432 NwaCegarLoop]: 1502 mSDtfsCounter, 13925 mSDsluCounter, 15386 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13925 SdHoareTripleChecker+Valid, 16888 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:43,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13925 Valid, 16888 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:43:43,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10839 states. [2024-10-11 04:43:44,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10839 to 7177. [2024-10-11 04:43:44,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7177 states, 7175 states have (on average 1.3123344947735192) internal successors, (9416), 7176 states have internal predecessors, (9416), 0 states have call successors, (0), 0 states 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 04:43:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7177 states to 7177 states and 9416 transitions. [2024-10-11 04:43:44,181 INFO L78 Accepts]: Start accepts. Automaton has 7177 states and 9416 transitions. Word has length 58 [2024-10-11 04:43:44,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:44,182 INFO L471 AbstractCegarLoop]: Abstraction has 7177 states and 9416 transitions. [2024-10-11 04:43:44,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.65625) internal successors, (149), 32 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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 04:43:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 7177 states and 9416 transitions. [2024-10-11 04:43:44,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 04:43:44,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:44,183 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] [2024-10-11 04:43:44,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 04:43:44,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:44,387 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:44,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:44,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1265876288, now seen corresponding path program 1 times [2024-10-11 04:43:44,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:44,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679259380] [2024-10-11 04:43:44,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:44,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:44,706 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:44,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:44,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679259380] [2024-10-11 04:43:44,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679259380] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:43:44,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008885717] [2024-10-11 04:43:44,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:44,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:44,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:44,709 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 04:43:44,711 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 04:43:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:44,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 04:43:44,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:43:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:45,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:43:45,638 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:45,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008885717] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:43:45,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:43:45,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-10-11 04:43:45,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266169092] [2024-10-11 04:43:45,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:43:45,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 04:43:45,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:45,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 04:43:45,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-10-11 04:43:45,643 INFO L87 Difference]: Start difference. First operand 7177 states and 9416 transitions. Second operand has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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 04:43:46,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:46,310 INFO L93 Difference]: Finished difference Result 12753 states and 16437 transitions. [2024-10-11 04:43:46,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 04:43:46,311 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 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 59 [2024-10-11 04:43:46,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:46,326 INFO L225 Difference]: With dead ends: 12753 [2024-10-11 04:43:46,327 INFO L226 Difference]: Without dead ends: 7493 [2024-10-11 04:43:46,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2024-10-11 04:43:46,335 INFO L432 NwaCegarLoop]: 1495 mSDtfsCounter, 14962 mSDsluCounter, 4654 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14962 SdHoareTripleChecker+Valid, 6149 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:46,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14962 Valid, 6149 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:43:46,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7493 states. [2024-10-11 04:43:46,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7493 to 7101. [2024-10-11 04:43:46,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7101 states, 7099 states have (on average 1.301450908578673) internal successors, (9239), 7100 states have internal predecessors, (9239), 0 states have call successors, (0), 0 states 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 04:43:46,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7101 states to 7101 states and 9239 transitions. [2024-10-11 04:43:46,667 INFO L78 Accepts]: Start accepts. Automaton has 7101 states and 9239 transitions. Word has length 59 [2024-10-11 04:43:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:46,668 INFO L471 AbstractCegarLoop]: Abstraction has 7101 states and 9239 transitions. [2024-10-11 04:43:46,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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 04:43:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand 7101 states and 9239 transitions. [2024-10-11 04:43:46,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 04:43:46,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:46,669 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] [2024-10-11 04:43:46,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 04:43:46,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:46,874 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:46,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:46,874 INFO L85 PathProgramCache]: Analyzing trace with hash 743272078, now seen corresponding path program 1 times [2024-10-11 04:43:46,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:46,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270195509] [2024-10-11 04:43:46,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:46,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:47,528 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 04:43:47,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:47,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270195509] [2024-10-11 04:43:47,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270195509] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:43:47,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182649138] [2024-10-11 04:43:47,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:47,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:47,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:47,531 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 04:43:47,533 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 04:43:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:47,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-11 04:43:47,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:43:49,145 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 04:43:49,145 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:43:51,390 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 04:43:51,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182649138] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:43:51,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:43:51,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 17] total 43 [2024-10-11 04:43:51,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430897417] [2024-10-11 04:43:51,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:43:51,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-11 04:43:51,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:51,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-11 04:43:51,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1585, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 04:43:51,393 INFO L87 Difference]: Start difference. First operand 7101 states and 9239 transitions. Second operand has 43 states, 43 states have (on average 3.558139534883721) internal successors, (153), 43 states have internal predecessors, (153), 0 states have call successors, (0), 0 states 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 04:43:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:58,152 INFO L93 Difference]: Finished difference Result 9315 states and 12022 transitions. [2024-10-11 04:43:58,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-10-11 04:43:58,153 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.558139534883721) internal successors, (153), 43 states have internal predecessors, (153), 0 states have call successors, (0), 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 59 [2024-10-11 04:43:58,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:58,168 INFO L225 Difference]: With dead ends: 9315 [2024-10-11 04:43:58,168 INFO L226 Difference]: Without dead ends: 5824 [2024-10-11 04:43:58,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2596 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2067, Invalid=8033, Unknown=0, NotChecked=0, Total=10100 [2024-10-11 04:43:58,177 INFO L432 NwaCegarLoop]: 1523 mSDtfsCounter, 16022 mSDsluCounter, 18586 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16022 SdHoareTripleChecker+Valid, 20109 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:58,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16022 Valid, 20109 Invalid, 1693 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [66 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:43:58,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5824 states. [2024-10-11 04:43:58,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5824 to 5462. [2024-10-11 04:43:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5462 states, 5460 states have (on average 1.31996336996337) internal successors, (7207), 5461 states have internal predecessors, (7207), 0 states have call successors, (0), 0 states 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 04:43:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5462 states to 5462 states and 7207 transitions. [2024-10-11 04:43:58,407 INFO L78 Accepts]: Start accepts. Automaton has 5462 states and 7207 transitions. Word has length 59 [2024-10-11 04:43:58,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:58,407 INFO L471 AbstractCegarLoop]: Abstraction has 5462 states and 7207 transitions. [2024-10-11 04:43:58,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.558139534883721) internal successors, (153), 43 states have internal predecessors, (153), 0 states have call successors, (0), 0 states 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 04:43:58,408 INFO L276 IsEmpty]: Start isEmpty. Operand 5462 states and 7207 transitions. [2024-10-11 04:43:58,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 04:43:58,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:58,408 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] [2024-10-11 04:43:58,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 04:43:58,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:58,613 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:58,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:58,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1533543596, now seen corresponding path program 1 times [2024-10-11 04:43:58,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:58,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086547520] [2024-10-11 04:43:58,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:58,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:44:00,359 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:44:00,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:44:00,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086547520] [2024-10-11 04:44:00,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086547520] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:44:00,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961488800] [2024-10-11 04:44:00,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:44:00,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:44:00,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:44:00,361 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 04:44:00,362 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 04:44:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:44:00,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 04:44:00,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:44:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:44:03,543 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:44:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:44:06,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961488800] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:44:06,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:44:06,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 57 [2024-10-11 04:44:06,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903812647] [2024-10-11 04:44:06,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:44:06,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-10-11 04:44:06,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:44:06,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-10-11 04:44:06,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=2885, Unknown=0, NotChecked=0, Total=3192 [2024-10-11 04:44:06,545 INFO L87 Difference]: Start difference. First operand 5462 states and 7207 transitions. Second operand has 57 states, 57 states have (on average 2.824561403508772) internal successors, (161), 57 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)