./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_label05.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_label05.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 856625535901356ddeabfd0af746b720baf6ff17e69ade88869f423ab6af45bb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:50:43,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:50:43,954 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:43,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:50:43,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:50:43,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:50:43,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:50:43,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:50:43,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:50:43,976 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:50:43,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:50:43,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:50:43,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:50:43,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:50:43,978 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:50:43,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:50:43,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:50:43,979 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:50:43,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:50:43,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:50:43,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:50:43,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:50:43,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:50:43,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:50:43,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:50:43,985 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:50:43,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:50:43,985 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:50:43,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:50:43,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:50:43,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:50:43,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:50:43,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:50:43,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:50:43,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:50:43,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:50:43,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:50:43,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:50:43,991 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:50:43,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:50:43,991 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:50:43,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:50:43,992 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 -> 856625535901356ddeabfd0af746b720baf6ff17e69ade88869f423ab6af45bb [2024-10-11 04:50:44,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:50:44,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:50:44,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:50:44,293 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:50:44,294 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:50:44,295 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_label05.c [2024-10-11 04:50:45,775 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:50:46,128 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:50:46,129 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-10-11 04:50:46,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e0d624425/9a776a35c67e4172ba3dc7edfed3030a/FLAGff0698191 [2024-10-11 04:50:46,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e0d624425/9a776a35c67e4172ba3dc7edfed3030a [2024-10-11 04:50:46,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:50:46,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:50:46,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:50:46,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:50:46,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:50:46,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:50:46" (1/1) ... [2024-10-11 04:50:46,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5395a674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:46, skipping insertion in model container [2024-10-11 04:50:46,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:50:46" (1/1) ... [2024-10-11 04:50:46,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:50:46,718 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_label05.c[11742,11755] [2024-10-11 04:50:46,769 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_label05.c[18678,18691] [2024-10-11 04:50:47,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:50:47,341 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:50:47,361 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_label05.c[11742,11755] [2024-10-11 04:50:47,373 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_label05.c[18678,18691] [2024-10-11 04:50:47,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:50:47,710 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:50:47,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:47 WrapperNode [2024-10-11 04:50:47,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:50:47,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:50:47,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:50:47,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:50:47,718 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:47" (1/1) ... [2024-10-11 04:50:47,783 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:47" (1/1) ... [2024-10-11 04:50:47,972 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5095 [2024-10-11 04:50:47,973 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:50:47,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:50:47,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:50:47,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:50:47,983 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:47" (1/1) ... [2024-10-11 04:50:47,983 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:47" (1/1) ... [2024-10-11 04:50:48,015 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:47" (1/1) ... [2024-10-11 04:50:48,191 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:48,191 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:47" (1/1) ... [2024-10-11 04:50:48,191 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:47" (1/1) ... [2024-10-11 04:50:48,357 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:47" (1/1) ... [2024-10-11 04:50:48,383 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:47" (1/1) ... [2024-10-11 04:50:48,407 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:47" (1/1) ... [2024-10-11 04:50:48,423 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:47" (1/1) ... [2024-10-11 04:50:48,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:50:48,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:50:48,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:50:48,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:50:48,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:47" (1/1) ... [2024-10-11 04:50:48,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:50:48,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:50:48,507 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:48,511 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:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:50:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:50:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:50:48,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:50:48,638 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:50:48,640 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:50:52,053 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2024-10-11 04:50:52,053 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:50:52,097 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:50:52,097 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:50:52,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:50:52 BoogieIcfgContainer [2024-10-11 04:50:52,098 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:50:52,099 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:50:52,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:50:52,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:50:52,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:50:46" (1/3) ... [2024-10-11 04:50:52,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf7eb03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:50:52, skipping insertion in model container [2024-10-11 04:50:52,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:47" (2/3) ... [2024-10-11 04:50:52,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf7eb03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:50:52, skipping insertion in model container [2024-10-11 04:50:52,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:50:52" (3/3) ... [2024-10-11 04:50:52,108 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-10-11 04:50:52,134 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:50:52,138 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:50:52,210 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:50:52,216 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;@3697b550, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:50:52,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:50:52,227 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:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 04:50:52,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:52,234 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:52,235 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:52,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:52,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1603356568, now seen corresponding path program 1 times [2024-10-11 04:50:52,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:52,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496999148] [2024-10-11 04:50:52,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:52,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:52,539 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:52,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:52,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496999148] [2024-10-11 04:50:52,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496999148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:52,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:52,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:50:52,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536834433] [2024-10-11 04:50:52,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:52,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 04:50:52,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:52,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 04:50:52,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:50:52,616 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:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:52,789 INFO L93 Difference]: Finished difference Result 1632 states and 3215 transitions. [2024-10-11 04:50:52,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 04:50:52,791 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:52,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:52,829 INFO L225 Difference]: With dead ends: 1632 [2024-10-11 04:50:52,833 INFO L226 Difference]: Without dead ends: 830 [2024-10-11 04:50:52,843 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:52,851 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:52,854 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:52,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-10-11 04:50:52,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2024-10-11 04:50:53,000 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:53,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1571 transitions. [2024-10-11 04:50:53,008 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1571 transitions. Word has length 21 [2024-10-11 04:50:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:53,009 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1571 transitions. [2024-10-11 04:50:53,009 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:53,010 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1571 transitions. [2024-10-11 04:50:53,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 04:50:53,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:53,015 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:53,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:50:53,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:53,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:53,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1103262826, now seen corresponding path program 1 times [2024-10-11 04:50:53,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:53,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017633341] [2024-10-11 04:50:53,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:53,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:53,352 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:53,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:53,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017633341] [2024-10-11 04:50:53,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017633341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:53,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:53,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:50:53,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458945010] [2024-10-11 04:50:53,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:53,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:50:53,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:53,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:50:53,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:50:53,355 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:53,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:53,466 INFO L93 Difference]: Finished difference Result 874 states and 1640 transitions. [2024-10-11 04:50:53,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:50:53,467 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:53,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:53,471 INFO L225 Difference]: With dead ends: 874 [2024-10-11 04:50:53,471 INFO L226 Difference]: Without dead ends: 830 [2024-10-11 04:50:53,471 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:53,472 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:53,473 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:53,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-10-11 04:50:53,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2024-10-11 04:50:53,489 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:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1540 transitions. [2024-10-11 04:50:53,490 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1540 transitions. Word has length 21 [2024-10-11 04:50:53,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:53,491 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1540 transitions. [2024-10-11 04:50:53,491 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:53,491 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1540 transitions. [2024-10-11 04:50:53,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 04:50:53,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:53,492 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:53,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:50:53,493 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:53,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:53,493 INFO L85 PathProgramCache]: Analyzing trace with hash 51546625, now seen corresponding path program 1 times [2024-10-11 04:50:53,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:53,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112328976] [2024-10-11 04:50:53,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:53,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:53,691 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:53,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:53,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112328976] [2024-10-11 04:50:53,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112328976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:53,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:53,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:53,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549324588] [2024-10-11 04:50:53,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:53,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:53,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:53,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:53,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:53,695 INFO L87 Difference]: Start difference. First operand 830 states and 1540 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:53,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:53,948 INFO L93 Difference]: Finished difference Result 1240 states and 2200 transitions. [2024-10-11 04:50:53,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 04:50:53,949 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:53,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:53,955 INFO L225 Difference]: With dead ends: 1240 [2024-10-11 04:50:53,955 INFO L226 Difference]: Without dead ends: 1199 [2024-10-11 04:50:53,956 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:53,958 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:53,958 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:53,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2024-10-11 04:50:53,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 869. [2024-10-11 04:50:53,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 867 states have (on average 1.8489042675893888) internal successors, (1603), 868 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have 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,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1603 transitions. [2024-10-11 04:50:53,976 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1603 transitions. Word has length 51 [2024-10-11 04:50:53,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:53,978 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1603 transitions. [2024-10-11 04:50:53,979 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:53,979 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1603 transitions. [2024-10-11 04:50:53,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 04:50:53,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:53,980 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:53,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:50:53,981 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:53,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:53,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2145916561, now seen corresponding path program 1 times [2024-10-11 04:50:53,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:53,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718452309] [2024-10-11 04:50:53,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:53,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:54,081 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:54,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:54,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718452309] [2024-10-11 04:50:54,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718452309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:54,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:54,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:54,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442262951] [2024-10-11 04:50:54,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:54,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:54,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:54,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:54,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:54,084 INFO L87 Difference]: Start difference. First operand 869 states and 1603 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:54,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:54,118 INFO L93 Difference]: Finished difference Result 1018 states and 1842 transitions. [2024-10-11 04:50:54,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:54,119 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:54,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:54,122 INFO L225 Difference]: With dead ends: 1018 [2024-10-11 04:50:54,123 INFO L226 Difference]: Without dead ends: 938 [2024-10-11 04:50:54,125 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,126 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:54,127 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:54,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2024-10-11 04:50:54,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 936. [2024-10-11 04:50:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 934 states have (on average 1.8297644539614561) internal successors, (1709), 935 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have 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,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1709 transitions. [2024-10-11 04:50:54,145 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1709 transitions. Word has length 53 [2024-10-11 04:50:54,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:54,145 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1709 transitions. [2024-10-11 04:50:54,145 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:54,145 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1709 transitions. [2024-10-11 04:50:54,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 04:50:54,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:54,150 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:54,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:50:54,151 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:54,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:54,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2146905783, now seen corresponding path program 1 times [2024-10-11 04:50:54,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:54,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044436504] [2024-10-11 04:50:54,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:54,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:54,402 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:54,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:54,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044436504] [2024-10-11 04:50:54,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044436504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:54,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:54,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:54,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673118662] [2024-10-11 04:50:54,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:54,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:54,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:54,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:54,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:54,406 INFO L87 Difference]: Start difference. First operand 936 states and 1709 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:54,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:54,564 INFO L93 Difference]: Finished difference Result 1085 states and 1945 transitions. [2024-10-11 04:50:54,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:50:54,565 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:54,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:54,568 INFO L225 Difference]: With dead ends: 1085 [2024-10-11 04:50:54,568 INFO L226 Difference]: Without dead ends: 938 [2024-10-11 04:50:54,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:50:54,572 INFO L432 NwaCegarLoop]: 1530 mSDtfsCounter, 2990 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2990 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:54,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2990 Valid, 1781 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:54,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2024-10-11 04:50:54,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 936. [2024-10-11 04:50:54,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 934 states have (on average 1.8276231263383298) internal successors, (1707), 935 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have 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,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1707 transitions. [2024-10-11 04:50:54,590 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1707 transitions. Word has length 53 [2024-10-11 04:50:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:54,590 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1707 transitions. [2024-10-11 04:50:54,591 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:54,591 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1707 transitions. [2024-10-11 04:50:54,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 04:50:54,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:54,593 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:54,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:50:54,594 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:54,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:54,595 INFO L85 PathProgramCache]: Analyzing trace with hash 2036322024, now seen corresponding path program 1 times [2024-10-11 04:50:54,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:54,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167101642] [2024-10-11 04:50:54,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:54,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:54,810 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:54,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:54,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167101642] [2024-10-11 04:50:54,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167101642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:54,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:54,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:50:54,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096731029] [2024-10-11 04:50:54,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:54,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:50:54,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:54,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:50:54,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:50:54,813 INFO L87 Difference]: Start difference. First operand 936 states and 1707 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:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:54,853 INFO L93 Difference]: Finished difference Result 942 states and 1714 transitions. [2024-10-11 04:50:54,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:50:54,855 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:54,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:54,860 INFO L225 Difference]: With dead ends: 942 [2024-10-11 04:50:54,860 INFO L226 Difference]: Without dead ends: 940 [2024-10-11 04:50:54,861 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:54,863 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:54,864 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:54,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2024-10-11 04:50:54,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2024-10-11 04:50:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 938 states have (on average 1.8230277185501067) internal successors, (1710), 939 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have 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,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1710 transitions. [2024-10-11 04:50:54,891 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1710 transitions. Word has length 54 [2024-10-11 04:50:54,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:54,893 INFO L471 AbstractCegarLoop]: Abstraction has 940 states and 1710 transitions. [2024-10-11 04:50:54,893 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:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1710 transitions. [2024-10-11 04:50:54,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:50:54,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:54,895 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:54,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:50:54,895 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:54,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:54,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1922958665, now seen corresponding path program 1 times [2024-10-11 04:50:54,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:54,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109510279] [2024-10-11 04:50:54,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:54,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:54,975 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:54,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:54,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109510279] [2024-10-11 04:50:54,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109510279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:54,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:54,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:54,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748745351] [2024-10-11 04:50:54,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:54,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:54,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:54,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:54,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:54,978 INFO L87 Difference]: Start difference. First operand 940 states and 1710 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:55,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:55,009 INFO L93 Difference]: Finished difference Result 1102 states and 1963 transitions. [2024-10-11 04:50:55,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:55,009 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:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:55,013 INFO L225 Difference]: With dead ends: 1102 [2024-10-11 04:50:55,013 INFO L226 Difference]: Without dead ends: 1018 [2024-10-11 04:50:55,014 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,016 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:55,016 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:55,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2024-10-11 04:50:55,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1016. [2024-10-11 04:50:55,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1014 states have (on average 1.801775147928994) internal successors, (1827), 1015 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have 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,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1827 transitions. [2024-10-11 04:50:55,035 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1827 transitions. Word has length 55 [2024-10-11 04:50:55,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:55,036 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1827 transitions. [2024-10-11 04:50:55,036 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:55,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1827 transitions. [2024-10-11 04:50:55,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:50:55,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:55,037 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:55,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:50:55,037 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:55,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:55,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1694319433, now seen corresponding path program 1 times [2024-10-11 04:50:55,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:55,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858257357] [2024-10-11 04:50:55,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:55,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:55,118 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:55,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:55,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858257357] [2024-10-11 04:50:55,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858257357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:55,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:55,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:55,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314736842] [2024-10-11 04:50:55,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:55,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:55,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:55,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:55,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:55,120 INFO L87 Difference]: Start difference. First operand 1016 states and 1827 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:55,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:55,174 INFO L93 Difference]: Finished difference Result 1442 states and 2487 transitions. [2024-10-11 04:50:55,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:55,174 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:55,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:55,179 INFO L225 Difference]: With dead ends: 1442 [2024-10-11 04:50:55,179 INFO L226 Difference]: Without dead ends: 1217 [2024-10-11 04:50:55,180 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,181 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:55,181 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:55,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2024-10-11 04:50:55,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1215. [2024-10-11 04:50:55,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1213 states have (on average 1.7551525144270403) internal successors, (2129), 1214 states have internal predecessors, (2129), 0 states have call successors, (0), 0 states have 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,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 2129 transitions. [2024-10-11 04:50:55,221 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 2129 transitions. Word has length 55 [2024-10-11 04:50:55,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:55,222 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 2129 transitions. [2024-10-11 04:50:55,222 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:55,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 2129 transitions. [2024-10-11 04:50:55,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:50:55,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:55,223 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:55,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:50:55,223 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:55,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:55,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1068663369, now seen corresponding path program 1 times [2024-10-11 04:50:55,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:55,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659796364] [2024-10-11 04:50:55,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:55,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:55,291 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:55,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:55,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659796364] [2024-10-11 04:50:55,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659796364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:55,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:55,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:55,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202168533] [2024-10-11 04:50:55,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:55,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:55,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:55,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:55,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:55,296 INFO L87 Difference]: Start difference. First operand 1215 states and 2129 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:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:55,334 INFO L93 Difference]: Finished difference Result 2015 states and 3351 transitions. [2024-10-11 04:50:55,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:55,334 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:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:55,339 INFO L225 Difference]: With dead ends: 2015 [2024-10-11 04:50:55,339 INFO L226 Difference]: Without dead ends: 1591 [2024-10-11 04:50:55,341 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,343 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:55,343 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:55,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2024-10-11 04:50:55,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1589. [2024-10-11 04:50:55,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1587 states have (on average 1.6918714555765595) internal successors, (2685), 1588 states have internal predecessors, (2685), 0 states have call successors, (0), 0 states have 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,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2685 transitions. [2024-10-11 04:50:55,389 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2685 transitions. Word has length 55 [2024-10-11 04:50:55,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:55,389 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 2685 transitions. [2024-10-11 04:50:55,389 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:55,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2685 transitions. [2024-10-11 04:50:55,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:50:55,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:55,390 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:55,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:50:55,391 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:55,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:55,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1957396809, now seen corresponding path program 1 times [2024-10-11 04:50:55,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:55,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667671187] [2024-10-11 04:50:55,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:55,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:55,443 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:55,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:55,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667671187] [2024-10-11 04:50:55,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667671187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:55,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:55,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:55,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161980532] [2024-10-11 04:50:55,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:55,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:55,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:55,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:55,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:55,446 INFO L87 Difference]: Start difference. First operand 1589 states and 2685 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:55,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:55,498 INFO L93 Difference]: Finished difference Result 3089 states and 4935 transitions. [2024-10-11 04:50:55,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:55,498 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:55,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:55,506 INFO L225 Difference]: With dead ends: 3089 [2024-10-11 04:50:55,506 INFO L226 Difference]: Without dead ends: 2291 [2024-10-11 04:50:55,508 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,508 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:55,509 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:55,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2024-10-11 04:50:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2289. [2024-10-11 04:50:55,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2289 states, 2287 states have (on average 1.6182772190642762) internal successors, (3701), 2288 states have internal predecessors, (3701), 0 states have call successors, (0), 0 states have 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,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2289 states to 2289 states and 3701 transitions. [2024-10-11 04:50:55,573 INFO L78 Accepts]: Start accepts. Automaton has 2289 states and 3701 transitions. Word has length 55 [2024-10-11 04:50:55,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:55,573 INFO L471 AbstractCegarLoop]: Abstraction has 2289 states and 3701 transitions. [2024-10-11 04:50:55,573 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:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states and 3701 transitions. [2024-10-11 04:50:55,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:50:55,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:55,574 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:55,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:50:55,575 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:55,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:55,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1654375497, now seen corresponding path program 1 times [2024-10-11 04:50:55,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:55,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118916679] [2024-10-11 04:50:55,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:55,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:55,642 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:55,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:55,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118916679] [2024-10-11 04:50:55,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118916679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:55,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:55,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:55,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403479721] [2024-10-11 04:50:55,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:55,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:55,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:55,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:55,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:55,644 INFO L87 Difference]: Start difference. First operand 2289 states and 3701 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:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:55,719 INFO L93 Difference]: Finished difference Result 5093 states and 7815 transitions. [2024-10-11 04:50:55,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:55,720 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:55,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:55,732 INFO L225 Difference]: With dead ends: 5093 [2024-10-11 04:50:55,733 INFO L226 Difference]: Without dead ends: 3595 [2024-10-11 04:50:55,737 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,738 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:55,738 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:55,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3595 states. [2024-10-11 04:50:55,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3595 to 3593. [2024-10-11 04:50:55,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3593 states, 3591 states have (on average 1.5430242272347536) internal successors, (5541), 3592 states have internal predecessors, (5541), 0 states have call successors, (0), 0 states have 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,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 5541 transitions. [2024-10-11 04:50:55,834 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 5541 transitions. Word has length 55 [2024-10-11 04:50:55,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:55,835 INFO L471 AbstractCegarLoop]: Abstraction has 3593 states and 5541 transitions. [2024-10-11 04:50:55,835 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:55,835 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 5541 transitions. [2024-10-11 04:50:55,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 04:50:55,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:55,836 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:55,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:50:55,836 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:55,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:55,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1592910316, now seen corresponding path program 1 times [2024-10-11 04:50:55,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:55,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193875262] [2024-10-11 04:50:55,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:55,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:56,002 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:56,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:56,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193875262] [2024-10-11 04:50:56,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193875262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:56,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:56,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:56,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497029784] [2024-10-11 04:50:56,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:56,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:50:56,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:56,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:50:56,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:50:56,004 INFO L87 Difference]: Start difference. First operand 3593 states and 5541 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:01,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:51:01,262 INFO L93 Difference]: Finished difference Result 5848 states and 9850 transitions. [2024-10-11 04:51:01,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:51:01,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-11 04:51:01,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:51:01,277 INFO L225 Difference]: With dead ends: 5848 [2024-10-11 04:51:01,277 INFO L226 Difference]: Without dead ends: 5095 [2024-10-11 04:51:01,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:51:01,280 INFO L432 NwaCegarLoop]: 791 mSDtfsCounter, 2402 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5157 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2402 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 6402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:51:01,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2402 Valid, 809 Invalid, 6402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5157 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-11 04:51:01,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5095 states. [2024-10-11 04:51:01,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5095 to 5095. [2024-10-11 04:51:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5095 states, 5093 states have (on average 1.475947378755154) internal successors, (7517), 5094 states have internal predecessors, (7517), 0 states have call successors, (0), 0 states have 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:01,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5095 states to 5095 states and 7517 transitions. [2024-10-11 04:51:01,376 INFO L78 Accepts]: Start accepts. Automaton has 5095 states and 7517 transitions. Word has length 59 [2024-10-11 04:51:01,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:51:01,377 INFO L471 AbstractCegarLoop]: Abstraction has 5095 states and 7517 transitions. [2024-10-11 04:51:01,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 5095 states and 7517 transitions. [2024-10-11 04:51:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 04:51:01,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:51:01,381 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:51:01,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:51:01,381 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:51:01,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:51:01,382 INFO L85 PathProgramCache]: Analyzing trace with hash 285878162, now seen corresponding path program 1 times [2024-10-11 04:51:01,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:51:01,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286532362] [2024-10-11 04:51:01,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:01,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:51:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:01,507 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:51:01,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:51:01,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286532362] [2024-10-11 04:51:01,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286532362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:51:01,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:51:01,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:51:01,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540686164] [2024-10-11 04:51:01,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:51:01,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:51:01,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:51:01,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:51:01,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:51:01,509 INFO L87 Difference]: Start difference. First operand 5095 states and 7517 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:51:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:51:01,889 INFO L93 Difference]: Finished difference Result 18883 states and 27507 transitions. [2024-10-11 04:51:01,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:51:01,890 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:51:01,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:51:01,943 INFO L225 Difference]: With dead ends: 18883 [2024-10-11 04:51:01,943 INFO L226 Difference]: Without dead ends: 16897 [2024-10-11 04:51:01,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:51:01,953 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:51:01,953 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:51:01,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16897 states. [2024-10-11 04:51:02,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16897 to 7495. [2024-10-11 04:51:02,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7495 states, 7493 states have (on average 1.462298144935273) internal successors, (10957), 7494 states have internal predecessors, (10957), 0 states have call successors, (0), 0 states have 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:02,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7495 states to 7495 states and 10957 transitions. [2024-10-11 04:51:02,173 INFO L78 Accepts]: Start accepts. Automaton has 7495 states and 10957 transitions. Word has length 73 [2024-10-11 04:51:02,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:51:02,174 INFO L471 AbstractCegarLoop]: Abstraction has 7495 states and 10957 transitions. [2024-10-11 04:51:02,174 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:51:02,174 INFO L276 IsEmpty]: Start isEmpty. Operand 7495 states and 10957 transitions. [2024-10-11 04:51:02,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 04:51:02,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:51:02,176 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:51:02,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:51:02,176 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:51:02,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:51:02,176 INFO L85 PathProgramCache]: Analyzing trace with hash 57238930, now seen corresponding path program 1 times [2024-10-11 04:51:02,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:51:02,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105430280] [2024-10-11 04:51:02,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:02,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:51:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:02,289 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:51:02,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:51:02,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105430280] [2024-10-11 04:51:02,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105430280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:51:02,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:51:02,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:51:02,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934011397] [2024-10-11 04:51:02,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:51:02,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:51:02,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:51:02,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:51:02,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:51:02,291 INFO L87 Difference]: Start difference. First operand 7495 states and 10957 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:51:02,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:51:02,728 INFO L93 Difference]: Finished difference Result 21683 states and 31539 transitions. [2024-10-11 04:51:02,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:51:02,729 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:51:02,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:51:02,757 INFO L225 Difference]: With dead ends: 21683 [2024-10-11 04:51:02,758 INFO L226 Difference]: Without dead ends: 18881 [2024-10-11 04:51:02,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:51:02,765 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 6338 mSDsluCounter, 1978 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6338 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:51:02,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6338 Valid, 3574 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:51:02,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18881 states. [2024-10-11 04:51:03,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18881 to 11287. [2024-10-11 04:51:03,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11287 states, 11285 states have (on average 1.4515728843597695) internal successors, (16381), 11286 states have internal predecessors, (16381), 0 states have call successors, (0), 0 states have 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,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11287 states to 11287 states and 16381 transitions. [2024-10-11 04:51:03,046 INFO L78 Accepts]: Start accepts. Automaton has 11287 states and 16381 transitions. Word has length 73 [2024-10-11 04:51:03,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:51:03,047 INFO L471 AbstractCegarLoop]: Abstraction has 11287 states and 16381 transitions. [2024-10-11 04:51:03,047 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:51:03,047 INFO L276 IsEmpty]: Start isEmpty. Operand 11287 states and 16381 transitions. [2024-10-11 04:51:03,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 04:51:03,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:51:03,049 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:51:03,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:51:03,049 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:51:03,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:51:03,050 INFO L85 PathProgramCache]: Analyzing trace with hash -568417134, now seen corresponding path program 1 times [2024-10-11 04:51:03,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:51:03,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104594009] [2024-10-11 04:51:03,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:03,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:51:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:03,167 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:51:03,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:51:03,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104594009] [2024-10-11 04:51:03,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104594009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:51:03,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:51:03,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:51:03,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781428762] [2024-10-11 04:51:03,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:51:03,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:51:03,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:51:03,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:51:03,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:51:03,169 INFO L87 Difference]: Start difference. First operand 11287 states and 16381 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:51:03,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:51:03,714 INFO L93 Difference]: Finished difference Result 24483 states and 35555 transitions. [2024-10-11 04:51:03,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:51:03,714 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:51:03,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:51:03,747 INFO L225 Difference]: With dead ends: 24483 [2024-10-11 04:51:03,747 INFO L226 Difference]: Without dead ends: 21681 [2024-10-11 04:51:03,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:51:03,757 INFO L432 NwaCegarLoop]: 1594 mSDtfsCounter, 6383 mSDsluCounter, 1945 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6383 SdHoareTripleChecker+Valid, 3539 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:51:03,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6383 Valid, 3539 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:51:03,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21681 states. [2024-10-11 04:51:04,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21681 to 14087. [2024-10-11 04:51:04,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14087 states, 14085 states have (on average 1.448136315228967) internal successors, (20397), 14086 states have internal predecessors, (20397), 0 states have call successors, (0), 0 states have 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:04,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14087 states to 14087 states and 20397 transitions. [2024-10-11 04:51:04,251 INFO L78 Accepts]: Start accepts. Automaton has 14087 states and 20397 transitions. Word has length 73 [2024-10-11 04:51:04,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:51:04,252 INFO L471 AbstractCegarLoop]: Abstraction has 14087 states and 20397 transitions. [2024-10-11 04:51:04,252 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:51:04,253 INFO L276 IsEmpty]: Start isEmpty. Operand 14087 states and 20397 transitions. [2024-10-11 04:51:04,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 04:51:04,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:51:04,255 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:51:04,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:51:04,255 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:51:04,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:51:04,255 INFO L85 PathProgramCache]: Analyzing trace with hash 320316306, now seen corresponding path program 1 times [2024-10-11 04:51:04,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:51:04,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117941418] [2024-10-11 04:51:04,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:04,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:51:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:04,391 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:51:04,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:51:04,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117941418] [2024-10-11 04:51:04,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117941418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:51:04,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:51:04,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:51:04,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298656196] [2024-10-11 04:51:04,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:51:04,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:51:04,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:51:04,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:51:04,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:51:04,394 INFO L87 Difference]: Start difference. First operand 14087 states and 20397 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:51:04,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:51:04,977 INFO L93 Difference]: Finished difference Result 27283 states and 39571 transitions. [2024-10-11 04:51:04,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:51:04,978 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:51:04,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:51:05,011 INFO L225 Difference]: With dead ends: 27283 [2024-10-11 04:51:05,012 INFO L226 Difference]: Without dead ends: 24481 [2024-10-11 04:51:05,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:51:05,019 INFO L432 NwaCegarLoop]: 1594 mSDtfsCounter, 6339 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6339 SdHoareTripleChecker+Valid, 3590 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:51:05,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6339 Valid, 3590 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:51:05,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24481 states. [2024-10-11 04:51:05,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24481 to 16887. [2024-10-11 04:51:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16887 states, 16885 states have (on average 1.445839502517027) internal successors, (24413), 16886 states have internal predecessors, (24413), 0 states have call successors, (0), 0 states have 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:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16887 states to 16887 states and 24413 transitions. [2024-10-11 04:51:05,412 INFO L78 Accepts]: Start accepts. Automaton has 16887 states and 24413 transitions. Word has length 73 [2024-10-11 04:51:05,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:51:05,412 INFO L471 AbstractCegarLoop]: Abstraction has 16887 states and 24413 transitions. [2024-10-11 04:51:05,413 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:51:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand 16887 states and 24413 transitions. [2024-10-11 04:51:05,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 04:51:05,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:51:05,414 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:51:05,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 04:51:05,415 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:51:05,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:51:05,415 INFO L85 PathProgramCache]: Analyzing trace with hash 17294994, now seen corresponding path program 1 times [2024-10-11 04:51:05,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:51:05,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617829042] [2024-10-11 04:51:05,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:05,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:51:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:05,517 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:51:05,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:51:05,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617829042] [2024-10-11 04:51:05,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617829042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:51:05,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:51:05,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:51:05,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877076893] [2024-10-11 04:51:05,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:51:05,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:51:05,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:51:05,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:51:05,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:51:05,519 INFO L87 Difference]: Start difference. First operand 16887 states and 24413 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:51:06,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:51:06,135 INFO L93 Difference]: Finished difference Result 30083 states and 43587 transitions. [2024-10-11 04:51:06,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:51:06,135 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:51:06,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:51:06,173 INFO L225 Difference]: With dead ends: 30083 [2024-10-11 04:51:06,173 INFO L226 Difference]: Without dead ends: 27281 [2024-10-11 04:51:06,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:51:06,179 INFO L432 NwaCegarLoop]: 1593 mSDtfsCounter, 6293 mSDsluCounter, 2072 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6293 SdHoareTripleChecker+Valid, 3665 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:51:06,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6293 Valid, 3665 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:51:06,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27281 states. [2024-10-11 04:51:06,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27281 to 19687. [2024-10-11 04:51:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19687 states, 19685 states have (on average 1.4441960883921767) internal successors, (28429), 19686 states have internal predecessors, (28429), 0 states have call successors, (0), 0 states have 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:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19687 states to 19687 states and 28429 transitions. [2024-10-11 04:51:06,642 INFO L78 Accepts]: Start accepts. Automaton has 19687 states and 28429 transitions. Word has length 73 [2024-10-11 04:51:06,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:51:06,642 INFO L471 AbstractCegarLoop]: Abstraction has 19687 states and 28429 transitions. [2024-10-11 04:51:06,643 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:51:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 19687 states and 28429 transitions. [2024-10-11 04:51:06,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 04:51:06,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:51:06,645 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:51:06,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 04:51:06,645 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:51:06,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:51:06,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1436271534, now seen corresponding path program 1 times [2024-10-11 04:51:06,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:51:06,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434662866] [2024-10-11 04:51:06,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:06,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:51:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:06,713 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:51:06,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:51:06,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434662866] [2024-10-11 04:51:06,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434662866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:51:06,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:51:06,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:51:06,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331417887] [2024-10-11 04:51:06,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:51:06,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:51:06,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:51:06,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:51:06,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:51:06,715 INFO L87 Difference]: Start difference. First operand 19687 states and 28429 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:51:07,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:51:07,028 INFO L93 Difference]: Finished difference Result 37083 states and 53407 transitions. [2024-10-11 04:51:07,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:51:07,028 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:51:07,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:51:07,060 INFO L225 Difference]: With dead ends: 37083 [2024-10-11 04:51:07,060 INFO L226 Difference]: Without dead ends: 19689 [2024-10-11 04:51:07,079 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:51:07,079 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:51:07,079 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:51:07,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19689 states. [2024-10-11 04:51:07,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19689 to 19687. [2024-10-11 04:51:07,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19687 states, 19685 states have (on average 1.4291592583185166) internal successors, (28133), 19686 states have internal predecessors, (28133), 0 states have call successors, (0), 0 states have 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:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19687 states to 19687 states and 28133 transitions. [2024-10-11 04:51:07,597 INFO L78 Accepts]: Start accepts. Automaton has 19687 states and 28133 transitions. Word has length 74 [2024-10-11 04:51:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:51:07,598 INFO L471 AbstractCegarLoop]: Abstraction has 19687 states and 28133 transitions. [2024-10-11 04:51:07,598 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:51:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 19687 states and 28133 transitions. [2024-10-11 04:51:07,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 04:51:07,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:51:07,601 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:51:07,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 04:51:07,601 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:51:07,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:51:07,601 INFO L85 PathProgramCache]: Analyzing trace with hash -702984806, now seen corresponding path program 1 times [2024-10-11 04:51:07,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:51:07,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819529445] [2024-10-11 04:51:07,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:07,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:51:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:07,698 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:51:07,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:51:07,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819529445] [2024-10-11 04:51:07,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819529445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:51:07,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:51:07,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:51:07,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562197936] [2024-10-11 04:51:07,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:51:07,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:51:07,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:51:07,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:51:07,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:51:07,699 INFO L87 Difference]: Start difference. First operand 19687 states and 28133 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:51:07,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:51:07,861 INFO L93 Difference]: Finished difference Result 26157 states and 37410 transitions. [2024-10-11 04:51:07,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:51:07,861 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:51:07,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:51:07,875 INFO L225 Difference]: With dead ends: 26157 [2024-10-11 04:51:07,876 INFO L226 Difference]: Without dead ends: 8763 [2024-10-11 04:51:07,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:51:07,891 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:51:07,891 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:51:07,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8763 states. [2024-10-11 04:51:08,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8763 to 8756. [2024-10-11 04:51:08,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8756 states, 8754 states have (on average 1.4413982179575051) internal successors, (12618), 8755 states have internal predecessors, (12618), 0 states have call successors, (0), 0 states have 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:08,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8756 states to 8756 states and 12618 transitions. [2024-10-11 04:51:08,061 INFO L78 Accepts]: Start accepts. Automaton has 8756 states and 12618 transitions. Word has length 75 [2024-10-11 04:51:08,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:51:08,061 INFO L471 AbstractCegarLoop]: Abstraction has 8756 states and 12618 transitions. [2024-10-11 04:51:08,061 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:51:08,061 INFO L276 IsEmpty]: Start isEmpty. Operand 8756 states and 12618 transitions. [2024-10-11 04:51:08,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 04:51:08,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:51:08,063 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:51:08,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 04:51:08,064 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:51:08,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:51:08,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1790502652, now seen corresponding path program 1 times [2024-10-11 04:51:08,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:51:08,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982810025] [2024-10-11 04:51:08,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:08,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:51:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:08,158 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:51:08,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:51:08,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982810025] [2024-10-11 04:51:08,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982810025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:51:08,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:51:08,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:51:08,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606209134] [2024-10-11 04:51:08,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:51:08,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:51:08,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:51:08,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:51:08,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:51:08,160 INFO L87 Difference]: Start difference. First operand 8756 states and 12618 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:51:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:51:08,319 INFO L93 Difference]: Finished difference Result 11984 states and 17196 transitions. [2024-10-11 04:51:08,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:51:08,320 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:51:08,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:51:08,328 INFO L225 Difference]: With dead ends: 11984 [2024-10-11 04:51:08,328 INFO L226 Difference]: Without dead ends: 5534 [2024-10-11 04:51:08,334 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:51:08,335 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:51:08,335 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:51:08,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5534 states. [2024-10-11 04:51:08,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5534 to 5532. [2024-10-11 04:51:08,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5532 states, 5530 states have (on average 1.4448462929475587) internal successors, (7990), 5531 states have internal predecessors, (7990), 0 states have call successors, (0), 0 states have 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:08,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5532 states to 5532 states and 7990 transitions. [2024-10-11 04:51:08,476 INFO L78 Accepts]: Start accepts. Automaton has 5532 states and 7990 transitions. Word has length 76 [2024-10-11 04:51:08,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:51:08,476 INFO L471 AbstractCegarLoop]: Abstraction has 5532 states and 7990 transitions. [2024-10-11 04:51:08,477 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:51:08,477 INFO L276 IsEmpty]: Start isEmpty. Operand 5532 states and 7990 transitions. [2024-10-11 04:51:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 04:51:08,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:51:08,479 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:51:08,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 04:51:08,480 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:51:08,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:51:08,481 INFO L85 PathProgramCache]: Analyzing trace with hash -626519094, now seen corresponding path program 1 times [2024-10-11 04:51:08,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:51:08,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665452538] [2024-10-11 04:51:08,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:08,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:51:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:08,576 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:51:08,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:51:08,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665452538] [2024-10-11 04:51:08,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665452538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:51:08,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:51:08,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:51:08,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013807477] [2024-10-11 04:51:08,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:51:08,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:51:08,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:51:08,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:51:08,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:51:08,579 INFO L87 Difference]: Start difference. First operand 5532 states and 7990 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:51:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:51:08,654 INFO L93 Difference]: Finished difference Result 7148 states and 10254 transitions. [2024-10-11 04:51:08,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:51:08,655 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:51:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:51:08,662 INFO L225 Difference]: With dead ends: 7148 [2024-10-11 04:51:08,662 INFO L226 Difference]: Without dead ends: 3922 [2024-10-11 04:51:08,667 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:51:08,667 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:51:08,668 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:51:08,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3922 states. [2024-10-11 04:51:08,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3922 to 3920. [2024-10-11 04:51:08,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3920 states, 3918 states have (on average 1.4553343542623787) internal successors, (5702), 3919 states have internal predecessors, (5702), 0 states have call successors, (0), 0 states have 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:08,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 5702 transitions. [2024-10-11 04:51:08,769 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 5702 transitions. Word has length 78 [2024-10-11 04:51:08,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:51:08,769 INFO L471 AbstractCegarLoop]: Abstraction has 3920 states and 5702 transitions. [2024-10-11 04:51:08,769 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:51:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 5702 transitions. [2024-10-11 04:51:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 04:51:08,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:51:08,771 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:51:08,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 04:51:08,771 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:51:08,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:51:08,771 INFO L85 PathProgramCache]: Analyzing trace with hash 439495192, now seen corresponding path program 1 times [2024-10-11 04:51:08,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:51:08,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225352201] [2024-10-11 04:51:08,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:08,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:51:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:08,847 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:51:08,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:51:08,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225352201] [2024-10-11 04:51:08,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225352201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:51:08,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:51:08,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:51:08,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014250901] [2024-10-11 04:51:08,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:51:08,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:51:08,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:51:08,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:51:08,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:51:08,850 INFO L87 Difference]: Start difference. First operand 3920 states and 5702 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:51:08,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:51:08,905 INFO L93 Difference]: Finished difference Result 4730 states and 6822 transitions. [2024-10-11 04:51:08,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:51:08,906 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:51:08,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:51:08,910 INFO L225 Difference]: With dead ends: 4730 [2024-10-11 04:51:08,910 INFO L226 Difference]: Without dead ends: 3116 [2024-10-11 04:51:08,912 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:51:08,912 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:51:08,912 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:51:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states. [2024-10-11 04:51:08,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 3114. [2024-10-11 04:51:08,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3114 states, 3112 states have (on average 1.4688303341902313) internal successors, (4571), 3113 states have internal predecessors, (4571), 0 states have call successors, (0), 0 states have 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:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 4571 transitions. [2024-10-11 04:51:08,970 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 4571 transitions. Word has length 80 [2024-10-11 04:51:08,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:51:08,970 INFO L471 AbstractCegarLoop]: Abstraction has 3114 states and 4571 transitions. [2024-10-11 04:51:08,970 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:51:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 4571 transitions. [2024-10-11 04:51:08,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 04:51:08,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:51:08,971 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:51:08,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 04:51:08,972 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:51:08,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:51:08,972 INFO L85 PathProgramCache]: Analyzing trace with hash 397937126, now seen corresponding path program 1 times [2024-10-11 04:51:08,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:51:08,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948901444] [2024-10-11 04:51:08,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:08,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:51:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:09,318 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:51:09,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:51:09,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948901444] [2024-10-11 04:51:09,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948901444] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:51:09,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446836192] [2024-10-11 04:51:09,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:09,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:51:09,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:51:09,321 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:51:09,322 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:51:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:09,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 04:51:09,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:51:09,712 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:51:09,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:51:09,881 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:51:09,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446836192] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:51:09,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:51:09,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 4] total 15 [2024-10-11 04:51:09,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724982865] [2024-10-11 04:51:09,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:51:09,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 04:51:09,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:51:09,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 04:51:09,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-10-11 04:51:09,886 INFO L87 Difference]: Start difference. First operand 3114 states and 4571 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:51:11,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:51:11,343 INFO L93 Difference]: Finished difference Result 8229 states and 11427 transitions. [2024-10-11 04:51:11,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-11 04:51:11,343 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:51:11,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:51:11,353 INFO L225 Difference]: With dead ends: 8229 [2024-10-11 04:51:11,353 INFO L226 Difference]: Without dead ends: 7421 [2024-10-11 04:51:11,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=462, Invalid=1608, Unknown=0, NotChecked=0, Total=2070 [2024-10-11 04:51:11,357 INFO L432 NwaCegarLoop]: 1514 mSDtfsCounter, 10030 mSDsluCounter, 6329 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10030 SdHoareTripleChecker+Valid, 7843 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:51:11,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10030 Valid, 7843 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 04:51:11,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7421 states. [2024-10-11 04:51:11,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7421 to 7273. [2024-10-11 04:51:11,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7273 states, 7271 states have (on average 1.3628111676523174) internal successors, (9909), 7272 states have internal predecessors, (9909), 0 states have call successors, (0), 0 states have 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:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7273 states to 7273 states and 9909 transitions. [2024-10-11 04:51:11,557 INFO L78 Accepts]: Start accepts. Automaton has 7273 states and 9909 transitions. Word has length 82 [2024-10-11 04:51:11,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:51:11,557 INFO L471 AbstractCegarLoop]: Abstraction has 7273 states and 9909 transitions. [2024-10-11 04:51:11,557 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:51:11,558 INFO L276 IsEmpty]: Start isEmpty. Operand 7273 states and 9909 transitions. [2024-10-11 04:51:11,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 04:51:11,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:51:11,559 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:11,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 04:51:11,762 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:51:11,763 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:51:11,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:51:11,764 INFO L85 PathProgramCache]: Analyzing trace with hash 577648048, now seen corresponding path program 1 times [2024-10-11 04:51:11,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:51:11,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837776726] [2024-10-11 04:51:11,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:11,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:51:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:12,073 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:12,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:51:12,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837776726] [2024-10-11 04:51:12,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837776726] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:51:12,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922737460] [2024-10-11 04:51:12,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:12,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:51:12,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:51:12,076 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:51:12,080 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:51:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:12,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 04:51:12,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:51:12,712 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:12,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:51:13,640 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:13,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922737460] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:51:13,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:51:13,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 30 [2024-10-11 04:51:13,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115922241] [2024-10-11 04:51:13,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:51:13,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 04:51:13,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:51:13,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 04:51:13,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2024-10-11 04:51:13,642 INFO L87 Difference]: Start difference. First operand 7273 states and 9909 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:14,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:51:14,478 INFO L93 Difference]: Finished difference Result 17253 states and 22946 transitions. [2024-10-11 04:51:14,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 04:51:14,478 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:14,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:51:14,491 INFO L225 Difference]: With dead ends: 17253 [2024-10-11 04:51:14,492 INFO L226 Difference]: Without dead ends: 12504 [2024-10-11 04:51:14,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=468, Invalid=1512, Unknown=0, NotChecked=0, Total=1980 [2024-10-11 04:51:14,499 INFO L432 NwaCegarLoop]: 1508 mSDtfsCounter, 12364 mSDsluCounter, 9222 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12364 SdHoareTripleChecker+Valid, 10730 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:51:14,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12364 Valid, 10730 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 04:51:14,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12504 states. [2024-10-11 04:51:14,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12504 to 12352. [2024-10-11 04:51:14,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12352 states, 12350 states have (on average 1.3224291497975709) internal successors, (16332), 12351 states have internal predecessors, (16332), 0 states have call successors, (0), 0 states have 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,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12352 states to 12352 states and 16332 transitions. [2024-10-11 04:51:14,785 INFO L78 Accepts]: Start accepts. Automaton has 12352 states and 16332 transitions. Word has length 83 [2024-10-11 04:51:14,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:51:14,786 INFO L471 AbstractCegarLoop]: Abstraction has 12352 states and 16332 transitions. [2024-10-11 04:51:14,786 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:14,786 INFO L276 IsEmpty]: Start isEmpty. Operand 12352 states and 16332 transitions. [2024-10-11 04:51:14,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 04:51:14,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:51:14,787 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:14,801 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:14,988 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:14,988 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:51:14,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:51:14,989 INFO L85 PathProgramCache]: Analyzing trace with hash -900611408, now seen corresponding path program 1 times [2024-10-11 04:51:14,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:51:14,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222203] [2024-10-11 04:51:14,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:14,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:51:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:15,746 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:15,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:51:15,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222203] [2024-10-11 04:51:15,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222203] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:51:15,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347036302] [2024-10-11 04:51:15,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:15,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:51:15,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:51:15,749 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:15,750 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:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:15,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:51:15,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:51:16,258 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:16,258 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:51:17,014 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:17,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347036302] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:51:17,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:51:17,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2024-10-11 04:51:17,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217872793] [2024-10-11 04:51:17,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:51:17,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 04:51:17,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:51:17,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 04:51:17,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2024-10-11 04:51:17,016 INFO L87 Difference]: Start difference. First operand 12352 states and 16332 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:19,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:51:19,366 INFO L93 Difference]: Finished difference Result 46359 states and 60831 transitions. [2024-10-11 04:51:19,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-11 04:51:19,367 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:19,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:51:19,410 INFO L225 Difference]: With dead ends: 46359 [2024-10-11 04:51:19,410 INFO L226 Difference]: Without dead ends: 36706 [2024-10-11 04:51:19,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=826, Invalid=2956, Unknown=0, NotChecked=0, Total=3782 [2024-10-11 04:51:19,429 INFO L432 NwaCegarLoop]: 1506 mSDtfsCounter, 19440 mSDsluCounter, 7945 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19440 SdHoareTripleChecker+Valid, 9451 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:51:19,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19440 Valid, 9451 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 04:51:19,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36706 states. [2024-10-11 04:51:20,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36706 to 36406. [2024-10-11 04:51:20,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36406 states, 36404 states have (on average 1.2861773431491046) internal successors, (46822), 36405 states have internal predecessors, (46822), 0 states have call successors, (0), 0 states have 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:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36406 states to 36406 states and 46822 transitions. [2024-10-11 04:51:20,367 INFO L78 Accepts]: Start accepts. Automaton has 36406 states and 46822 transitions. Word has length 83 [2024-10-11 04:51:20,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:51:20,367 INFO L471 AbstractCegarLoop]: Abstraction has 36406 states and 46822 transitions. [2024-10-11 04:51:20,368 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:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 36406 states and 46822 transitions. [2024-10-11 04:51:20,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 04:51:20,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:51:20,373 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:20,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 04:51:20,574 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:20,574 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:51:20,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:51:20,575 INFO L85 PathProgramCache]: Analyzing trace with hash -235971648, now seen corresponding path program 1 times [2024-10-11 04:51:20,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:51:20,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043947131] [2024-10-11 04:51:20,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:20,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:51:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:20,899 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:20,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:51:20,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043947131] [2024-10-11 04:51:20,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043947131] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:51:20,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830978321] [2024-10-11 04:51:20,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:20,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:51:20,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:51:20,901 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:20,902 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:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:21,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 04:51:21,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:51:21,504 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:21,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:51:22,670 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:22,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830978321] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:51:22,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:51:22,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2024-10-11 04:51:22,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326597051] [2024-10-11 04:51:22,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:51:22,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 04:51:22,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:51:22,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 04:51:22,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2024-10-11 04:51:22,673 INFO L87 Difference]: Start difference. First operand 36406 states and 46822 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:24,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:51:24,555 INFO L93 Difference]: Finished difference Result 94382 states and 120617 transitions. [2024-10-11 04:51:24,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 04:51:24,556 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:24,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:51:24,635 INFO L225 Difference]: With dead ends: 94382 [2024-10-11 04:51:24,636 INFO L226 Difference]: Without dead ends: 65238 [2024-10-11 04:51:24,651 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:24,652 INFO L432 NwaCegarLoop]: 1514 mSDtfsCounter, 6451 mSDsluCounter, 6431 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6451 SdHoareTripleChecker+Valid, 7945 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:51:24,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6451 Valid, 7945 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 04:51:24,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65238 states. [2024-10-11 04:51:26,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65238 to 55394. [2024-10-11 04:51:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55394 states, 55392 states have (on average 1.2737759965337956) internal successors, (70557), 55393 states have internal predecessors, (70557), 0 states have call successors, (0), 0 states have 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:26,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55394 states to 55394 states and 70557 transitions. [2024-10-11 04:51:26,649 INFO L78 Accepts]: Start accepts. Automaton has 55394 states and 70557 transitions. Word has length 85 [2024-10-11 04:51:26,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:51:26,649 INFO L471 AbstractCegarLoop]: Abstraction has 55394 states and 70557 transitions. [2024-10-11 04:51:26,649 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:26,650 INFO L276 IsEmpty]: Start isEmpty. Operand 55394 states and 70557 transitions. [2024-10-11 04:51:26,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 04:51:26,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:51:26,652 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:26,667 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:26,852 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:26,853 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:51:26,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:51:26,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1124486412, now seen corresponding path program 1 times [2024-10-11 04:51:26,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:51:26,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179512160] [2024-10-11 04:51:26,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:26,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:51:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:27,403 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:27,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:51:27,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179512160] [2024-10-11 04:51:27,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179512160] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:51:27,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488635867] [2024-10-11 04:51:27,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:27,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:51:27,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:51:27,405 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:27,406 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:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:27,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:51:27,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:51:27,994 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:27,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:51:28,497 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:28,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488635867] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:51:28,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:51:28,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-10-11 04:51:28,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811470488] [2024-10-11 04:51:28,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:51:28,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 04:51:28,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:51:28,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 04:51:28,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-10-11 04:51:28,500 INFO L87 Difference]: Start difference. First operand 55394 states and 70557 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:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:51:31,495 INFO L93 Difference]: Finished difference Result 155599 states and 197871 transitions. [2024-10-11 04:51:31,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 04:51:31,496 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:31,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:51:31,661 INFO L225 Difference]: With dead ends: 155599 [2024-10-11 04:51:31,662 INFO L226 Difference]: Without dead ends: 106931 [2024-10-11 04:51:31,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=747, Unknown=0, NotChecked=0, Total=992 [2024-10-11 04:51:31,689 INFO L432 NwaCegarLoop]: 1529 mSDtfsCounter, 13795 mSDsluCounter, 6272 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13795 SdHoareTripleChecker+Valid, 7801 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:51:31,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13795 Valid, 7801 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:51:31,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106931 states. [2024-10-11 04:51:35,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106931 to 105643. [2024-10-11 04:51:35,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105643 states, 105641 states have (on average 1.2526481195747863) internal successors, (132331), 105642 states have internal predecessors, (132331), 0 states have call successors, (0), 0 states have 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:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105643 states to 105643 states and 132331 transitions. [2024-10-11 04:51:35,836 INFO L78 Accepts]: Start accepts. Automaton has 105643 states and 132331 transitions. Word has length 85 [2024-10-11 04:51:35,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:51:35,836 INFO L471 AbstractCegarLoop]: Abstraction has 105643 states and 132331 transitions. [2024-10-11 04:51:35,836 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:35,837 INFO L276 IsEmpty]: Start isEmpty. Operand 105643 states and 132331 transitions. [2024-10-11 04:51:35,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 04:51:35,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:51:35,845 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:35,863 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:36,046 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:36,046 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:51:36,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:51:36,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1688504568, now seen corresponding path program 1 times [2024-10-11 04:51:36,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:51:36,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760242266] [2024-10-11 04:51:36,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:36,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:51:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:36,956 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:36,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:51:36,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760242266] [2024-10-11 04:51:36,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760242266] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:51:36,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604576772] [2024-10-11 04:51:36,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:36,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:51:36,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:51:36,959 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:36,960 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:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:37,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-10-11 04:51:37,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:51:42,048 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:42,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:51:48,336 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:48,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604576772] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:51:48,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:51:48,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 29, 31] total 66 [2024-10-11 04:51:48,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297971178] [2024-10-11 04:51:48,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:51:48,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-10-11 04:51:48,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:51:48,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-10-11 04:51:48,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=3754, Unknown=0, NotChecked=0, Total=4290 [2024-10-11 04:51:48,339 INFO L87 Difference]: Start difference. First operand 105643 states and 132331 transitions. Second operand has 66 states, 66 states have (on average 3.621212121212121) internal successors, (239), 66 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)