./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.5_overflow.ufo.UNBOUNDED.pals+Problem12_label01.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.5_overflow.ufo.UNBOUNDED.pals+Problem12_label01.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 24a2674686e3cd976907355f3a5c851b85884bd28355ffc3fa271cccc21387fd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:50:28,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:50:28,649 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:50:28,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:50:28,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:50:28,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:50:28,686 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:50:28,686 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:50:28,687 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:50:28,688 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:50:28,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:50:28,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:50:28,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:50:28,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:50:28,691 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:50:28,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:50:28,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:50:28,695 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:50:28,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:50:28,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:50:28,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:50:28,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:50:28,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:50:28,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:50:28,699 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:50:28,699 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:50:28,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:50:28,700 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:50:28,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:50:28,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:50:28,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:50:28,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:50:28,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:50:28,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:50:28,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:50:28,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:50:28,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:50:28,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:50:28,704 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:50:28,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:50:28,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:50:28,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:50:28,715 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 -> 24a2674686e3cd976907355f3a5c851b85884bd28355ffc3fa271cccc21387fd [2024-10-11 04:50:28,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:50:28,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:50:29,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:50:29,003 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:50:29,004 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:50:29,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-10-11 04:50:30,470 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:50:30,922 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:50:30,923 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-10-11 04:50:30,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0ef78d914/0c7c36d9553749659c81c3189a3a63ac/FLAGbfe7ba2dc [2024-10-11 04:50:31,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0ef78d914/0c7c36d9553749659c81c3189a3a63ac [2024-10-11 04:50:31,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:50:31,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:50:31,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:50:31,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:50:31,070 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:50:31,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:50:31" (1/1) ... [2024-10-11 04:50:31,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f514fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:31, skipping insertion in model container [2024-10-11 04:50:31,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:50:31" (1/1) ... [2024-10-11 04:50:31,206 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:50:31,658 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.5_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[11742,11755] [2024-10-11 04:50:31,713 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.5_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[17297,17310] [2024-10-11 04:50:32,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:50:32,472 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:50:32,511 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.5_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[11742,11755] [2024-10-11 04:50:32,523 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.5_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[17297,17310] [2024-10-11 04:50:32,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:50:32,948 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:50:32,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:32 WrapperNode [2024-10-11 04:50:32,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:50:32,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:50:32,951 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:50:32,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:50:32,958 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:50:32" (1/1) ... [2024-10-11 04:50:33,011 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:50:32" (1/1) ... [2024-10-11 04:50:33,429 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5095 [2024-10-11 04:50:33,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:50:33,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:50:33,431 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:50:33,431 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:50:33,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:32" (1/1) ... [2024-10-11 04:50:33,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:32" (1/1) ... [2024-10-11 04:50:33,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:32" (1/1) ... [2024-10-11 04:50:33,648 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:50:33,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:32" (1/1) ... [2024-10-11 04:50:33,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:32" (1/1) ... [2024-10-11 04:50:33,790 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:32" (1/1) ... [2024-10-11 04:50:33,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:32" (1/1) ... [2024-10-11 04:50:33,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:32" (1/1) ... [2024-10-11 04:50:33,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:32" (1/1) ... [2024-10-11 04:50:33,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:50:33,957 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:50:33,957 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:50:33,957 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:50:33,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:32" (1/1) ... [2024-10-11 04:50:33,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:50:33,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:50:33,992 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:50:33,996 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:50:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:50:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:50:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:50:34,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:50:34,149 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:50:34,151 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:50:38,678 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2024-10-11 04:50:38,679 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:50:38,764 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:50:38,764 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:50:38,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:50:38 BoogieIcfgContainer [2024-10-11 04:50:38,765 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:50:38,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:50:38,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:50:38,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:50:38,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:50:31" (1/3) ... [2024-10-11 04:50:38,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a26171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:50:38, skipping insertion in model container [2024-10-11 04:50:38,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:32" (2/3) ... [2024-10-11 04:50:38,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a26171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:50:38, skipping insertion in model container [2024-10-11 04:50:38,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:50:38" (3/3) ... [2024-10-11 04:50:38,776 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-10-11 04:50:38,794 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:50:38,794 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:50:38,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:50:38,906 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;@1adec5ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:50:38,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:50:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 834 states, 831 states have (on average 1.9759326113116726) internal successors, (1642), 833 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have 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:50:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 04:50:38,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:38,929 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] [2024-10-11 04:50:38,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:38,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:38,935 INFO L85 PathProgramCache]: Analyzing trace with hash -606284215, now seen corresponding path program 1 times [2024-10-11 04:50:38,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:38,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321547075] [2024-10-11 04:50:38,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:38,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:39,196 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:50:39,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:39,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321547075] [2024-10-11 04:50:39,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321547075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:39,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:39,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:50:39,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491834175] [2024-10-11 04:50:39,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:39,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 04:50:39,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:39,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 04:50:39,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:50:39,233 INFO L87 Difference]: Start difference. First operand has 834 states, 831 states have (on average 1.9759326113116726) internal successors, (1642), 833 states have internal predecessors, (1642), 0 states have call successors, (0), 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 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have 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:50:39,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:39,352 INFO L93 Difference]: Finished difference Result 1632 states and 3215 transitions. [2024-10-11 04:50:39,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 04:50:39,359 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-10-11 04:50:39,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:39,385 INFO L225 Difference]: With dead ends: 1632 [2024-10-11 04:50:39,386 INFO L226 Difference]: Without dead ends: 830 [2024-10-11 04:50:39,394 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:50:39,400 INFO L432 NwaCegarLoop]: 1570 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:39,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1570 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:39,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-10-11 04:50:39,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2024-10-11 04:50:39,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 828 states have (on average 1.8973429951690821) internal successors, (1571), 829 states have internal predecessors, (1571), 0 states have call successors, (0), 0 states have 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:50:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1571 transitions. [2024-10-11 04:50:39,508 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1571 transitions. Word has length 21 [2024-10-11 04:50:39,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:39,509 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1571 transitions. [2024-10-11 04:50:39,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have 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:50:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1571 transitions. [2024-10-11 04:50:39,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 04:50:39,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:39,512 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] [2024-10-11 04:50:39,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:50:39,513 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:39,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:39,514 INFO L85 PathProgramCache]: Analyzing trace with hash 2100335179, now seen corresponding path program 1 times [2024-10-11 04:50:39,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:39,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618846462] [2024-10-11 04:50:39,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:39,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:39,713 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:50:39,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:39,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618846462] [2024-10-11 04:50:39,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618846462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:39,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:39,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:50:39,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207690568] [2024-10-11 04:50:39,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:39,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:50:39,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:39,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:50:39,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:50:39,722 INFO L87 Difference]: Start difference. First operand 830 states and 1571 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have 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:50:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:39,832 INFO L93 Difference]: Finished difference Result 874 states and 1640 transitions. [2024-10-11 04:50:39,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:50:39,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-10-11 04:50:39,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:39,837 INFO L225 Difference]: With dead ends: 874 [2024-10-11 04:50:39,837 INFO L226 Difference]: Without dead ends: 830 [2024-10-11 04:50:39,838 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:50:39,839 INFO L432 NwaCegarLoop]: 1568 mSDtfsCounter, 0 mSDsluCounter, 3101 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4669 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:39,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4669 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:39,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-10-11 04:50:39,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2024-10-11 04:50:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 828 states have (on average 1.8599033816425121) internal successors, (1540), 829 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have 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:50:39,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1540 transitions. [2024-10-11 04:50:39,862 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1540 transitions. Word has length 21 [2024-10-11 04:50:39,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:39,863 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1540 transitions. [2024-10-11 04:50:39,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have 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:50:39,864 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1540 transitions. [2024-10-11 04:50:39,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 04:50:39,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:39,866 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:39,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:50:39,866 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:39,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:39,868 INFO L85 PathProgramCache]: Analyzing trace with hash -364061020, now seen corresponding path program 1 times [2024-10-11 04:50:39,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:39,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494958754] [2024-10-11 04:50:39,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:39,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:40,028 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:50:40,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:40,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494958754] [2024-10-11 04:50:40,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494958754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:40,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:40,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:50:40,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590465234] [2024-10-11 04:50:40,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:40,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:40,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:40,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:40,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:40,033 INFO L87 Difference]: Start difference. First operand 830 states and 1540 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 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:50:43,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:43,390 INFO L93 Difference]: Finished difference Result 2334 states and 4413 transitions. [2024-10-11 04:50:43,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:43,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 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 47 [2024-10-11 04:50:43,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:43,398 INFO L225 Difference]: With dead ends: 2334 [2024-10-11 04:50:43,398 INFO L226 Difference]: Without dead ends: 1581 [2024-10-11 04:50:43,400 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:50:43,401 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 869 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 3278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:43,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 175 Invalid, 3278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 04:50:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2024-10-11 04:50:43,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1581. [2024-10-11 04:50:43,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1579 states have (on average 1.8461051298290057) internal successors, (2915), 1580 states have internal predecessors, (2915), 0 states have call successors, (0), 0 states have 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:50:43,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2915 transitions. [2024-10-11 04:50:43,435 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2915 transitions. Word has length 47 [2024-10-11 04:50:43,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:43,436 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2915 transitions. [2024-10-11 04:50:43,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 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:50:43,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2915 transitions. [2024-10-11 04:50:43,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 04:50:43,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:43,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:43,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:50:43,439 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:43,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:43,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1048618978, now seen corresponding path program 1 times [2024-10-11 04:50:43,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:43,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715178631] [2024-10-11 04:50:43,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:43,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:43,647 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:50:43,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:43,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715178631] [2024-10-11 04:50:43,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715178631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:43,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:43,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:43,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548529353] [2024-10-11 04:50:43,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:43,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:43,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:43,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:43,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:43,651 INFO L87 Difference]: Start difference. First operand 1581 states and 2915 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 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:50:43,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:43,905 INFO L93 Difference]: Finished difference Result 1991 states and 3575 transitions. [2024-10-11 04:50:43,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 04:50:43,906 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 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:50:43,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:43,915 INFO L225 Difference]: With dead ends: 1991 [2024-10-11 04:50:43,915 INFO L226 Difference]: Without dead ends: 1950 [2024-10-11 04:50:43,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-11 04:50:43,919 INFO L432 NwaCegarLoop]: 1533 mSDtfsCounter, 7933 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7933 SdHoareTripleChecker+Valid, 2700 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:43,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7933 Valid, 2700 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2024-10-11 04:50:43,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1620. [2024-10-11 04:50:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1618 states have (on average 1.8405438813349815) internal successors, (2978), 1619 states have internal predecessors, (2978), 0 states have call successors, (0), 0 states have 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:50:43,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2978 transitions. [2024-10-11 04:50:43,967 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2978 transitions. Word has length 51 [2024-10-11 04:50:43,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:43,967 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 2978 transitions. [2024-10-11 04:50:43,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 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:50:43,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2978 transitions. [2024-10-11 04:50:43,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 04:50:43,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:43,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:43,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:50:43,970 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:43,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:43,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1740226510, now seen corresponding path program 1 times [2024-10-11 04:50:43,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:43,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714351173] [2024-10-11 04:50:43,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:43,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:44,086 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:50:44,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:44,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714351173] [2024-10-11 04:50:44,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714351173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:44,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:44,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:44,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053233542] [2024-10-11 04:50:44,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:44,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:44,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:44,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:44,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:44,092 INFO L87 Difference]: Start difference. First operand 1620 states and 2978 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:50:44,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:44,141 INFO L93 Difference]: Finished difference Result 1769 states and 3217 transitions. [2024-10-11 04:50:44,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:44,142 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:50:44,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:44,150 INFO L225 Difference]: With dead ends: 1769 [2024-10-11 04:50:44,151 INFO L226 Difference]: Without dead ends: 1689 [2024-10-11 04:50:44,152 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:50:44,154 INFO L432 NwaCegarLoop]: 1535 mSDtfsCounter, 1480 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1595 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:50:44,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1595 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:44,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2024-10-11 04:50:44,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1687. [2024-10-11 04:50:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1685 states have (on average 1.83026706231454) internal successors, (3084), 1686 states have internal predecessors, (3084), 0 states have call successors, (0), 0 states have 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:50:44,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 3084 transitions. [2024-10-11 04:50:44,198 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 3084 transitions. Word has length 53 [2024-10-11 04:50:44,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:44,200 INFO L471 AbstractCegarLoop]: Abstraction has 1687 states and 3084 transitions. [2024-10-11 04:50:44,200 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:50:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 3084 transitions. [2024-10-11 04:50:44,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 04:50:44,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:44,203 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:44,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:50:44,204 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:44,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:44,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1738081558, now seen corresponding path program 1 times [2024-10-11 04:50:44,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:44,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657099738] [2024-10-11 04:50:44,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:44,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:44,552 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:50:44,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:44,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657099738] [2024-10-11 04:50:44,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657099738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:44,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:44,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:44,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019845430] [2024-10-11 04:50:44,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:44,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:44,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:44,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:44,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:44,555 INFO L87 Difference]: Start difference. First operand 1687 states and 3084 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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:50:44,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:44,753 INFO L93 Difference]: Finished difference Result 1836 states and 3320 transitions. [2024-10-11 04:50:44,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:50:44,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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:50:44,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:44,761 INFO L225 Difference]: With dead ends: 1836 [2024-10-11 04:50:44,762 INFO L226 Difference]: Without dead ends: 1689 [2024-10-11 04:50:44,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:50:44,764 INFO L432 NwaCegarLoop]: 1530 mSDtfsCounter, 7439 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7439 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:44,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7439 Valid, 1775 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:44,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2024-10-11 04:50:44,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1687. [2024-10-11 04:50:44,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1685 states have (on average 1.829080118694362) internal successors, (3082), 1686 states have internal predecessors, (3082), 0 states have call successors, (0), 0 states have 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:50:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 3082 transitions. [2024-10-11 04:50:44,802 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 3082 transitions. Word has length 53 [2024-10-11 04:50:44,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:44,803 INFO L471 AbstractCegarLoop]: Abstraction has 1687 states and 3082 transitions. [2024-10-11 04:50:44,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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:50:44,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 3082 transitions. [2024-10-11 04:50:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 04:50:44,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:44,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:44,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:50:44,805 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:44,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:44,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1824971111, now seen corresponding path program 1 times [2024-10-11 04:50:44,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:44,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050956400] [2024-10-11 04:50:44,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:44,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:45,016 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:50:45,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:45,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050956400] [2024-10-11 04:50:45,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050956400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:45,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:45,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:50:45,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636993565] [2024-10-11 04:50:45,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:45,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:50:45,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:45,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:50:45,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:50:45,021 INFO L87 Difference]: Start difference. First operand 1687 states and 3082 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:50:45,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:45,065 INFO L93 Difference]: Finished difference Result 1693 states and 3089 transitions. [2024-10-11 04:50:45,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:50:45,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-11 04:50:45,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:45,073 INFO L225 Difference]: With dead ends: 1693 [2024-10-11 04:50:45,074 INFO L226 Difference]: Without dead ends: 1691 [2024-10-11 04:50:45,075 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:50:45,075 INFO L432 NwaCegarLoop]: 1536 mSDtfsCounter, 0 mSDsluCounter, 3064 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4600 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:50:45,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4600 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:45,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2024-10-11 04:50:45,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1691. [2024-10-11 04:50:45,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1689 states have (on average 1.8265245707519242) internal successors, (3085), 1690 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have 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:50:45,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 3085 transitions. [2024-10-11 04:50:45,110 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 3085 transitions. Word has length 54 [2024-10-11 04:50:45,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:45,110 INFO L471 AbstractCegarLoop]: Abstraction has 1691 states and 3085 transitions. [2024-10-11 04:50:45,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:50:45,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 3085 transitions. [2024-10-11 04:50:45,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:50:45,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:45,111 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:45,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:50:45,112 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:45,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:45,112 INFO L85 PathProgramCache]: Analyzing trace with hash -333952342, now seen corresponding path program 1 times [2024-10-11 04:50:45,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:45,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29017607] [2024-10-11 04:50:45,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:45,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:45,179 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:50:45,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:45,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29017607] [2024-10-11 04:50:45,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29017607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:45,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:45,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:45,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977491484] [2024-10-11 04:50:45,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:45,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:45,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:45,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:45,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:45,182 INFO L87 Difference]: Start difference. First operand 1691 states and 3085 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:45,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:45,227 INFO L93 Difference]: Finished difference Result 1853 states and 3338 transitions. [2024-10-11 04:50:45,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:45,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-11 04:50:45,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:45,235 INFO L225 Difference]: With dead ends: 1853 [2024-10-11 04:50:45,235 INFO L226 Difference]: Without dead ends: 1769 [2024-10-11 04:50:45,236 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:50:45,237 INFO L432 NwaCegarLoop]: 1587 mSDtfsCounter, 1494 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1653 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:50:45,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1653 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:45,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2024-10-11 04:50:45,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1767. [2024-10-11 04:50:45,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1765 states have (on average 1.8141643059490085) internal successors, (3202), 1766 states have internal predecessors, (3202), 0 states have call successors, (0), 0 states have 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:50:45,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 3202 transitions. [2024-10-11 04:50:45,278 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 3202 transitions. Word has length 55 [2024-10-11 04:50:45,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:45,279 INFO L471 AbstractCegarLoop]: Abstraction has 1767 states and 3202 transitions. [2024-10-11 04:50:45,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:45,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 3202 transitions. [2024-10-11 04:50:45,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:50:45,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:45,281 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:45,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:50:45,282 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:45,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:45,283 INFO L85 PathProgramCache]: Analyzing trace with hash -562591574, now seen corresponding path program 1 times [2024-10-11 04:50:45,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:45,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687106528] [2024-10-11 04:50:45,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:45,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:45,351 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:50:45,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:45,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687106528] [2024-10-11 04:50:45,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687106528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:45,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:45,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:45,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150287388] [2024-10-11 04:50:45,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:45,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:45,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:45,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:45,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:45,354 INFO L87 Difference]: Start difference. First operand 1767 states and 3202 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:45,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:45,397 INFO L93 Difference]: Finished difference Result 2193 states and 3862 transitions. [2024-10-11 04:50:45,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:45,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-11 04:50:45,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:45,406 INFO L225 Difference]: With dead ends: 2193 [2024-10-11 04:50:45,406 INFO L226 Difference]: Without dead ends: 1968 [2024-10-11 04:50:45,408 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:50:45,408 INFO L432 NwaCegarLoop]: 1579 mSDtfsCounter, 1490 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1653 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:50:45,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1653 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:45,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2024-10-11 04:50:45,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1966. [2024-10-11 04:50:45,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1966 states, 1964 states have (on average 1.7841140529531567) internal successors, (3504), 1965 states have internal predecessors, (3504), 0 states have call successors, (0), 0 states have 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:50:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 3504 transitions. [2024-10-11 04:50:45,452 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 3504 transitions. Word has length 55 [2024-10-11 04:50:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:45,453 INFO L471 AbstractCegarLoop]: Abstraction has 1966 states and 3504 transitions. [2024-10-11 04:50:45,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 3504 transitions. [2024-10-11 04:50:45,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:50:45,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:45,454 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:45,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:50:45,454 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:45,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1188247638, now seen corresponding path program 1 times [2024-10-11 04:50:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:45,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590136974] [2024-10-11 04:50:45,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:45,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:45,515 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:50:45,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:45,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590136974] [2024-10-11 04:50:45,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590136974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:45,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:45,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:45,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490996509] [2024-10-11 04:50:45,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:45,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:45,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:45,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:45,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:45,519 INFO L87 Difference]: Start difference. First operand 1966 states and 3504 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:45,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:45,572 INFO L93 Difference]: Finished difference Result 2766 states and 4726 transitions. [2024-10-11 04:50:45,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:45,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-11 04:50:45,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:45,585 INFO L225 Difference]: With dead ends: 2766 [2024-10-11 04:50:45,585 INFO L226 Difference]: Without dead ends: 2342 [2024-10-11 04:50:45,587 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:50:45,588 INFO L432 NwaCegarLoop]: 1577 mSDtfsCounter, 1488 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1655 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:50:45,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1655 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:45,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2024-10-11 04:50:45,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 2340. [2024-10-11 04:50:45,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2340 states, 2338 states have (on average 1.7365269461077844) internal successors, (4060), 2339 states have internal predecessors, (4060), 0 states have call successors, (0), 0 states have 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:50:45,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 2340 states and 4060 transitions. [2024-10-11 04:50:45,650 INFO L78 Accepts]: Start accepts. Automaton has 2340 states and 4060 transitions. Word has length 55 [2024-10-11 04:50:45,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:45,650 INFO L471 AbstractCegarLoop]: Abstraction has 2340 states and 4060 transitions. [2024-10-11 04:50:45,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:45,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 4060 transitions. [2024-10-11 04:50:45,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:50:45,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:45,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:45,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:50:45,652 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:45,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:45,653 INFO L85 PathProgramCache]: Analyzing trace with hash -299514198, now seen corresponding path program 1 times [2024-10-11 04:50:45,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:45,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219431853] [2024-10-11 04:50:45,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:45,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:45,705 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:50:45,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:45,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219431853] [2024-10-11 04:50:45,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219431853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:45,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:45,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:45,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190839303] [2024-10-11 04:50:45,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:45,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:45,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:45,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:45,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:45,708 INFO L87 Difference]: Start difference. First operand 2340 states and 4060 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:45,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:45,768 INFO L93 Difference]: Finished difference Result 3840 states and 6310 transitions. [2024-10-11 04:50:45,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:45,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-11 04:50:45,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:45,782 INFO L225 Difference]: With dead ends: 3840 [2024-10-11 04:50:45,783 INFO L226 Difference]: Without dead ends: 3042 [2024-10-11 04:50:45,785 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:50:45,786 INFO L432 NwaCegarLoop]: 1575 mSDtfsCounter, 1486 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1657 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:50:45,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1657 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:45,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2024-10-11 04:50:45,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 3040. [2024-10-11 04:50:45,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3040 states, 3038 states have (on average 1.6708360763660304) internal successors, (5076), 3039 states have internal predecessors, (5076), 0 states have call successors, (0), 0 states have 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:50:45,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3040 states to 3040 states and 5076 transitions. [2024-10-11 04:50:45,879 INFO L78 Accepts]: Start accepts. Automaton has 3040 states and 5076 transitions. Word has length 55 [2024-10-11 04:50:45,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:45,880 INFO L471 AbstractCegarLoop]: Abstraction has 3040 states and 5076 transitions. [2024-10-11 04:50:45,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:45,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3040 states and 5076 transitions. [2024-10-11 04:50:45,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:50:45,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:45,881 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:45,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:50:45,881 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:45,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:45,881 INFO L85 PathProgramCache]: Analyzing trace with hash -602535510, now seen corresponding path program 1 times [2024-10-11 04:50:45,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:45,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262150873] [2024-10-11 04:50:45,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:45,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:45,943 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:50:45,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:45,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262150873] [2024-10-11 04:50:45,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262150873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:45,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:45,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:45,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152123143] [2024-10-11 04:50:45,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:45,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:45,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:45,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:45,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:45,946 INFO L87 Difference]: Start difference. First operand 3040 states and 5076 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:46,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:46,074 INFO L93 Difference]: Finished difference Result 5844 states and 9190 transitions. [2024-10-11 04:50:46,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:46,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-11 04:50:46,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:46,090 INFO L225 Difference]: With dead ends: 5844 [2024-10-11 04:50:46,094 INFO L226 Difference]: Without dead ends: 4346 [2024-10-11 04:50:46,097 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:50:46,099 INFO L432 NwaCegarLoop]: 1589 mSDtfsCounter, 1492 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1659 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:50:46,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1659 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:46,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2024-10-11 04:50:46,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 4344. [2024-10-11 04:50:46,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4344 states, 4342 states have (on average 1.592814371257485) internal successors, (6916), 4343 states have internal predecessors, (6916), 0 states have call successors, (0), 0 states have 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:50:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4344 states to 4344 states and 6916 transitions. [2024-10-11 04:50:46,234 INFO L78 Accepts]: Start accepts. Automaton has 4344 states and 6916 transitions. Word has length 55 [2024-10-11 04:50:46,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:46,234 INFO L471 AbstractCegarLoop]: Abstraction has 4344 states and 6916 transitions. [2024-10-11 04:50:46,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:46,235 INFO L276 IsEmpty]: Start isEmpty. Operand 4344 states and 6916 transitions. [2024-10-11 04:50:46,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 04:50:46,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:46,238 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:50:46,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:50:46,238 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:46,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:46,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1175701837, now seen corresponding path program 1 times [2024-10-11 04:50:46,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:46,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661977822] [2024-10-11 04:50:46,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:46,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:46,409 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:50:46,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:46,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661977822] [2024-10-11 04:50:46,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661977822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:46,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:46,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:46,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926040393] [2024-10-11 04:50:46,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:46,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:46,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:46,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:46,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:46,412 INFO L87 Difference]: Start difference. First operand 4344 states and 6916 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:50:46,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:46,839 INFO L93 Difference]: Finished difference Result 18132 states and 26906 transitions. [2024-10-11 04:50:46,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:50:46,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 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 73 [2024-10-11 04:50:46,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:46,889 INFO L225 Difference]: With dead ends: 18132 [2024-10-11 04:50:46,889 INFO L226 Difference]: Without dead ends: 16146 [2024-10-11 04:50:46,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:50:46,900 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 6291 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6291 SdHoareTripleChecker+Valid, 3561 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:46,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6291 Valid, 3561 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:46,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16146 states. [2024-10-11 04:50:47,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16146 to 6744. [2024-10-11 04:50:47,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6744 states, 6742 states have (on average 1.5360427172945714) internal successors, (10356), 6743 states have internal predecessors, (10356), 0 states have call successors, (0), 0 states have 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:50:47,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 10356 transitions. [2024-10-11 04:50:47,329 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 10356 transitions. Word has length 73 [2024-10-11 04:50:47,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:47,329 INFO L471 AbstractCegarLoop]: Abstraction has 6744 states and 10356 transitions. [2024-10-11 04:50:47,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:50:47,330 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 10356 transitions. [2024-10-11 04:50:47,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 04:50:47,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:47,333 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:50:47,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:50:47,334 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:47,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:47,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1404341069, now seen corresponding path program 1 times [2024-10-11 04:50:47,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:47,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748606484] [2024-10-11 04:50:47,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:47,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:47,525 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 04:50:47,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:47,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748606484] [2024-10-11 04:50:47,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748606484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:47,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:47,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:47,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761076318] [2024-10-11 04:50:47,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:47,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:47,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:47,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:47,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:47,528 INFO L87 Difference]: Start difference. First operand 6744 states and 10356 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:48,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:48,162 INFO L93 Difference]: Finished difference Result 20932 states and 30938 transitions. [2024-10-11 04:50:48,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:50:48,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-11 04:50:48,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:48,203 INFO L225 Difference]: With dead ends: 20932 [2024-10-11 04:50:48,204 INFO L226 Difference]: Without dead ends: 18130 [2024-10-11 04:50:48,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:50:48,217 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 6336 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6336 SdHoareTripleChecker+Valid, 3592 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:48,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6336 Valid, 3592 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:48,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18130 states. [2024-10-11 04:50:48,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18130 to 10536. [2024-10-11 04:50:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10536 states, 10534 states have (on average 1.49800645528764) internal successors, (15780), 10535 states have internal predecessors, (15780), 0 states have call successors, (0), 0 states have 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:50:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10536 states to 10536 states and 15780 transitions. [2024-10-11 04:50:48,614 INFO L78 Accepts]: Start accepts. Automaton has 10536 states and 15780 transitions. Word has length 73 [2024-10-11 04:50:48,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:48,615 INFO L471 AbstractCegarLoop]: Abstraction has 10536 states and 15780 transitions. [2024-10-11 04:50:48,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 10536 states and 15780 transitions. [2024-10-11 04:50:48,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 04:50:48,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:48,618 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:50:48,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:50:48,618 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:48,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:48,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2029997133, now seen corresponding path program 1 times [2024-10-11 04:50:48,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:48,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532211091] [2024-10-11 04:50:48,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:48,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:48,794 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 04:50:48,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:48,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532211091] [2024-10-11 04:50:48,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532211091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:48,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:48,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:48,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915251088] [2024-10-11 04:50:48,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:48,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:48,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:48,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:48,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:48,797 INFO L87 Difference]: Start difference. First operand 10536 states and 15780 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:49,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:49,384 INFO L93 Difference]: Finished difference Result 23732 states and 34954 transitions. [2024-10-11 04:50:49,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:50:49,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-11 04:50:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:49,429 INFO L225 Difference]: With dead ends: 23732 [2024-10-11 04:50:49,429 INFO L226 Difference]: Without dead ends: 20930 [2024-10-11 04:50:49,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:50:49,445 INFO L432 NwaCegarLoop]: 1594 mSDtfsCounter, 6381 mSDsluCounter, 1961 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6381 SdHoareTripleChecker+Valid, 3555 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:49,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6381 Valid, 3555 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:49,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20930 states. [2024-10-11 04:50:49,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20930 to 13336. [2024-10-11 04:50:49,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13336 states, 13334 states have (on average 1.4846257687115645) internal successors, (19796), 13335 states have internal predecessors, (19796), 0 states have call successors, (0), 0 states have 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:50:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13336 states to 13336 states and 19796 transitions. [2024-10-11 04:50:49,917 INFO L78 Accepts]: Start accepts. Automaton has 13336 states and 19796 transitions. Word has length 73 [2024-10-11 04:50:49,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:49,918 INFO L471 AbstractCegarLoop]: Abstraction has 13336 states and 19796 transitions. [2024-10-11 04:50:49,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:49,918 INFO L276 IsEmpty]: Start isEmpty. Operand 13336 states and 19796 transitions. [2024-10-11 04:50:49,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 04:50:49,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:49,921 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:50:49,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:50:49,921 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:49,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:49,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1141263693, now seen corresponding path program 1 times [2024-10-11 04:50:49,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:49,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670437639] [2024-10-11 04:50:49,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:49,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:50,115 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 04:50:50,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:50,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670437639] [2024-10-11 04:50:50,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670437639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:50,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:50,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:50,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456699207] [2024-10-11 04:50:50,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:50,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:50,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:50,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:50,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:50,117 INFO L87 Difference]: Start difference. First operand 13336 states and 19796 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:50,797 INFO L93 Difference]: Finished difference Result 26532 states and 38970 transitions. [2024-10-11 04:50:50,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:50:50,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-11 04:50:50,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:50,845 INFO L225 Difference]: With dead ends: 26532 [2024-10-11 04:50:50,845 INFO L226 Difference]: Without dead ends: 23730 [2024-10-11 04:50:50,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:50:50,860 INFO L432 NwaCegarLoop]: 1594 mSDtfsCounter, 6341 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6341 SdHoareTripleChecker+Valid, 3577 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:50,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6341 Valid, 3577 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:50,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23730 states. [2024-10-11 04:50:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23730 to 16136. [2024-10-11 04:50:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16136 states, 16134 states have (on average 1.4758894260567745) internal successors, (23812), 16135 states have internal predecessors, (23812), 0 states have call successors, (0), 0 states have 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:50:51,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 23812 transitions. [2024-10-11 04:50:51,535 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 23812 transitions. Word has length 73 [2024-10-11 04:50:51,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:51,535 INFO L471 AbstractCegarLoop]: Abstraction has 16136 states and 23812 transitions. [2024-10-11 04:50:51,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:51,536 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 23812 transitions. [2024-10-11 04:50:51,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 04:50:51,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:51,538 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:50:51,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 04:50:51,539 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:51,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:51,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1444285005, now seen corresponding path program 1 times [2024-10-11 04:50:51,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:51,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419707330] [2024-10-11 04:50:51,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:51,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:51,691 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 04:50:51,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:51,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419707330] [2024-10-11 04:50:51,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419707330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:51,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:51,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:51,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347217338] [2024-10-11 04:50:51,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:51,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:51,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:51,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:51,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:51,694 INFO L87 Difference]: Start difference. First operand 16136 states and 23812 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have 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:50:52,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:52,307 INFO L93 Difference]: Finished difference Result 29332 states and 42986 transitions. [2024-10-11 04:50:52,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:50:52,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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 73 [2024-10-11 04:50:52,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:52,369 INFO L225 Difference]: With dead ends: 29332 [2024-10-11 04:50:52,369 INFO L226 Difference]: Without dead ends: 26530 [2024-10-11 04:50:52,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:50:52,387 INFO L432 NwaCegarLoop]: 1593 mSDtfsCounter, 6295 mSDsluCounter, 2058 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6295 SdHoareTripleChecker+Valid, 3651 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:52,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6295 Valid, 3651 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:52,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26530 states. [2024-10-11 04:50:53,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26530 to 18936. [2024-10-11 04:50:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18936 states, 18934 states have (on average 1.469736981092215) internal successors, (27828), 18935 states have internal predecessors, (27828), 0 states have call successors, (0), 0 states have 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:50:53,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18936 states to 18936 states and 27828 transitions. [2024-10-11 04:50:53,304 INFO L78 Accepts]: Start accepts. Automaton has 18936 states and 27828 transitions. Word has length 73 [2024-10-11 04:50:53,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:53,305 INFO L471 AbstractCegarLoop]: Abstraction has 18936 states and 27828 transitions. [2024-10-11 04:50:53,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have 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:50:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 18936 states and 27828 transitions. [2024-10-11 04:50:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 04:50:53,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:53,309 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:53,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 04:50:53,309 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:53,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:53,310 INFO L85 PathProgramCache]: Analyzing trace with hash -923035475, now seen corresponding path program 1 times [2024-10-11 04:50:53,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:53,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525806785] [2024-10-11 04:50:53,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:53,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:53,443 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:50:53,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:53,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525806785] [2024-10-11 04:50:53,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525806785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:53,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:53,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:53,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647124998] [2024-10-11 04:50:53,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:53,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:53,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:53,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:53,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:53,446 INFO L87 Difference]: Start difference. First operand 18936 states and 27828 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have 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:50:53,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:53,964 INFO L93 Difference]: Finished difference Result 36332 states and 52806 transitions. [2024-10-11 04:50:53,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:53,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-11 04:50:53,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:54,004 INFO L225 Difference]: With dead ends: 36332 [2024-10-11 04:50:54,005 INFO L226 Difference]: Without dead ends: 18938 [2024-10-11 04:50:54,033 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:50:54,034 INFO L432 NwaCegarLoop]: 1571 mSDtfsCounter, 45 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3097 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:50:54,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3097 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:54,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18938 states. [2024-10-11 04:50:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18938 to 18936. [2024-10-11 04:50:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18936 states, 18934 states have (on average 1.4541037287419456) internal successors, (27532), 18935 states have internal predecessors, (27532), 0 states have call successors, (0), 0 states have 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:50:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18936 states to 18936 states and 27532 transitions. [2024-10-11 04:50:54,696 INFO L78 Accepts]: Start accepts. Automaton has 18936 states and 27532 transitions. Word has length 74 [2024-10-11 04:50:54,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:54,697 INFO L471 AbstractCegarLoop]: Abstraction has 18936 states and 27532 transitions. [2024-10-11 04:50:54,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have 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:50:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 18936 states and 27532 transitions. [2024-10-11 04:50:54,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 04:50:54,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:54,700 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:54,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 04:50:54,700 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:54,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:54,701 INFO L85 PathProgramCache]: Analyzing trace with hash -827058053, now seen corresponding path program 1 times [2024-10-11 04:50:54,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:54,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953016223] [2024-10-11 04:50:54,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:54,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:54,833 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:50:54,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:54,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953016223] [2024-10-11 04:50:54,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953016223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:54,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:54,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:54,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422653164] [2024-10-11 04:50:54,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:54,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:54,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:54,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:54,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:54,836 INFO L87 Difference]: Start difference. First operand 18936 states and 27532 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:55,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:55,032 INFO L93 Difference]: Finished difference Result 25406 states and 36809 transitions. [2024-10-11 04:50:55,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:55,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-11 04:50:55,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:55,051 INFO L225 Difference]: With dead ends: 25406 [2024-10-11 04:50:55,051 INFO L226 Difference]: Without dead ends: 8012 [2024-10-11 04:50:55,071 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:50:55,072 INFO L432 NwaCegarLoop]: 1569 mSDtfsCounter, 39 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3094 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:50:55,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3094 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:55,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8012 states. [2024-10-11 04:50:55,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8012 to 8005. [2024-10-11 04:50:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8005 states, 8003 states have (on average 1.5015619142821441) internal successors, (12017), 8004 states have internal predecessors, (12017), 0 states have call successors, (0), 0 states have 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:50:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8005 states to 8005 states and 12017 transitions. [2024-10-11 04:50:55,298 INFO L78 Accepts]: Start accepts. Automaton has 8005 states and 12017 transitions. Word has length 75 [2024-10-11 04:50:55,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:55,299 INFO L471 AbstractCegarLoop]: Abstraction has 8005 states and 12017 transitions. [2024-10-11 04:50:55,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:55,299 INFO L276 IsEmpty]: Start isEmpty. Operand 8005 states and 12017 transitions. [2024-10-11 04:50:55,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 04:50:55,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:55,301 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:50:55,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 04:50:55,302 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:55,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:55,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2055768005, now seen corresponding path program 1 times [2024-10-11 04:50:55,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:55,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233728900] [2024-10-11 04:50:55,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:55,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:55,402 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:50:55,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:55,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233728900] [2024-10-11 04:50:55,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233728900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:55,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:55,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:55,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608510840] [2024-10-11 04:50:55,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:55,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:55,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:55,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:55,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:55,405 INFO L87 Difference]: Start difference. First operand 8005 states and 12017 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:50:55,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:55,504 INFO L93 Difference]: Finished difference Result 11233 states and 16595 transitions. [2024-10-11 04:50:55,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:55,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-11 04:50:55,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:55,515 INFO L225 Difference]: With dead ends: 11233 [2024-10-11 04:50:55,516 INFO L226 Difference]: Without dead ends: 4783 [2024-10-11 04:50:55,583 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:50:55,584 INFO L432 NwaCegarLoop]: 1563 mSDtfsCounter, 41 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3073 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:50:55,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3073 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:55,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4783 states. [2024-10-11 04:50:55,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4783 to 4781. [2024-10-11 04:50:55,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4781 states, 4779 states have (on average 1.5461393596986817) internal successors, (7389), 4780 states have internal predecessors, (7389), 0 states have call successors, (0), 0 states have 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:50:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4781 states to 4781 states and 7389 transitions. [2024-10-11 04:50:55,702 INFO L78 Accepts]: Start accepts. Automaton has 4781 states and 7389 transitions. Word has length 76 [2024-10-11 04:50:55,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:55,703 INFO L471 AbstractCegarLoop]: Abstraction has 4781 states and 7389 transitions. [2024-10-11 04:50:55,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:50:55,703 INFO L276 IsEmpty]: Start isEmpty. Operand 4781 states and 7389 transitions. [2024-10-11 04:50:55,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 04:50:55,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:55,705 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:55,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 04:50:55,705 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:55,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:55,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1074221385, now seen corresponding path program 1 times [2024-10-11 04:50:55,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:55,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264191212] [2024-10-11 04:50:55,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:55,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:55,808 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:50:55,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:55,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264191212] [2024-10-11 04:50:55,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264191212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:55,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:55,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:55,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952532520] [2024-10-11 04:50:55,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:55,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:55,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:55,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:55,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:55,812 INFO L87 Difference]: Start difference. First operand 4781 states and 7389 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:50:55,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:55,877 INFO L93 Difference]: Finished difference Result 6397 states and 9653 transitions. [2024-10-11 04:50:55,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:55,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-11 04:50:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:55,885 INFO L225 Difference]: With dead ends: 6397 [2024-10-11 04:50:55,885 INFO L226 Difference]: Without dead ends: 3171 [2024-10-11 04:50:55,891 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:50:55,892 INFO L432 NwaCegarLoop]: 1556 mSDtfsCounter, 38 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3058 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:50:55,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3058 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2024-10-11 04:50:55,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 3169. [2024-10-11 04:50:55,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3169 states, 3167 states have (on average 1.6106725607830754) internal successors, (5101), 3168 states have internal predecessors, (5101), 0 states have call successors, (0), 0 states have 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:50:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3169 states to 3169 states and 5101 transitions. [2024-10-11 04:50:55,975 INFO L78 Accepts]: Start accepts. Automaton has 3169 states and 5101 transitions. Word has length 78 [2024-10-11 04:50:55,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:55,975 INFO L471 AbstractCegarLoop]: Abstraction has 3169 states and 5101 transitions. [2024-10-11 04:50:55,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:50:55,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3169 states and 5101 transitions. [2024-10-11 04:50:55,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 04:50:55,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:55,977 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:55,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 04:50:55,978 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:55,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:55,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1531444265, now seen corresponding path program 1 times [2024-10-11 04:50:55,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:55,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834142411] [2024-10-11 04:50:55,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:55,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:56,075 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:50:56,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:56,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834142411] [2024-10-11 04:50:56,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834142411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:56,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:56,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:56,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798838720] [2024-10-11 04:50:56,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:56,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:56,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:56,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:56,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:56,078 INFO L87 Difference]: Start difference. First operand 3169 states and 5101 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:56,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:56,131 INFO L93 Difference]: Finished difference Result 3979 states and 6221 transitions. [2024-10-11 04:50:56,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:56,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-11 04:50:56,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:56,143 INFO L225 Difference]: With dead ends: 3979 [2024-10-11 04:50:56,145 INFO L226 Difference]: Without dead ends: 2365 [2024-10-11 04:50:56,153 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:50:56,154 INFO L432 NwaCegarLoop]: 1549 mSDtfsCounter, 35 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3043 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:50:56,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3043 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:56,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2024-10-11 04:50:56,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2363. [2024-10-11 04:50:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 2361 states have (on average 1.6814908936891149) internal successors, (3970), 2362 states have internal predecessors, (3970), 0 states have call successors, (0), 0 states have 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:50:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3970 transitions. [2024-10-11 04:50:56,218 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3970 transitions. Word has length 80 [2024-10-11 04:50:56,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:56,218 INFO L471 AbstractCegarLoop]: Abstraction has 2363 states and 3970 transitions. [2024-10-11 04:50:56,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:56,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3970 transitions. [2024-10-11 04:50:56,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 04:50:56,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:56,219 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:56,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 04:50:56,220 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:56,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:56,220 INFO L85 PathProgramCache]: Analyzing trace with hash 405696485, now seen corresponding path program 1 times [2024-10-11 04:50:56,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:56,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145578065] [2024-10-11 04:50:56,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:56,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:56,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:56,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145578065] [2024-10-11 04:50:56,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145578065] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:50:56,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325989180] [2024-10-11 04:50:56,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:56,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:50:56,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:50:56,693 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:50:56,696 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:50:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:56,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 04:50:56,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:50:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:50:57,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:50:57,283 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:50:57,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325989180] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:50:57,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:50:57,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 4] total 15 [2024-10-11 04:50:57,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313051667] [2024-10-11 04:50:57,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:50:57,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 04:50:57,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:57,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 04:50:57,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-10-11 04:50:57,286 INFO L87 Difference]: Start difference. First operand 2363 states and 3970 transitions. Second operand has 15 states, 15 states have (on average 15.466666666666667) internal successors, (232), 15 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have 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:50:58,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:58,909 INFO L93 Difference]: Finished difference Result 7478 states and 10826 transitions. [2024-10-11 04:50:58,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-11 04:50:58,909 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 15.466666666666667) internal successors, (232), 15 states have internal predecessors, (232), 0 states have call successors, (0), 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 82 [2024-10-11 04:50:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:58,920 INFO L225 Difference]: With dead ends: 7478 [2024-10-11 04:50:58,921 INFO L226 Difference]: Without dead ends: 6670 [2024-10-11 04:50:58,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=462, Invalid=1608, Unknown=0, NotChecked=0, Total=2070 [2024-10-11 04:50:58,926 INFO L432 NwaCegarLoop]: 1514 mSDtfsCounter, 14746 mSDsluCounter, 6317 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14746 SdHoareTripleChecker+Valid, 7831 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:58,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14746 Valid, 7831 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 04:50:58,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6670 states. [2024-10-11 04:50:59,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6670 to 6522. [2024-10-11 04:50:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6522 states, 6520 states have (on average 1.4276073619631902) internal successors, (9308), 6521 states have internal predecessors, (9308), 0 states have call successors, (0), 0 states have 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:50:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6522 states to 6522 states and 9308 transitions. [2024-10-11 04:50:59,133 INFO L78 Accepts]: Start accepts. Automaton has 6522 states and 9308 transitions. Word has length 82 [2024-10-11 04:50:59,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:59,133 INFO L471 AbstractCegarLoop]: Abstraction has 6522 states and 9308 transitions. [2024-10-11 04:50:59,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 15.466666666666667) internal successors, (232), 15 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have 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:50:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 6522 states and 9308 transitions. [2024-10-11 04:50:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 04:50:59,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:59,135 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:59,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 04:50:59,336 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,SelfDestructingSolverStorable22 [2024-10-11 04:50:59,336 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:59,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:59,337 INFO L85 PathProgramCache]: Analyzing trace with hash 818188177, now seen corresponding path program 1 times [2024-10-11 04:50:59,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:59,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826118521] [2024-10-11 04:50:59,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:59,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:59,757 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:59,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:59,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826118521] [2024-10-11 04:50:59,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826118521] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:50:59,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997907225] [2024-10-11 04:50:59,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:59,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:50:59,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:50:59,760 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:50:59,762 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:50:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:59,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 04:50:59,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:51:00,645 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:51:00,645 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:51:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:51:01,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997907225] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:51:01,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:51:01,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 30 [2024-10-11 04:51:01,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604936159] [2024-10-11 04:51:01,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:51:01,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 04:51:01,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:51:01,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 04:51:01,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2024-10-11 04:51:01,873 INFO L87 Difference]: Start difference. First operand 6522 states and 9308 transitions. Second operand has 30 states, 30 states have (on average 7.233333333333333) internal successors, (217), 30 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:51:03,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:51:03,014 INFO L93 Difference]: Finished difference Result 16502 states and 22345 transitions. [2024-10-11 04:51:03,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 04:51:03,014 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.233333333333333) internal successors, (217), 30 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-10-11 04:51:03,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:51:03,031 INFO L225 Difference]: With dead ends: 16502 [2024-10-11 04:51:03,032 INFO L226 Difference]: Without dead ends: 11753 [2024-10-11 04:51:03,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=468, Invalid=1512, Unknown=0, NotChecked=0, Total=1980 [2024-10-11 04:51:03,041 INFO L432 NwaCegarLoop]: 1508 mSDtfsCounter, 14992 mSDsluCounter, 7884 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14992 SdHoareTripleChecker+Valid, 9392 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:51:03,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14992 Valid, 9392 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 04:51:03,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11753 states. [2024-10-11 04:51:03,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11753 to 11601. [2024-10-11 04:51:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11601 states, 11599 states have (on average 1.356237606690232) internal successors, (15731), 11600 states have internal predecessors, (15731), 0 states have call successors, (0), 0 states have 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:51:03,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11601 states to 11601 states and 15731 transitions. [2024-10-11 04:51:03,451 INFO L78 Accepts]: Start accepts. Automaton has 11601 states and 15731 transitions. Word has length 83 [2024-10-11 04:51:03,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:51:03,452 INFO L471 AbstractCegarLoop]: Abstraction has 11601 states and 15731 transitions. [2024-10-11 04:51:03,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.233333333333333) internal successors, (217), 30 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:51:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 11601 states and 15731 transitions. [2024-10-11 04:51:03,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 04:51:03,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:51:03,454 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:51:03,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 04:51:03,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:51:03,655 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:51:03,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:51:03,656 INFO L85 PathProgramCache]: Analyzing trace with hash -660071279, now seen corresponding path program 1 times [2024-10-11 04:51:03,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:51:03,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665612929] [2024-10-11 04:51:03,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:03,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:51:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:51:05,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:51:05,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665612929] [2024-10-11 04:51:05,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665612929] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:51:05,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192514814] [2024-10-11 04:51:05,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:05,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:51:05,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:51:05,273 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:51:05,275 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:51:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:05,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:51:05,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:51:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:51:05,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:51:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:51:06,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192514814] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:51:06,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:51:06,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2024-10-11 04:51:06,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533155892] [2024-10-11 04:51:06,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:51:06,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 04:51:06,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:51:06,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 04:51:06,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2024-10-11 04:51:06,894 INFO L87 Difference]: Start difference. First operand 11601 states and 15731 transitions. Second operand has 29 states, 29 states have (on average 8.03448275862069) internal successors, (233), 28 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have 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:51:09,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:51:09,311 INFO L93 Difference]: Finished difference Result 45608 states and 60230 transitions. [2024-10-11 04:51:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-11 04:51:09,312 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.03448275862069) internal successors, (233), 28 states have internal predecessors, (233), 0 states have call successors, (0), 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 83 [2024-10-11 04:51:09,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:51:09,359 INFO L225 Difference]: With dead ends: 45608 [2024-10-11 04:51:09,359 INFO L226 Difference]: Without dead ends: 35955 [2024-10-11 04:51:09,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=826, Invalid=2956, Unknown=0, NotChecked=0, Total=3782 [2024-10-11 04:51:09,377 INFO L432 NwaCegarLoop]: 1506 mSDtfsCounter, 22708 mSDsluCounter, 7894 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22708 SdHoareTripleChecker+Valid, 9400 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:51:09,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22708 Valid, 9400 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 04:51:09,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35955 states. [2024-10-11 04:51:10,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35955 to 35655. [2024-10-11 04:51:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35655 states, 35653 states have (on average 1.296412644097271) internal successors, (46221), 35654 states have internal predecessors, (46221), 0 states have call successors, (0), 0 states have 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:51:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35655 states to 35655 states and 46221 transitions. [2024-10-11 04:51:10,342 INFO L78 Accepts]: Start accepts. Automaton has 35655 states and 46221 transitions. Word has length 83 [2024-10-11 04:51:10,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:51:10,342 INFO L471 AbstractCegarLoop]: Abstraction has 35655 states and 46221 transitions. [2024-10-11 04:51:10,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.03448275862069) internal successors, (233), 28 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have 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:51:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 35655 states and 46221 transitions. [2024-10-11 04:51:10,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 04:51:10,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:51:10,344 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:51:10,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 04:51:10,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:51:10,545 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:51:10,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:51:10,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1005141663, now seen corresponding path program 1 times [2024-10-11 04:51:10,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:51:10,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893246235] [2024-10-11 04:51:10,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:10,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:51:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:11,048 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:51:11,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:51:11,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893246235] [2024-10-11 04:51:11,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893246235] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:51:11,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478958995] [2024-10-11 04:51:11,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:11,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:51:11,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:51:11,051 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:51:11,053 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:51:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:11,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 04:51:11,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:51:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:51:11,826 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:51:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:51:13,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478958995] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:51:13,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:51:13,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2024-10-11 04:51:13,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379140211] [2024-10-11 04:51:13,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:51:13,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 04:51:13,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:51:13,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 04:51:13,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2024-10-11 04:51:13,003 INFO L87 Difference]: Start difference. First operand 35655 states and 46221 transitions. Second operand has 29 states, 29 states have (on average 8.206896551724139) internal successors, (238), 29 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have 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:51:14,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:51:14,739 INFO L93 Difference]: Finished difference Result 93631 states and 120016 transitions. [2024-10-11 04:51:14,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 04:51:14,740 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.206896551724139) internal successors, (238), 29 states have internal predecessors, (238), 0 states have call successors, (0), 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 85 [2024-10-11 04:51:14,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:51:14,823 INFO L225 Difference]: With dead ends: 93631 [2024-10-11 04:51:14,823 INFO L226 Difference]: Without dead ends: 64487 [2024-10-11 04:51:14,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=441, Invalid=1451, Unknown=0, NotChecked=0, Total=1892 [2024-10-11 04:51:14,856 INFO L432 NwaCegarLoop]: 1514 mSDtfsCounter, 9314 mSDsluCounter, 6416 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9314 SdHoareTripleChecker+Valid, 7930 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:51:14,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9314 Valid, 7930 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 04:51:14,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64487 states. [2024-10-11 04:51:16,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64487 to 54643. [2024-10-11 04:51:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54643 states, 54641 states have (on average 1.280284035797295) internal successors, (69956), 54642 states have internal predecessors, (69956), 0 states have call successors, (0), 0 states have 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:51:16,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54643 states to 54643 states and 69956 transitions. [2024-10-11 04:51:16,449 INFO L78 Accepts]: Start accepts. Automaton has 54643 states and 69956 transitions. Word has length 85 [2024-10-11 04:51:16,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:51:16,450 INFO L471 AbstractCegarLoop]: Abstraction has 54643 states and 69956 transitions. [2024-10-11 04:51:16,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.206896551724139) internal successors, (238), 29 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have 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:51:16,450 INFO L276 IsEmpty]: Start isEmpty. Operand 54643 states and 69956 transitions. [2024-10-11 04:51:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 04:51:16,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:51:16,453 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:51:16,473 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:51:16,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 04:51:16,654 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:51:16,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:51:16,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1893656427, now seen corresponding path program 1 times [2024-10-11 04:51:16,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:51:16,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240452208] [2024-10-11 04:51:16,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:16,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:51:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:51:17,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:51:17,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240452208] [2024-10-11 04:51:17,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240452208] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:51:17,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71298277] [2024-10-11 04:51:17,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:17,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:51:17,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:51:17,003 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:51:17,004 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:51:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:17,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:51:17,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:51:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:51:17,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:51:18,218 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:51:18,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71298277] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:51:18,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:51:18,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-10-11 04:51:18,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972420872] [2024-10-11 04:51:18,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:51:18,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 04:51:18,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:51:18,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 04:51:18,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-10-11 04:51:18,220 INFO L87 Difference]: Start difference. First operand 54643 states and 69956 transitions. Second operand has 22 states, 22 states have (on average 8.363636363636363) internal successors, (184), 21 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have 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:51:21,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:51:21,494 INFO L93 Difference]: Finished difference Result 154848 states and 197270 transitions. [2024-10-11 04:51:21,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 04:51:21,495 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.363636363636363) internal successors, (184), 21 states have internal predecessors, (184), 0 states have call successors, (0), 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 85 [2024-10-11 04:51:21,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:51:21,629 INFO L225 Difference]: With dead ends: 154848 [2024-10-11 04:51:21,630 INFO L226 Difference]: Without dead ends: 106180 [2024-10-11 04:51:21,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=747, Unknown=0, NotChecked=0, Total=992 [2024-10-11 04:51:21,661 INFO L432 NwaCegarLoop]: 1529 mSDtfsCounter, 12205 mSDsluCounter, 4776 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12205 SdHoareTripleChecker+Valid, 6305 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:51:21,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12205 Valid, 6305 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:51:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106180 states. [2024-10-11 04:51:25,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106180 to 104892. [2024-10-11 04:51:25,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104892 states, 104890 states have (on average 1.2558871198398323) internal successors, (131730), 104891 states have internal predecessors, (131730), 0 states have call successors, (0), 0 states have 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:51:25,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104892 states to 104892 states and 131730 transitions. [2024-10-11 04:51:25,464 INFO L78 Accepts]: Start accepts. Automaton has 104892 states and 131730 transitions. Word has length 85 [2024-10-11 04:51:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:51:25,464 INFO L471 AbstractCegarLoop]: Abstraction has 104892 states and 131730 transitions. [2024-10-11 04:51:25,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.363636363636363) internal successors, (184), 21 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have 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:51:25,464 INFO L276 IsEmpty]: Start isEmpty. Operand 104892 states and 131730 transitions. [2024-10-11 04:51:25,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 04:51:25,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:51:25,467 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:51:25,479 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:51:25,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 04:51:25,668 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:51:25,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:51:25,668 INFO L85 PathProgramCache]: Analyzing trace with hash -680929417, now seen corresponding path program 1 times [2024-10-11 04:51:25,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:51:25,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51721248] [2024-10-11 04:51:25,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:25,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:51:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:51:26,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:51:26,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51721248] [2024-10-11 04:51:26,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51721248] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:51:26,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032482401] [2024-10-11 04:51:26,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:26,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:51:26,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:51:26,864 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:51:26,866 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:51:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:27,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-10-11 04:51:27,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:51:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:51:32,923 INFO L311 TraceCheckSpWp]: Computing backward predicates...