./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.BOUNDED-6.pals+Problem12_label03.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.BOUNDED-6.pals+Problem12_label03.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 00976d0f33ca0b9714575e3679f5d33e30ad2cb228857f610050b5b28bb1919c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:41:48,185 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:41:48,252 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:41:48,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:41:48,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:41:48,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:41:48,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:41:48,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:41:48,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:41:48,279 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:41:48,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:41:48,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:41:48,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:41:48,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:41:48,280 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:41:48,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:41:48,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:41:48,281 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:41:48,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:41:48,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:41:48,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:41:48,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:41:48,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:41:48,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:41:48,288 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:41:48,288 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:41:48,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:41:48,289 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:41:48,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:41:48,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:41:48,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:41:48,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:41:48,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:41:48,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:41:48,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:41:48,290 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:41:48,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:41:48,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:41:48,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:41:48,291 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:41:48,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:41:48,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:41:48,293 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 -> 00976d0f33ca0b9714575e3679f5d33e30ad2cb228857f610050b5b28bb1919c [2024-10-11 04:41:48,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:41:48,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:41:48,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:41:48,590 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:41:48,590 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:41:48,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label03.c [2024-10-11 04:41:50,122 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:41:50,584 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:41:50,584 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label03.c [2024-10-11 04:41:50,612 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1f3b8ef9d/a554c1edbf9148c8af52d7104182aa33/FLAG84f130268 [2024-10-11 04:41:50,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1f3b8ef9d/a554c1edbf9148c8af52d7104182aa33 [2024-10-11 04:41:50,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:41:50,630 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:41:50,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:41:50,632 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:41:50,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:41:50,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:41:50" (1/1) ... [2024-10-11 04:41:50,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5360d0f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:50, skipping insertion in model container [2024-10-11 04:41:50,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:41:50" (1/1) ... [2024-10-11 04:41:50,737 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:41:50,998 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.BOUNDED-6.pals+Problem12_label03.c[6354,6367] [2024-10-11 04:41:51,039 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.BOUNDED-6.pals+Problem12_label03.c[8691,8704] [2024-10-11 04:41:51,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:41:51,734 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:41:51,760 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.BOUNDED-6.pals+Problem12_label03.c[6354,6367] [2024-10-11 04:41:51,767 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.BOUNDED-6.pals+Problem12_label03.c[8691,8704] [2024-10-11 04:41:52,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:41:52,136 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:41:52,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:52 WrapperNode [2024-10-11 04:41:52,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:41:52,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:41:52,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:41:52,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:41:52,144 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:41:52" (1/1) ... [2024-10-11 04:41:52,185 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:41:52" (1/1) ... [2024-10-11 04:41:52,419 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4983 [2024-10-11 04:41:52,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:41:52,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:41:52,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:41:52,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:41:52,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:52" (1/1) ... [2024-10-11 04:41:52,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:52" (1/1) ... [2024-10-11 04:41:52,606 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:52" (1/1) ... [2024-10-11 04:41:52,705 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:41:52,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:52" (1/1) ... [2024-10-11 04:41:52,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:52" (1/1) ... [2024-10-11 04:41:52,909 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:52" (1/1) ... [2024-10-11 04:41:52,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:52" (1/1) ... [2024-10-11 04:41:53,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:52" (1/1) ... [2024-10-11 04:41:53,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:52" (1/1) ... [2024-10-11 04:41:53,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:41:53,105 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:41:53,105 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:41:53,105 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:41:53,106 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:52" (1/1) ... [2024-10-11 04:41:53,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:41:53,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:41:53,141 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:41:53,144 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:41:53,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:41:53,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:41:53,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:41:53,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:41:53,448 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:41:53,453 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:41:57,373 INFO L? ?]: Removed 732 outVars from TransFormulas that were not future-live. [2024-10-11 04:41:57,374 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:41:57,423 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:41:57,423 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:41:57,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:41:57 BoogieIcfgContainer [2024-10-11 04:41:57,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:41:57,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:41:57,425 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:41:57,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:41:57,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:41:50" (1/3) ... [2024-10-11 04:41:57,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e9325d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:41:57, skipping insertion in model container [2024-10-11 04:41:57,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:52" (2/3) ... [2024-10-11 04:41:57,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e9325d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:41:57, skipping insertion in model container [2024-10-11 04:41:57,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:41:57" (3/3) ... [2024-10-11 04:41:57,430 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label03.c [2024-10-11 04:41:57,442 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:41:57,442 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:41:57,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:41:57,511 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;@44cd89c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:41:57,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:41:57,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 807 states, 804 states have (on average 1.9800995024875623) internal successors, (1592), 806 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states 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:41:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 04:41:57,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:41:57,525 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:41:57,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:41:57,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:41:57,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1841439881, now seen corresponding path program 1 times [2024-10-11 04:41:57,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:41:57,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594914470] [2024-10-11 04:41:57,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:41:57,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:41:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:41:57,679 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:41:57,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:41:57,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594914470] [2024-10-11 04:41:57,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594914470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:41:57,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:41:57,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:41:57,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575810988] [2024-10-11 04:41:57,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:41:57,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 04:41:57,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:41:57,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 04:41:57,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:41:57,703 INFO L87 Difference]: Start difference. First operand has 807 states, 804 states have (on average 1.9800995024875623) internal successors, (1592), 806 states have internal predecessors, (1592), 0 states have call successors, (0), 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:41:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:41:57,788 INFO L93 Difference]: Finished difference Result 1594 states and 3146 transitions. [2024-10-11 04:41:57,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 04:41:57,794 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:41:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:41:57,814 INFO L225 Difference]: With dead ends: 1594 [2024-10-11 04:41:57,814 INFO L226 Difference]: Without dead ends: 803 [2024-10-11 04:41:57,819 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:41:57,823 INFO L432 NwaCegarLoop]: 1521 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:41:57,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1521 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:41:57,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2024-10-11 04:41:57,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2024-10-11 04:41:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.898876404494382) internal successors, (1521), 802 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states 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:41:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1521 transitions. [2024-10-11 04:41:57,895 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1521 transitions. Word has length 17 [2024-10-11 04:41:57,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:41:57,895 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1521 transitions. [2024-10-11 04:41:57,895 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:41:57,896 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1521 transitions. [2024-10-11 04:41:57,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 04:41:57,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:41:57,896 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:41:57,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:41:57,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:41:57,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:41:57,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1254633867, now seen corresponding path program 1 times [2024-10-11 04:41:57,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:41:57,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845539625] [2024-10-11 04:41:57,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:41:57,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:41:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:41:58,069 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:41:58,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:41:58,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845539625] [2024-10-11 04:41:58,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845539625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:41:58,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:41:58,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:41:58,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410766341] [2024-10-11 04:41:58,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:41:58,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:41:58,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:41:58,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:41:58,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:41:58,076 INFO L87 Difference]: Start difference. First operand 803 states and 1521 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:41:58,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:41:58,168 INFO L93 Difference]: Finished difference Result 864 states and 1616 transitions. [2024-10-11 04:41:58,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:41:58,169 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:41:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:41:58,173 INFO L225 Difference]: With dead ends: 864 [2024-10-11 04:41:58,173 INFO L226 Difference]: Without dead ends: 832 [2024-10-11 04:41:58,173 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:41:58,174 INFO L432 NwaCegarLoop]: 1516 mSDtfsCounter, 45 mSDsluCounter, 3011 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4527 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:41:58,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4527 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:41:58,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-10-11 04:41:58,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 803. [2024-10-11 04:41:58,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.8789013732833957) internal successors, (1505), 802 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states 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:41:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1505 transitions. [2024-10-11 04:41:58,199 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1505 transitions. Word has length 17 [2024-10-11 04:41:58,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:41:58,199 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1505 transitions. [2024-10-11 04:41:58,199 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:41:58,200 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1505 transitions. [2024-10-11 04:41:58,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 04:41:58,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:41:58,200 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:41:58,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:41:58,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:41:58,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:41:58,201 INFO L85 PathProgramCache]: Analyzing trace with hash 210811615, now seen corresponding path program 1 times [2024-10-11 04:41:58,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:41:58,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350792174] [2024-10-11 04:41:58,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:41:58,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:41:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:41:58,247 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:41:58,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:41:58,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350792174] [2024-10-11 04:41:58,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350792174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:41:58,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:41:58,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:41:58,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854381541] [2024-10-11 04:41:58,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:41:58,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:41:58,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:41:58,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:41:58,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:41:58,250 INFO L87 Difference]: Start difference. First operand 803 states and 1505 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:42:01,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:01,708 INFO L93 Difference]: Finished difference Result 2307 states and 4378 transitions. [2024-10-11 04:42:01,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:01,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-11 04:42:01,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:01,716 INFO L225 Difference]: With dead ends: 2307 [2024-10-11 04:42:01,716 INFO L226 Difference]: Without dead ends: 1554 [2024-10-11 04:42:01,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:42:01,718 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 916 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 3091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:01,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 178 Invalid, 3091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 04:42:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2024-10-11 04:42:01,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1554. [2024-10-11 04:42:01,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1552 states have (on average 1.8324742268041236) internal successors, (2844), 1553 states have internal predecessors, (2844), 0 states have call successors, (0), 0 states 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:42:01,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2844 transitions. [2024-10-11 04:42:01,751 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2844 transitions. Word has length 19 [2024-10-11 04:42:01,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:01,752 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 2844 transitions. [2024-10-11 04:42:01,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:42:01,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2844 transitions. [2024-10-11 04:42:01,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 04:42:01,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:01,753 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:42:01,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:42:01,754 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:01,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:01,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1671742577, now seen corresponding path program 1 times [2024-10-11 04:42:01,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:01,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669687273] [2024-10-11 04:42:01,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:01,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:01,917 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:42:01,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:01,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669687273] [2024-10-11 04:42:01,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669687273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:01,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:01,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:42:01,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638171069] [2024-10-11 04:42:01,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:01,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:42:01,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:01,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:42:01,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:42:01,920 INFO L87 Difference]: Start difference. First operand 1554 states and 2844 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:42:02,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:02,045 INFO L93 Difference]: Finished difference Result 1728 states and 3120 transitions. [2024-10-11 04:42:02,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:42:02,046 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:42:02,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:02,053 INFO L225 Difference]: With dead ends: 1728 [2024-10-11 04:42:02,053 INFO L226 Difference]: Without dead ends: 1699 [2024-10-11 04:42:02,054 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:42:02,055 INFO L432 NwaCegarLoop]: 1498 mSDtfsCounter, 4578 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4578 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:02,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4578 Valid, 1841 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:42:02,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2024-10-11 04:42:02,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1581. [2024-10-11 04:42:02,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1579 states have (on average 1.8283723875870805) internal successors, (2887), 1580 states have internal predecessors, (2887), 0 states have call successors, (0), 0 states 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:42:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2887 transitions. [2024-10-11 04:42:02,091 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2887 transitions. Word has length 32 [2024-10-11 04:42:02,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:02,091 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2887 transitions. [2024-10-11 04:42:02,092 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:42:02,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2887 transitions. [2024-10-11 04:42:02,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 04:42:02,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:02,093 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:42:02,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:42:02,094 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:02,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:02,094 INFO L85 PathProgramCache]: Analyzing trace with hash -349538145, now seen corresponding path program 1 times [2024-10-11 04:42:02,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:02,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695224017] [2024-10-11 04:42:02,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:02,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:02,156 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:42:02,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:02,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695224017] [2024-10-11 04:42:02,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695224017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:02,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:02,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:02,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556862025] [2024-10-11 04:42:02,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:02,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:02,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:02,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:02,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:02,158 INFO L87 Difference]: Start difference. First operand 1581 states and 2887 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:42:02,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:02,208 INFO L93 Difference]: Finished difference Result 1682 states and 3046 transitions. [2024-10-11 04:42:02,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:02,209 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:42:02,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:02,215 INFO L225 Difference]: With dead ends: 1682 [2024-10-11 04:42:02,215 INFO L226 Difference]: Without dead ends: 1626 [2024-10-11 04:42:02,217 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:42:02,218 INFO L432 NwaCegarLoop]: 1500 mSDtfsCounter, 1464 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:02,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1540 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2024-10-11 04:42:02,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1624. [2024-10-11 04:42:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1622 states have (on average 1.8205918618988903) internal successors, (2953), 1623 states have internal predecessors, (2953), 0 states have call successors, (0), 0 states 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:42:02,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2953 transitions. [2024-10-11 04:42:02,255 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2953 transitions. Word has length 34 [2024-10-11 04:42:02,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:02,256 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2953 transitions. [2024-10-11 04:42:02,256 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:42:02,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2953 transitions. [2024-10-11 04:42:02,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 04:42:02,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:02,258 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:42:02,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:42:02,259 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:02,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:02,259 INFO L85 PathProgramCache]: Analyzing trace with hash -347393193, now seen corresponding path program 1 times [2024-10-11 04:42:02,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:02,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838584188] [2024-10-11 04:42:02,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:02,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:02,453 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:42:02,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:02,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838584188] [2024-10-11 04:42:02,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838584188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:02,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:02,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:42:02,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437474955] [2024-10-11 04:42:02,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:02,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:42:02,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:02,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:42:02,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:42:02,456 INFO L87 Difference]: Start difference. First operand 1624 states and 2953 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:42:02,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:02,538 INFO L93 Difference]: Finished difference Result 1725 states and 3109 transitions. [2024-10-11 04:42:02,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:42:02,539 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:42:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:02,545 INFO L225 Difference]: With dead ends: 1725 [2024-10-11 04:42:02,545 INFO L226 Difference]: Without dead ends: 1626 [2024-10-11 04:42:02,546 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:42:02,547 INFO L432 NwaCegarLoop]: 1497 mSDtfsCounter, 2942 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2942 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:02,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2942 Valid, 1582 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:02,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2024-10-11 04:42:02,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1624. [2024-10-11 04:42:02,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1622 states have (on average 1.8193588162762022) internal successors, (2951), 1623 states have internal predecessors, (2951), 0 states have call successors, (0), 0 states 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:42:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2951 transitions. [2024-10-11 04:42:02,584 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2951 transitions. Word has length 34 [2024-10-11 04:42:02,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:02,584 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2951 transitions. [2024-10-11 04:42:02,585 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:42:02,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2951 transitions. [2024-10-11 04:42:02,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 04:42:02,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:02,586 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:42:02,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:42:02,586 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:02,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:02,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1987358074, now seen corresponding path program 1 times [2024-10-11 04:42:02,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:02,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776121870] [2024-10-11 04:42:02,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:02,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:02,698 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:42:02,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:02,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776121870] [2024-10-11 04:42:02,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776121870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:02,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:02,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:42:02,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508739950] [2024-10-11 04:42:02,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:02,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:42:02,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:02,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:42:02,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:42:02,701 INFO L87 Difference]: Start difference. First operand 1624 states and 2951 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:42:02,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:02,748 INFO L93 Difference]: Finished difference Result 1630 states and 2958 transitions. [2024-10-11 04:42:02,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:42:02,748 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:42:02,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:02,755 INFO L225 Difference]: With dead ends: 1630 [2024-10-11 04:42:02,756 INFO L226 Difference]: Without dead ends: 1628 [2024-10-11 04:42:02,756 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:42:02,757 INFO L432 NwaCegarLoop]: 1501 mSDtfsCounter, 0 mSDsluCounter, 2994 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4495 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:42:02,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4495 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:02,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2024-10-11 04:42:02,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1628. [2024-10-11 04:42:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1626 states have (on average 1.8167281672816729) internal successors, (2954), 1627 states have internal predecessors, (2954), 0 states have call successors, (0), 0 states 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:42:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2954 transitions. [2024-10-11 04:42:02,797 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2954 transitions. Word has length 35 [2024-10-11 04:42:02,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:02,797 INFO L471 AbstractCegarLoop]: Abstraction has 1628 states and 2954 transitions. [2024-10-11 04:42:02,797 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:42:02,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2954 transitions. [2024-10-11 04:42:02,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:42:02,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:02,798 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:42:02,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:42:02,799 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:02,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:02,799 INFO L85 PathProgramCache]: Analyzing trace with hash 177157591, now seen corresponding path program 1 times [2024-10-11 04:42:02,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:02,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034096411] [2024-10-11 04:42:02,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:02,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:02,845 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:42:02,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:02,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034096411] [2024-10-11 04:42:02,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034096411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:02,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:02,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:02,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341188666] [2024-10-11 04:42:02,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:02,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:02,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:02,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:02,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:02,847 INFO L87 Difference]: Start difference. First operand 1628 states and 2954 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:42:02,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:02,882 INFO L93 Difference]: Finished difference Result 1742 states and 3127 transitions. [2024-10-11 04:42:02,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:02,883 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:42:02,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:02,889 INFO L225 Difference]: With dead ends: 1742 [2024-10-11 04:42:02,889 INFO L226 Difference]: Without dead ends: 1682 [2024-10-11 04:42:02,889 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:42:02,891 INFO L432 NwaCegarLoop]: 1532 mSDtfsCounter, 1474 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1578 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:42:02,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1578 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2024-10-11 04:42:02,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1680. [2024-10-11 04:42:02,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1678 states have (on average 1.8063170441001193) internal successors, (3031), 1679 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states 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:42:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 3031 transitions. [2024-10-11 04:42:02,928 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 3031 transitions. Word has length 36 [2024-10-11 04:42:02,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:02,928 INFO L471 AbstractCegarLoop]: Abstraction has 1680 states and 3031 transitions. [2024-10-11 04:42:02,928 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:42:02,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 3031 transitions. [2024-10-11 04:42:02,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:42:02,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:02,930 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:42:02,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:42:02,930 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:02,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:02,931 INFO L85 PathProgramCache]: Analyzing trace with hash -448498473, now seen corresponding path program 1 times [2024-10-11 04:42:02,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:02,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030553689] [2024-10-11 04:42:02,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:02,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:03,008 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:42:03,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:03,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030553689] [2024-10-11 04:42:03,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030553689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:03,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:03,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:03,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903374246] [2024-10-11 04:42:03,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:03,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:03,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:03,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:03,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:03,012 INFO L87 Difference]: Start difference. First operand 1680 states and 3031 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:42:03,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:03,048 INFO L93 Difference]: Finished difference Result 1962 states and 3451 transitions. [2024-10-11 04:42:03,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:03,049 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:42:03,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:03,056 INFO L225 Difference]: With dead ends: 1962 [2024-10-11 04:42:03,056 INFO L226 Difference]: Without dead ends: 1809 [2024-10-11 04:42:03,057 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:42:03,059 INFO L432 NwaCegarLoop]: 1534 mSDtfsCounter, 1472 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 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:42:03,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1472 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:42:03,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2024-10-11 04:42:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1807. [2024-10-11 04:42:03,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1805 states have (on average 1.7800554016620498) internal successors, (3213), 1806 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states 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:42:03,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 3213 transitions. [2024-10-11 04:42:03,103 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 3213 transitions. Word has length 36 [2024-10-11 04:42:03,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:03,103 INFO L471 AbstractCegarLoop]: Abstraction has 1807 states and 3213 transitions. [2024-10-11 04:42:03,103 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:42:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 3213 transitions. [2024-10-11 04:42:03,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:42:03,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:03,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:42:03,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:42:03,104 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:03,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash 440234967, now seen corresponding path program 1 times [2024-10-11 04:42:03,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:03,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164710139] [2024-10-11 04:42:03,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:03,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:03,146 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:42:03,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:03,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164710139] [2024-10-11 04:42:03,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164710139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:03,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:03,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:03,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19235938] [2024-10-11 04:42:03,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:03,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:03,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:03,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:03,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:03,151 INFO L87 Difference]: Start difference. First operand 1807 states and 3213 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:42:03,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:03,192 INFO L93 Difference]: Finished difference Result 2319 states and 3955 transitions. [2024-10-11 04:42:03,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:03,193 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:42:03,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:03,199 INFO L225 Difference]: With dead ends: 2319 [2024-10-11 04:42:03,199 INFO L226 Difference]: Without dead ends: 2039 [2024-10-11 04:42:03,199 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:42:03,200 INFO L432 NwaCegarLoop]: 1532 mSDtfsCounter, 1470 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1586 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:42:03,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1586 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:03,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2024-10-11 04:42:03,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2037. [2024-10-11 04:42:03,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2037 states, 2035 states have (on average 1.7341523341523342) internal successors, (3529), 2036 states have internal predecessors, (3529), 0 states have call successors, (0), 0 states 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:42:03,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 3529 transitions. [2024-10-11 04:42:03,232 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 3529 transitions. Word has length 36 [2024-10-11 04:42:03,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:03,232 INFO L471 AbstractCegarLoop]: Abstraction has 2037 states and 3529 transitions. [2024-10-11 04:42:03,232 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:42:03,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 3529 transitions. [2024-10-11 04:42:03,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:42:03,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:03,233 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:42:03,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:42:03,233 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:03,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:03,234 INFO L85 PathProgramCache]: Analyzing trace with hash -615837049, now seen corresponding path program 1 times [2024-10-11 04:42:03,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:03,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052811947] [2024-10-11 04:42:03,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:03,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:03,367 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:42:03,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:03,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052811947] [2024-10-11 04:42:03,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052811947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:03,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:03,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:42:03,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164452114] [2024-10-11 04:42:03,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:03,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:42:03,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:03,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:42:03,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:42:03,369 INFO L87 Difference]: Start difference. First operand 2037 states and 3529 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:03,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:03,496 INFO L93 Difference]: Finished difference Result 3545 states and 5681 transitions. [2024-10-11 04:42:03,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:42:03,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 04:42:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:03,510 INFO L225 Difference]: With dead ends: 3545 [2024-10-11 04:42:03,511 INFO L226 Difference]: Without dead ends: 3175 [2024-10-11 04:42:03,512 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:42:03,513 INFO L432 NwaCegarLoop]: 1540 mSDtfsCounter, 3031 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3031 SdHoareTripleChecker+Valid, 3153 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:03,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3031 Valid, 3153 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:42:03,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2024-10-11 04:42:03,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 2477. [2024-10-11 04:42:03,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2475 states have (on average 1.6763636363636363) internal successors, (4149), 2476 states have internal predecessors, (4149), 0 states have call successors, (0), 0 states 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:42:03,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 4149 transitions. [2024-10-11 04:42:03,580 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 4149 transitions. Word has length 50 [2024-10-11 04:42:03,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:03,581 INFO L471 AbstractCegarLoop]: Abstraction has 2477 states and 4149 transitions. [2024-10-11 04:42:03,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:03,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 4149 transitions. [2024-10-11 04:42:03,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:42:03,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:03,583 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:42:03,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:42:03,584 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:03,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:03,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1241493113, now seen corresponding path program 1 times [2024-10-11 04:42:03,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:03,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091898610] [2024-10-11 04:42:03,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:03,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:03,719 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:42:03,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:03,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091898610] [2024-10-11 04:42:03,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091898610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:03,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:03,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:42:03,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107877838] [2024-10-11 04:42:03,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:03,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:42:03,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:03,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:42:03,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:42:03,722 INFO L87 Difference]: Start difference. First operand 2477 states and 4149 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:42:03,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:03,851 INFO L93 Difference]: Finished difference Result 4053 states and 6401 transitions. [2024-10-11 04:42:03,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:42:03,852 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:42:03,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:03,865 INFO L225 Difference]: With dead ends: 4053 [2024-10-11 04:42:03,865 INFO L226 Difference]: Without dead ends: 3543 [2024-10-11 04:42:03,867 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:42:03,867 INFO L432 NwaCegarLoop]: 1539 mSDtfsCounter, 3033 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3033 SdHoareTripleChecker+Valid, 3140 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:03,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3033 Valid, 3140 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:03,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2024-10-11 04:42:03,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 3169. [2024-10-11 04:42:03,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3169 states, 3167 states have (on average 1.6169876855067888) internal successors, (5121), 3168 states have internal predecessors, (5121), 0 states have call successors, (0), 0 states 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:42:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3169 states to 3169 states and 5121 transitions. [2024-10-11 04:42:03,960 INFO L78 Accepts]: Start accepts. Automaton has 3169 states and 5121 transitions. Word has length 50 [2024-10-11 04:42:03,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:03,961 INFO L471 AbstractCegarLoop]: Abstraction has 3169 states and 5121 transitions. [2024-10-11 04:42:03,961 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:42:03,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3169 states and 5121 transitions. [2024-10-11 04:42:03,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:42:03,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:03,962 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:42:03,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:42:03,963 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:03,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:03,963 INFO L85 PathProgramCache]: Analyzing trace with hash -352759673, now seen corresponding path program 1 times [2024-10-11 04:42:03,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:03,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636697316] [2024-10-11 04:42:03,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:03,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:04,048 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:42:04,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:04,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636697316] [2024-10-11 04:42:04,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636697316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:04,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:04,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:42:04,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954756640] [2024-10-11 04:42:04,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:04,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:42:04,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:04,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:42:04,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:42:04,051 INFO L87 Difference]: Start difference. First operand 3169 states and 5121 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:42:04,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:04,181 INFO L93 Difference]: Finished difference Result 4561 states and 7117 transitions. [2024-10-11 04:42:04,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:42:04,182 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:42:04,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:04,191 INFO L225 Difference]: With dead ends: 4561 [2024-10-11 04:42:04,192 INFO L226 Difference]: Without dead ends: 4051 [2024-10-11 04:42:04,193 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:42:04,194 INFO L432 NwaCegarLoop]: 1538 mSDtfsCounter, 3041 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3041 SdHoareTripleChecker+Valid, 3134 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:04,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3041 Valid, 3134 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:04,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4051 states. [2024-10-11 04:42:04,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4051 to 3677. [2024-10-11 04:42:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3677 states, 3675 states have (on average 1.5882993197278912) internal successors, (5837), 3676 states have internal predecessors, (5837), 0 states have call successors, (0), 0 states 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:42:04,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 5837 transitions. [2024-10-11 04:42:04,312 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 5837 transitions. Word has length 50 [2024-10-11 04:42:04,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:04,312 INFO L471 AbstractCegarLoop]: Abstraction has 3677 states and 5837 transitions. [2024-10-11 04:42:04,312 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:42:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 5837 transitions. [2024-10-11 04:42:04,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 04:42:04,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:04,314 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] [2024-10-11 04:42:04,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:42:04,315 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:04,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:04,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1472152007, now seen corresponding path program 1 times [2024-10-11 04:42:04,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:04,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824853156] [2024-10-11 04:42:04,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:04,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:04,426 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:42:04,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:04,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824853156] [2024-10-11 04:42:04,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824853156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:04,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:04,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:04,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934178118] [2024-10-11 04:42:04,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:04,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:04,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:04,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:04,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:04,429 INFO L87 Difference]: Start difference. First operand 3677 states and 5837 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:04,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:04,606 INFO L93 Difference]: Finished difference Result 5829 states and 8875 transitions. [2024-10-11 04:42:04,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:04,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-11 04:42:04,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:04,620 INFO L225 Difference]: With dead ends: 5829 [2024-10-11 04:42:04,621 INFO L226 Difference]: Without dead ends: 3679 [2024-10-11 04:42:04,624 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:42:04,625 INFO L432 NwaCegarLoop]: 1520 mSDtfsCounter, 29 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3011 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:42:04,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3011 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3679 states. [2024-10-11 04:42:04,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3679 to 3677. [2024-10-11 04:42:04,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3677 states, 3675 states have (on average 1.5746938775510204) internal successors, (5787), 3676 states have internal predecessors, (5787), 0 states have call successors, (0), 0 states 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:42:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 5787 transitions. [2024-10-11 04:42:04,748 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 5787 transitions. Word has length 51 [2024-10-11 04:42:04,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:04,748 INFO L471 AbstractCegarLoop]: Abstraction has 3677 states and 5787 transitions. [2024-10-11 04:42:04,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 5787 transitions. [2024-10-11 04:42:04,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 04:42:04,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:04,750 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:42:04,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:42:04,750 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:04,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:04,751 INFO L85 PathProgramCache]: Analyzing trace with hash 805481295, now seen corresponding path program 1 times [2024-10-11 04:42:04,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:04,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914790331] [2024-10-11 04:42:04,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:04,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:04,834 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:42:04,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:04,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914790331] [2024-10-11 04:42:04,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914790331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:04,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:04,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:04,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715639168] [2024-10-11 04:42:04,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:04,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:04,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:04,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:04,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:04,835 INFO L87 Difference]: Start difference. First operand 3677 states and 5787 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:42:04,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:04,885 INFO L93 Difference]: Finished difference Result 4523 states and 6974 transitions. [2024-10-11 04:42:04,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:04,886 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:42:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:04,891 INFO L225 Difference]: With dead ends: 4523 [2024-10-11 04:42:04,891 INFO L226 Difference]: Without dead ends: 2373 [2024-10-11 04:42:04,893 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:42:04,893 INFO L432 NwaCegarLoop]: 1518 mSDtfsCounter, 23 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3008 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:42:04,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3008 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:04,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2024-10-11 04:42:04,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2366. [2024-10-11 04:42:04,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 2364 states have (on average 1.6759729272419628) internal successors, (3962), 2365 states have internal predecessors, (3962), 0 states have call successors, (0), 0 states 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:42:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3962 transitions. [2024-10-11 04:42:04,958 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3962 transitions. Word has length 52 [2024-10-11 04:42:04,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:04,958 INFO L471 AbstractCegarLoop]: Abstraction has 2366 states and 3962 transitions. [2024-10-11 04:42:04,959 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:42:04,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3962 transitions. [2024-10-11 04:42:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 04:42:04,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:04,960 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] [2024-10-11 04:42:04,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:42:04,961 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:04,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:04,961 INFO L85 PathProgramCache]: Analyzing trace with hash -441855801, now seen corresponding path program 1 times [2024-10-11 04:42:04,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:04,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233507542] [2024-10-11 04:42:04,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:04,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:05,060 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:42:05,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:05,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233507542] [2024-10-11 04:42:05,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233507542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:05,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:05,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:05,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327897001] [2024-10-11 04:42:05,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:05,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:05,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:05,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:05,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:05,064 INFO L87 Difference]: Start difference. First operand 2366 states and 3962 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:42:05,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:05,111 INFO L93 Difference]: Finished difference Result 2784 states and 4540 transitions. [2024-10-11 04:42:05,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:05,112 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:42:05,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:05,117 INFO L225 Difference]: With dead ends: 2784 [2024-10-11 04:42:05,117 INFO L226 Difference]: Without dead ends: 1954 [2024-10-11 04:42:05,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:05,120 INFO L432 NwaCegarLoop]: 1512 mSDtfsCounter, 25 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2987 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:42:05,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2987 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:05,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2024-10-11 04:42:05,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1952. [2024-10-11 04:42:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1950 states have (on average 1.731794871794872) internal successors, (3377), 1951 states have internal predecessors, (3377), 0 states have call successors, (0), 0 states 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:42:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 3377 transitions. [2024-10-11 04:42:05,162 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 3377 transitions. Word has length 53 [2024-10-11 04:42:05,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:05,163 INFO L471 AbstractCegarLoop]: Abstraction has 1952 states and 3377 transitions. [2024-10-11 04:42:05,163 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:42:05,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 3377 transitions. [2024-10-11 04:42:05,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:42:05,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:05,164 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] [2024-10-11 04:42:05,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 04:42:05,164 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:05,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:05,165 INFO L85 PathProgramCache]: Analyzing trace with hash -448750379, now seen corresponding path program 1 times [2024-10-11 04:42:05,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:05,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662055186] [2024-10-11 04:42:05,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:05,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:06,813 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:42:06,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:06,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662055186] [2024-10-11 04:42:06,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662055186] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:42:06,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886444232] [2024-10-11 04:42:06,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:06,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:42:06,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:42:06,816 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:42:06,817 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:42:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:06,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:42:06,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:42:07,290 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:42:07,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:42:07,834 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:42:07,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886444232] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:42:07,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:42:07,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2024-10-11 04:42:07,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337778936] [2024-10-11 04:42:07,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:42:07,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 04:42:07,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:07,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 04:42:07,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2024-10-11 04:42:07,837 INFO L87 Difference]: Start difference. First operand 1952 states and 3377 transitions. Second operand has 28 states, 28 states have (on average 5.071428571428571) internal successors, (142), 27 states have internal predecessors, (142), 0 states have call successors, (0), 0 states 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:42:11,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:11,040 INFO L93 Difference]: Finished difference Result 3510 states and 5497 transitions. [2024-10-11 04:42:11,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-11 04:42:11,041 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.071428571428571) internal successors, (142), 27 states have internal predecessors, (142), 0 states have call successors, (0), 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:42:11,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:11,048 INFO L225 Difference]: With dead ends: 3510 [2024-10-11 04:42:11,048 INFO L226 Difference]: Without dead ends: 3094 [2024-10-11 04:42:11,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=813, Invalid=3093, Unknown=0, NotChecked=0, Total=3906 [2024-10-11 04:42:11,051 INFO L432 NwaCegarLoop]: 1477 mSDtfsCounter, 27389 mSDsluCounter, 6194 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27389 SdHoareTripleChecker+Valid, 7671 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:11,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27389 Valid, 7671 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 04:42:11,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2024-10-11 04:42:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 3041. [2024-10-11 04:42:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3041 states, 3039 states have (on average 1.5850608752879236) internal successors, (4817), 3040 states have internal predecessors, (4817), 0 states have call successors, (0), 0 states 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:42:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4817 transitions. [2024-10-11 04:42:11,129 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4817 transitions. Word has length 55 [2024-10-11 04:42:11,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:11,129 INFO L471 AbstractCegarLoop]: Abstraction has 3041 states and 4817 transitions. [2024-10-11 04:42:11,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.071428571428571) internal successors, (142), 27 states have internal predecessors, (142), 0 states have call successors, (0), 0 states 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:42:11,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4817 transitions. [2024-10-11 04:42:11,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 04:42:11,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:11,131 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] [2024-10-11 04:42:11,150 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:42:11,332 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,SelfDestructingSolverStorable16 [2024-10-11 04:42:11,333 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:11,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:11,333 INFO L85 PathProgramCache]: Analyzing trace with hash -248115839, now seen corresponding path program 1 times [2024-10-11 04:42:11,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:11,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849587951] [2024-10-11 04:42:11,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:11,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:11,603 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:42:11,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:11,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849587951] [2024-10-11 04:42:11,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849587951] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:42:11,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805675842] [2024-10-11 04:42:11,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:11,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:42:11,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:42:11,606 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:42:11,607 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:42:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:11,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:42:11,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:42:11,980 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:42:11,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:42:12,685 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:42:12,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805675842] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:42:12,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:42:12,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-10-11 04:42:12,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513196583] [2024-10-11 04:42:12,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:42:12,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 04:42:12,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:12,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 04:42:12,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2024-10-11 04:42:12,687 INFO L87 Difference]: Start difference. First operand 3041 states and 4817 transitions. Second operand has 23 states, 23 states have (on average 5.260869565217392) internal successors, (121), 22 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:13,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:13,152 INFO L93 Difference]: Finished difference Result 5837 states and 8573 transitions. [2024-10-11 04:42:13,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 04:42:13,153 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.260869565217392) internal successors, (121), 22 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-11 04:42:13,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:13,159 INFO L225 Difference]: With dead ends: 5837 [2024-10-11 04:42:13,160 INFO L226 Difference]: Without dead ends: 4332 [2024-10-11 04:42:13,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=692, Unknown=0, NotChecked=0, Total=930 [2024-10-11 04:42:13,162 INFO L432 NwaCegarLoop]: 1481 mSDtfsCounter, 10572 mSDsluCounter, 4626 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10572 SdHoareTripleChecker+Valid, 6107 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:13,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10572 Valid, 6107 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:42:13,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4332 states. [2024-10-11 04:42:13,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4332 to 4328. [2024-10-11 04:42:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4328 states, 4326 states have (on average 1.5108645399907537) internal successors, (6536), 4327 states have internal predecessors, (6536), 0 states have call successors, (0), 0 states 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:42:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4328 states to 4328 states and 6536 transitions. [2024-10-11 04:42:13,251 INFO L78 Accepts]: Start accepts. Automaton has 4328 states and 6536 transitions. Word has length 56 [2024-10-11 04:42:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:13,252 INFO L471 AbstractCegarLoop]: Abstraction has 4328 states and 6536 transitions. [2024-10-11 04:42:13,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.260869565217392) internal successors, (121), 22 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 4328 states and 6536 transitions. [2024-10-11 04:42:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 04:42:13,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:13,254 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] [2024-10-11 04:42:13,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 04:42:13,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 04:42:13,454 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:13,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:13,455 INFO L85 PathProgramCache]: Analyzing trace with hash -988630143, now seen corresponding path program 1 times [2024-10-11 04:42:13,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:13,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670359575] [2024-10-11 04:42:13,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:13,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:13,745 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:42:13,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:13,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670359575] [2024-10-11 04:42:13,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670359575] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:42:13,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33327000] [2024-10-11 04:42:13,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:13,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:42:13,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:42:13,748 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:42:13,749 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:42:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:13,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 04:42:13,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:42:14,092 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:42:14,092 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:42:14,602 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:42:14,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33327000] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:42:14,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:42:14,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-10-11 04:42:14,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616165451] [2024-10-11 04:42:14,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:42:14,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 04:42:14,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:14,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 04:42:14,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2024-10-11 04:42:14,605 INFO L87 Difference]: Start difference. First operand 4328 states and 6536 transitions. Second operand has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 21 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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:42:15,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:15,367 INFO L93 Difference]: Finished difference Result 9446 states and 13388 transitions. [2024-10-11 04:42:15,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 04:42:15,368 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 21 states have internal predecessors, (127), 0 states have call successors, (0), 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 56 [2024-10-11 04:42:15,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:15,396 INFO L225 Difference]: With dead ends: 9446 [2024-10-11 04:42:15,397 INFO L226 Difference]: Without dead ends: 6654 [2024-10-11 04:42:15,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=788, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 04:42:15,411 INFO L432 NwaCegarLoop]: 1488 mSDtfsCounter, 12012 mSDsluCounter, 4693 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12012 SdHoareTripleChecker+Valid, 6181 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:15,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12012 Valid, 6181 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 04:42:15,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6654 states. [2024-10-11 04:42:15,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6654 to 6182. [2024-10-11 04:42:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6182 states, 6180 states have (on average 1.4478964401294498) internal successors, (8948), 6181 states have internal predecessors, (8948), 0 states have call successors, (0), 0 states 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:42:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6182 states to 6182 states and 8948 transitions. [2024-10-11 04:42:15,968 INFO L78 Accepts]: Start accepts. Automaton has 6182 states and 8948 transitions. Word has length 56 [2024-10-11 04:42:15,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:15,972 INFO L471 AbstractCegarLoop]: Abstraction has 6182 states and 8948 transitions. [2024-10-11 04:42:15,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 21 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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:42:15,973 INFO L276 IsEmpty]: Start isEmpty. Operand 6182 states and 8948 transitions. [2024-10-11 04:42:15,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 04:42:15,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:15,974 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] [2024-10-11 04:42:16,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 04:42:16,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:42:16,176 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:16,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:16,179 INFO L85 PathProgramCache]: Analyzing trace with hash 303878803, now seen corresponding path program 1 times [2024-10-11 04:42:16,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:16,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726513211] [2024-10-11 04:42:16,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:16,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:17,566 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:42:17,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:17,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726513211] [2024-10-11 04:42:17,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726513211] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:42:17,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483302867] [2024-10-11 04:42:17,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:17,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:42:17,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:42:17,571 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:42:17,572 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:42:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:17,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 04:42:17,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:42:18,889 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:42:18,890 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:42:19,808 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:42:19,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483302867] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:42:19,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:42:19,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 30 [2024-10-11 04:42:19,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005094304] [2024-10-11 04:42:19,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:42:19,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 04:42:19,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:19,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 04:42:19,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2024-10-11 04:42:19,811 INFO L87 Difference]: Start difference. First operand 6182 states and 8948 transitions. Second operand has 30 states, 30 states have (on average 4.133333333333334) internal successors, (124), 30 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:42:20,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:20,945 INFO L93 Difference]: Finished difference Result 9398 states and 13217 transitions. [2024-10-11 04:42:20,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 04:42:20,946 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.133333333333334) internal successors, (124), 30 states have internal predecessors, (124), 0 states have call successors, (0), 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:42:20,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:20,954 INFO L225 Difference]: With dead ends: 9398 [2024-10-11 04:42:20,955 INFO L226 Difference]: Without dead ends: 7332 [2024-10-11 04:42:20,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=457, Invalid=1705, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 04:42:20,958 INFO L432 NwaCegarLoop]: 1491 mSDtfsCounter, 11098 mSDsluCounter, 14875 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11098 SdHoareTripleChecker+Valid, 16366 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:20,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11098 Valid, 16366 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 04:42:20,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7332 states. [2024-10-11 04:42:21,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7332 to 5766. [2024-10-11 04:42:21,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5766 states, 5764 states have (on average 1.4512491325468424) internal successors, (8365), 5765 states have internal predecessors, (8365), 0 states have call successors, (0), 0 states 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:42:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5766 states to 5766 states and 8365 transitions. [2024-10-11 04:42:21,078 INFO L78 Accepts]: Start accepts. Automaton has 5766 states and 8365 transitions. Word has length 57 [2024-10-11 04:42:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:21,078 INFO L471 AbstractCegarLoop]: Abstraction has 5766 states and 8365 transitions. [2024-10-11 04:42:21,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.133333333333334) internal successors, (124), 30 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:42:21,079 INFO L276 IsEmpty]: Start isEmpty. Operand 5766 states and 8365 transitions. [2024-10-11 04:42:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 04:42:21,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:21,079 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] [2024-10-11 04:42:21,099 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:42:21,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:42:21,284 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:21,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:21,284 INFO L85 PathProgramCache]: Analyzing trace with hash -168351689, now seen corresponding path program 1 times [2024-10-11 04:42:21,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:21,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827137402] [2024-10-11 04:42:21,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:21,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:21,930 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:42:21,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:21,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827137402] [2024-10-11 04:42:21,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827137402] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:42:21,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857004622] [2024-10-11 04:42:21,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:21,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:42:21,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:42:21,933 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:42:21,934 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:42:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:22,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 04:42:22,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:42:23,481 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:42:23,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:42:25,730 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:42:25,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857004622] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:42:25,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:42:25,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 16] total 38 [2024-10-11 04:42:25,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679361025] [2024-10-11 04:42:25,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:42:25,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-11 04:42:25,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:25,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-11 04:42:25,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1236, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 04:42:25,733 INFO L87 Difference]: Start difference. First operand 5766 states and 8365 transitions. Second operand has 38 states, 38 states have (on average 4.0) internal successors, (152), 38 states have internal predecessors, (152), 0 states have call successors, (0), 0 states 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:42:38,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:38,860 INFO L93 Difference]: Finished difference Result 9386 states and 13109 transitions. [2024-10-11 04:42:38,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-10-11 04:42:38,861 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.0) internal successors, (152), 38 states have internal predecessors, (152), 0 states have call successors, (0), 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:42:38,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:38,871 INFO L225 Difference]: With dead ends: 9386 [2024-10-11 04:42:38,871 INFO L226 Difference]: Without dead ends: 6264 [2024-10-11 04:42:38,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4094 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=2745, Invalid=10365, Unknown=0, NotChecked=0, Total=13110 [2024-10-11 04:42:38,879 INFO L432 NwaCegarLoop]: 1517 mSDtfsCounter, 18904 mSDsluCounter, 16951 mSDsCounter, 0 mSdLazyCounter, 1718 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18904 SdHoareTripleChecker+Valid, 18468 SdHoareTripleChecker+Invalid, 1780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:38,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18904 Valid, 18468 Invalid, 1780 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 1718 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:42:38,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6264 states. [2024-10-11 04:42:39,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6264 to 5446. [2024-10-11 04:42:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5446 states, 5444 states have (on average 1.4588537839823659) internal successors, (7942), 5445 states have internal predecessors, (7942), 0 states have call successors, (0), 0 states 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:42:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5446 states to 5446 states and 7942 transitions. [2024-10-11 04:42:39,058 INFO L78 Accepts]: Start accepts. Automaton has 5446 states and 7942 transitions. Word has length 57 [2024-10-11 04:42:39,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:39,058 INFO L471 AbstractCegarLoop]: Abstraction has 5446 states and 7942 transitions. [2024-10-11 04:42:39,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.0) internal successors, (152), 38 states have internal predecessors, (152), 0 states have call successors, (0), 0 states 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:42:39,059 INFO L276 IsEmpty]: Start isEmpty. Operand 5446 states and 7942 transitions. [2024-10-11 04:42:39,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 04:42:39,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:39,060 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:39,080 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:42:39,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:42:39,264 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:39,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:39,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1496708147, now seen corresponding path program 1 times [2024-10-11 04:42:39,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:39,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872318897] [2024-10-11 04:42:39,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:39,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:39,382 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:42:39,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:39,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872318897] [2024-10-11 04:42:39,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872318897] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:42:39,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794655065] [2024-10-11 04:42:39,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:39,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:42:39,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:42:39,385 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:42:39,386 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:42:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:39,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 04:42:39,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:42:39,546 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:42:39,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:42:39,723 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:42:39,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794655065] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:42:39,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:42:39,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2024-10-11 04:42:39,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413849904] [2024-10-11 04:42:39,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:42:39,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 04:42:39,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:39,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 04:42:39,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:42:39,726 INFO L87 Difference]: Start difference. First operand 5446 states and 7942 transitions. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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:42:40,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:40,055 INFO L93 Difference]: Finished difference Result 11473 states and 15643 transitions. [2024-10-11 04:42:40,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:42:40,055 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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 58 [2024-10-11 04:42:40,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:40,067 INFO L225 Difference]: With dead ends: 11473 [2024-10-11 04:42:40,067 INFO L226 Difference]: Without dead ends: 7563 [2024-10-11 04:42:40,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:42:40,075 INFO L432 NwaCegarLoop]: 1510 mSDtfsCounter, 2956 mSDsluCounter, 3123 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2956 SdHoareTripleChecker+Valid, 4633 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:40,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2956 Valid, 4633 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:40,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7563 states. [2024-10-11 04:42:40,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7563 to 7208. [2024-10-11 04:42:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7208 states, 7206 states have (on average 1.3726061615320566) internal successors, (9891), 7207 states have internal predecessors, (9891), 0 states have call successors, (0), 0 states 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:42:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7208 states to 7208 states and 9891 transitions. [2024-10-11 04:42:40,440 INFO L78 Accepts]: Start accepts. Automaton has 7208 states and 9891 transitions. Word has length 58 [2024-10-11 04:42:40,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:40,440 INFO L471 AbstractCegarLoop]: Abstraction has 7208 states and 9891 transitions. [2024-10-11 04:42:40,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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:42:40,440 INFO L276 IsEmpty]: Start isEmpty. Operand 7208 states and 9891 transitions. [2024-10-11 04:42:40,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 04:42:40,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:40,442 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:40,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 04:42:40,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 04:42:40,643 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:40,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:40,644 INFO L85 PathProgramCache]: Analyzing trace with hash -373076858, now seen corresponding path program 1 times [2024-10-11 04:42:40,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:40,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375618699] [2024-10-11 04:42:40,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:40,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:40,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:40,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:40,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375618699] [2024-10-11 04:42:40,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375618699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:40,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:40,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:40,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239440908] [2024-10-11 04:42:40,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:40,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:42:40,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:40,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:42:40,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:42:40,761 INFO L87 Difference]: Start difference. First operand 7208 states and 9891 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:46,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:46,582 INFO L93 Difference]: Finished difference Result 10965 states and 16781 transitions. [2024-10-11 04:42:46,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:42:46,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-10-11 04:42:46,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:46,595 INFO L225 Difference]: With dead ends: 10965 [2024-10-11 04:42:46,596 INFO L226 Difference]: Without dead ends: 9461 [2024-10-11 04:42:46,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:42:46,602 INFO L432 NwaCegarLoop]: 756 mSDtfsCounter, 2308 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5157 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2308 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 6305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 5157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:46,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2308 Valid, 774 Invalid, 6305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1148 Valid, 5157 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-11 04:42:46,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9461 states. [2024-10-11 04:42:47,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9461 to 9461. [2024-10-11 04:42:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9461 states, 9459 states have (on average 1.3764668569616239) internal successors, (13020), 9460 states have internal predecessors, (13020), 0 states have call successors, (0), 0 states 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:42:47,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9461 states to 9461 states and 13020 transitions. [2024-10-11 04:42:47,148 INFO L78 Accepts]: Start accepts. Automaton has 9461 states and 13020 transitions. Word has length 88 [2024-10-11 04:42:47,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:47,149 INFO L471 AbstractCegarLoop]: Abstraction has 9461 states and 13020 transitions. [2024-10-11 04:42:47,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:47,149 INFO L276 IsEmpty]: Start isEmpty. Operand 9461 states and 13020 transitions. [2024-10-11 04:42:47,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 04:42:47,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:47,152 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:47,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 04:42:47,153 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:47,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:47,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1088182955, now seen corresponding path program 1 times [2024-10-11 04:42:47,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:47,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549703660] [2024-10-11 04:42:47,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:47,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 04:42:47,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:47,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549703660] [2024-10-11 04:42:47,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549703660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:47,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:47,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:42:47,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256018314] [2024-10-11 04:42:47,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:47,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:47,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:47,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:47,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:47,234 INFO L87 Difference]: Start difference. First operand 9461 states and 13020 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:50,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:50,531 INFO L93 Difference]: Finished difference Result 16222 states and 24072 transitions. [2024-10-11 04:42:50,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:50,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-10-11 04:42:50,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:50,550 INFO L225 Difference]: With dead ends: 16222 [2024-10-11 04:42:50,551 INFO L226 Difference]: Without dead ends: 12465 [2024-10-11 04:42:50,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:42:50,563 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 792 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:50,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 537 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 04:42:50,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12465 states. [2024-10-11 04:42:51,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12465 to 12465. [2024-10-11 04:42:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12465 states, 12463 states have (on average 1.3434967503811281) internal successors, (16744), 12464 states have internal predecessors, (16744), 0 states have call successors, (0), 0 states 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:42:51,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12465 states to 12465 states and 16744 transitions. [2024-10-11 04:42:51,058 INFO L78 Accepts]: Start accepts. Automaton has 12465 states and 16744 transitions. Word has length 90 [2024-10-11 04:42:51,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:51,058 INFO L471 AbstractCegarLoop]: Abstraction has 12465 states and 16744 transitions. [2024-10-11 04:42:51,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:51,059 INFO L276 IsEmpty]: Start isEmpty. Operand 12465 states and 16744 transitions. [2024-10-11 04:42:51,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 04:42:51,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:51,060 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:51,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 04:42:51,061 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:51,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:51,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1832193397, now seen corresponding path program 1 times [2024-10-11 04:42:51,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:51,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768348511] [2024-10-11 04:42:51,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:51,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 36 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:51,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:51,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768348511] [2024-10-11 04:42:51,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768348511] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:42:51,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061217205] [2024-10-11 04:42:51,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:51,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:42:51,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:42:51,863 INFO L229 MonitoredProcess]: Starting monitored process 8 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:42:51,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 04:42:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:51,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 04:42:51,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:42:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 30 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:52,484 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:42:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 28 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:54,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061217205] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:42:54,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:42:54,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2024-10-11 04:42:54,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402329388] [2024-10-11 04:42:54,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:42:54,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-11 04:42:54,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:54,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-11 04:42:54,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=993, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 04:42:54,356 INFO L87 Difference]: Start difference. First operand 12465 states and 16744 transitions. Second operand has 34 states, 34 states have (on average 7.382352941176471) internal successors, (251), 33 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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:42:57,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:57,799 INFO L93 Difference]: Finished difference Result 16649 states and 22009 transitions. [2024-10-11 04:42:57,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-11 04:42:57,800 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.382352941176471) internal successors, (251), 33 states have internal predecessors, (251), 0 states have call successors, (0), 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 93 [2024-10-11 04:42:57,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:57,832 INFO L225 Difference]: With dead ends: 16649 [2024-10-11 04:42:57,832 INFO L226 Difference]: Without dead ends: 12545 [2024-10-11 04:42:57,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1244, Invalid=4918, Unknown=0, NotChecked=0, Total=6162 [2024-10-11 04:42:57,845 INFO L432 NwaCegarLoop]: 1491 mSDtfsCounter, 21162 mSDsluCounter, 15217 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21162 SdHoareTripleChecker+Valid, 16708 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:57,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21162 Valid, 16708 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:42:57,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12545 states. [2024-10-11 04:42:58,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12545 to 9435. [2024-10-11 04:42:58,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9435 states, 9433 states have (on average 1.3662673592706456) internal successors, (12888), 9434 states have internal predecessors, (12888), 0 states have call successors, (0), 0 states 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:42:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9435 states to 9435 states and 12888 transitions. [2024-10-11 04:42:58,269 INFO L78 Accepts]: Start accepts. Automaton has 9435 states and 12888 transitions. Word has length 93 [2024-10-11 04:42:58,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:58,270 INFO L471 AbstractCegarLoop]: Abstraction has 9435 states and 12888 transitions. [2024-10-11 04:42:58,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.382352941176471) internal successors, (251), 33 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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:42:58,270 INFO L276 IsEmpty]: Start isEmpty. Operand 9435 states and 12888 transitions. [2024-10-11 04:42:58,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 04:42:58,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:58,275 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:58,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 04:42:58,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:42:58,476 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:58,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:58,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1051720921, now seen corresponding path program 1 times [2024-10-11 04:42:58,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:58,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122453942] [2024-10-11 04:42:58,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:58,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 21 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:00,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:00,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122453942] [2024-10-11 04:43:00,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122453942] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:43:00,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725538703] [2024-10-11 04:43:00,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:00,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:00,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:00,265 INFO L229 MonitoredProcess]: Starting monitored process 9 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:00,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 04:43:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:00,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-11 04:43:00,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:43:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 21 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:02,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:43:09,283 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 21 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:09,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725538703] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:43:09,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:43:09,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 60 [2024-10-11 04:43:09,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957322121] [2024-10-11 04:43:09,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:43:09,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-10-11 04:43:09,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:09,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-10-11 04:43:09,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=3272, Unknown=0, NotChecked=0, Total=3540 [2024-10-11 04:43:09,287 INFO L87 Difference]: Start difference. First operand 9435 states and 12888 transitions. Second operand has 60 states, 60 states have (on average 4.283333333333333) internal successors, (257), 60 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)