./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.ufo.UNBOUNDED.pals+Problem12_label08.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.ufo.UNBOUNDED.pals+Problem12_label08.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 2c4913bb4ed3bafd270c91bb47247b29a03ea021b2ff38c2735de1cba1400212 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:49:59,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:50:00,077 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:00,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:50:00,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:50:00,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:50:00,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:50:00,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:50:00,116 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:50:00,117 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:50:00,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:50:00,118 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:50:00,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:50:00,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:50:00,120 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:50:00,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:50:00,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:50:00,121 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:50:00,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:50:00,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:50:00,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:50:00,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:50:00,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:50:00,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:50:00,127 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:50:00,127 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:50:00,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:50:00,127 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:50:00,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:50:00,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:50:00,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:50:00,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:50:00,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:50:00,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:50:00,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:50:00,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:50:00,131 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:50:00,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:50:00,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:50:00,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:50:00,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:50:00,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:50:00,132 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 -> 2c4913bb4ed3bafd270c91bb47247b29a03ea021b2ff38c2735de1cba1400212 [2024-10-11 04:50:00,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:50:00,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:50:00,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:50:00,443 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:50:00,443 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:50:00,444 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label08.c [2024-10-11 04:50:01,904 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:50:02,341 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:50:02,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label08.c [2024-10-11 04:50:02,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e2d084249/a372b3643f314537b9351c0f7deb854e/FLAGb2ae36751 [2024-10-11 04:50:02,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e2d084249/a372b3643f314537b9351c0f7deb854e [2024-10-11 04:50:02,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:50:02,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:50:02,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:50:02,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:50:02,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:50:02,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:50:02" (1/1) ... [2024-10-11 04:50:02,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a291339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:02, skipping insertion in model container [2024-10-11 04:50:02,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:50:02" (1/1) ... [2024-10-11 04:50:02,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:50:03,098 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.ufo.UNBOUNDED.pals+Problem12_label08.c[11668,11681] [2024-10-11 04:50:03,134 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.ufo.UNBOUNDED.pals+Problem12_label08.c[15175,15188] [2024-10-11 04:50:03,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:50:03,772 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:50:03,813 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.ufo.UNBOUNDED.pals+Problem12_label08.c[11668,11681] [2024-10-11 04:50:03,820 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.ufo.UNBOUNDED.pals+Problem12_label08.c[15175,15188] [2024-10-11 04:50:04,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:50:04,288 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:50:04,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:04 WrapperNode [2024-10-11 04:50:04,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:50:04,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:50:04,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:50:04,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:50:04,297 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:04" (1/1) ... [2024-10-11 04:50:04,345 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:04" (1/1) ... [2024-10-11 04:50:04,668 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5097 [2024-10-11 04:50:04,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:50:04,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:50:04,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:50:04,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:50:04,681 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:04" (1/1) ... [2024-10-11 04:50:04,681 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:04" (1/1) ... [2024-10-11 04:50:04,739 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:04" (1/1) ... [2024-10-11 04:50:04,968 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:04,969 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:04" (1/1) ... [2024-10-11 04:50:04,969 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:04" (1/1) ... [2024-10-11 04:50:05,141 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:04" (1/1) ... [2024-10-11 04:50:05,178 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:04" (1/1) ... [2024-10-11 04:50:05,201 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:04" (1/1) ... [2024-10-11 04:50:05,222 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:04" (1/1) ... [2024-10-11 04:50:05,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:50:05,287 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:50:05,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:50:05,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:50:05,289 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:04" (1/1) ... [2024-10-11 04:50:05,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:50:05,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:50:05,322 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:05,329 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:05,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:50:05,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:50:05,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:50:05,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:50:05,465 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:50:05,467 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:50:09,775 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2024-10-11 04:50:09,775 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:50:09,834 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:50:09,835 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:50:09,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:50:09 BoogieIcfgContainer [2024-10-11 04:50:09,835 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:50:09,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:50:09,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:50:09,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:50:09,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:50:02" (1/3) ... [2024-10-11 04:50:09,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c563b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:50:09, skipping insertion in model container [2024-10-11 04:50:09,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:04" (2/3) ... [2024-10-11 04:50:09,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c563b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:50:09, skipping insertion in model container [2024-10-11 04:50:09,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:50:09" (3/3) ... [2024-10-11 04:50:09,844 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label08.c [2024-10-11 04:50:09,861 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:50:09,862 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:50:09,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:50:09,967 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;@6ff2ed5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:50:09,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:50:09,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 836 states, 833 states have (on average 1.9747899159663866) internal successors, (1645), 835 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call 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:09,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 04:50:09,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:09,986 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:09,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:09,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:09,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1602770487, now seen corresponding path program 1 times [2024-10-11 04:50:10,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:10,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521529722] [2024-10-11 04:50:10,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:10,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:10,245 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:10,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:10,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521529722] [2024-10-11 04:50:10,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521529722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:10,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:10,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:50:10,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536151192] [2024-10-11 04:50:10,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:10,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 04:50:10,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:10,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 04:50:10,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:50:10,290 INFO L87 Difference]: Start difference. First operand has 836 states, 833 states have (on average 1.9747899159663866) internal successors, (1645), 835 states have internal predecessors, (1645), 0 states have call successors, (0), 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:10,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:10,393 INFO L93 Difference]: Finished difference Result 1636 states and 3221 transitions. [2024-10-11 04:50:10,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 04:50:10,401 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:10,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:10,424 INFO L225 Difference]: With dead ends: 1636 [2024-10-11 04:50:10,425 INFO L226 Difference]: Without dead ends: 832 [2024-10-11 04:50:10,434 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:10,439 INFO L432 NwaCegarLoop]: 1573 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, 1573 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:10,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1573 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:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-10-11 04:50:10,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 832. [2024-10-11 04:50:10,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 830 states have (on average 1.8963855421686746) internal successors, (1574), 831 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call 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:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1574 transitions. [2024-10-11 04:50:10,527 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1574 transitions. Word has length 21 [2024-10-11 04:50:10,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:10,528 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1574 transitions. [2024-10-11 04:50:10,528 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:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1574 transitions. [2024-10-11 04:50:10,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 04:50:10,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:10,531 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:10,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:50:10,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:10,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:10,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1103848907, now seen corresponding path program 1 times [2024-10-11 04:50:10,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:10,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586228076] [2024-10-11 04:50:10,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:10,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:10,726 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:10,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:10,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586228076] [2024-10-11 04:50:10,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586228076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:10,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:10,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:50:10,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311576879] [2024-10-11 04:50:10,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:10,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:50:10,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:10,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:50:10,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:50:10,730 INFO L87 Difference]: Start difference. First operand 832 states and 1574 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:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:10,829 INFO L93 Difference]: Finished difference Result 878 states and 1646 transitions. [2024-10-11 04:50:10,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:50:10,830 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:10,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:10,834 INFO L225 Difference]: With dead ends: 878 [2024-10-11 04:50:10,835 INFO L226 Difference]: Without dead ends: 832 [2024-10-11 04:50:10,836 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:10,837 INFO L432 NwaCegarLoop]: 1571 mSDtfsCounter, 0 mSDsluCounter, 3107 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4678 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:10,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4678 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:10,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-10-11 04:50:10,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 832. [2024-10-11 04:50:10,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 830 states have (on average 1.8590361445783132) internal successors, (1543), 831 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call 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:10,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1543 transitions. [2024-10-11 04:50:10,863 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1543 transitions. Word has length 21 [2024-10-11 04:50:10,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:10,863 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1543 transitions. [2024-10-11 04:50:10,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:10,864 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1543 transitions. [2024-10-11 04:50:10,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 04:50:10,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:10,865 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] [2024-10-11 04:50:10,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:50:10,866 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:10,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:10,870 INFO L85 PathProgramCache]: Analyzing trace with hash -196137149, now seen corresponding path program 1 times [2024-10-11 04:50:10,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:10,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215871765] [2024-10-11 04:50:10,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:10,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:10,978 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:10,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:10,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215871765] [2024-10-11 04:50:10,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215871765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:10,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:10,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:50:10,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697636374] [2024-10-11 04:50:10,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:10,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:10,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:10,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:10,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:10,985 INFO L87 Difference]: Start difference. First operand 832 states and 1543 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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:13,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:13,995 INFO L93 Difference]: Finished difference Result 2336 states and 4416 transitions. [2024-10-11 04:50:13,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:13,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-10-11 04:50:13,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:14,005 INFO L225 Difference]: With dead ends: 2336 [2024-10-11 04:50:14,007 INFO L226 Difference]: Without dead ends: 1583 [2024-10-11 04:50:14,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:14,013 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 893 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:14,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 529 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 04:50:14,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2024-10-11 04:50:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1583. [2024-10-11 04:50:14,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1581 states have (on average 1.6255534471853257) internal successors, (2570), 1582 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states have call 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:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2570 transitions. [2024-10-11 04:50:14,056 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2570 transitions. Word has length 29 [2024-10-11 04:50:14,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:14,056 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2570 transitions. [2024-10-11 04:50:14,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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:14,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2570 transitions. [2024-10-11 04:50:14,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 04:50:14,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:14,059 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:14,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:50:14,059 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:14,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:14,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2084924126, now seen corresponding path program 1 times [2024-10-11 04:50:14,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:14,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769254061] [2024-10-11 04:50:14,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:14,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:14,265 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:14,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:14,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769254061] [2024-10-11 04:50:14,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769254061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:14,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:14,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:14,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721850128] [2024-10-11 04:50:14,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:14,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:14,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:14,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:14,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:14,268 INFO L87 Difference]: Start difference. First operand 1583 states and 2570 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:14,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:14,532 INFO L93 Difference]: Finished difference Result 2013 states and 3260 transitions. [2024-10-11 04:50:14,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 04:50:14,533 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:14,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:14,541 INFO L225 Difference]: With dead ends: 2013 [2024-10-11 04:50:14,541 INFO L226 Difference]: Without dead ends: 1970 [2024-10-11 04:50:14,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-11 04:50:14,543 INFO L432 NwaCegarLoop]: 1534 mSDtfsCounter, 7959 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7959 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:14,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7959 Valid, 2654 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:14,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2024-10-11 04:50:14,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1624. [2024-10-11 04:50:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1622 states have (on average 1.625154130702836) internal successors, (2636), 1623 states have internal predecessors, (2636), 0 states have call successors, (0), 0 states have call 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:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2636 transitions. [2024-10-11 04:50:14,581 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2636 transitions. Word has length 51 [2024-10-11 04:50:14,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:14,581 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2636 transitions. [2024-10-11 04:50:14,582 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:14,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2636 transitions. [2024-10-11 04:50:14,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 04:50:14,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:14,586 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:14,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:50:14,586 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:14,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:14,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1991892562, now seen corresponding path program 1 times [2024-10-11 04:50:14,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:14,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063647171] [2024-10-11 04:50:14,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:14,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:14,686 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:14,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:14,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063647171] [2024-10-11 04:50:14,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063647171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:14,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:14,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:14,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716609642] [2024-10-11 04:50:14,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:14,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:14,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:14,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:14,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:14,691 INFO L87 Difference]: Start difference. First operand 1624 states and 2636 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:14,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:14,738 INFO L93 Difference]: Finished difference Result 1781 states and 2887 transitions. [2024-10-11 04:50:14,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:14,739 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:14,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:14,747 INFO L225 Difference]: With dead ends: 1781 [2024-10-11 04:50:14,748 INFO L226 Difference]: Without dead ends: 1697 [2024-10-11 04:50:14,748 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:14,749 INFO L432 NwaCegarLoop]: 1536 mSDtfsCounter, 1482 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:14,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1597 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:14,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2024-10-11 04:50:14,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1693. [2024-10-11 04:50:14,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1691 states have (on average 1.6227084565345948) internal successors, (2744), 1692 states have internal predecessors, (2744), 0 states have call successors, (0), 0 states have call 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:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2744 transitions. [2024-10-11 04:50:14,786 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2744 transitions. Word has length 53 [2024-10-11 04:50:14,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:14,788 INFO L471 AbstractCegarLoop]: Abstraction has 1693 states and 2744 transitions. [2024-10-11 04:50:14,788 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:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2744 transitions. [2024-10-11 04:50:14,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 04:50:14,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:14,793 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:14,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:50:14,793 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:14,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:14,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1994037514, now seen corresponding path program 1 times [2024-10-11 04:50:14,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:14,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414097284] [2024-10-11 04:50:14,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:14,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:15,098 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:15,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:15,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414097284] [2024-10-11 04:50:15,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414097284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:15,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:15,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:15,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255302365] [2024-10-11 04:50:15,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:15,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:15,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:15,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:15,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:15,102 INFO L87 Difference]: Start difference. First operand 1693 states and 2744 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:15,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:15,285 INFO L93 Difference]: Finished difference Result 1848 states and 2988 transitions. [2024-10-11 04:50:15,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:50:15,286 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:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:15,293 INFO L225 Difference]: With dead ends: 1848 [2024-10-11 04:50:15,293 INFO L226 Difference]: Without dead ends: 1695 [2024-10-11 04:50:15,294 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:15,295 INFO L432 NwaCegarLoop]: 1533 mSDtfsCounter, 4482 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4482 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:15,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4482 Valid, 1796 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:15,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2024-10-11 04:50:15,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1693. [2024-10-11 04:50:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1691 states have (on average 1.621525724423418) internal successors, (2742), 1692 states have internal predecessors, (2742), 0 states have call successors, (0), 0 states have call 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:15,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2742 transitions. [2024-10-11 04:50:15,339 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2742 transitions. Word has length 53 [2024-10-11 04:50:15,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:15,341 INFO L471 AbstractCegarLoop]: Abstraction has 1693 states and 2742 transitions. [2024-10-11 04:50:15,341 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:15,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2742 transitions. [2024-10-11 04:50:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 04:50:15,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:15,343 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:15,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:50:15,343 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:15,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:15,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1556545358, now seen corresponding path program 1 times [2024-10-11 04:50:15,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:15,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755876945] [2024-10-11 04:50:15,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:15,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:15,509 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:15,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:15,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755876945] [2024-10-11 04:50:15,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755876945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:15,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:15,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:50:15,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718074767] [2024-10-11 04:50:15,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:15,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:50:15,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:15,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:50:15,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:50:15,512 INFO L87 Difference]: Start difference. First operand 1693 states and 2742 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:15,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:15,564 INFO L93 Difference]: Finished difference Result 1699 states and 2749 transitions. [2024-10-11 04:50:15,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:50:15,564 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:15,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:15,571 INFO L225 Difference]: With dead ends: 1699 [2024-10-11 04:50:15,572 INFO L226 Difference]: Without dead ends: 1697 [2024-10-11 04:50:15,572 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:15,573 INFO L432 NwaCegarLoop]: 1539 mSDtfsCounter, 0 mSDsluCounter, 3070 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4609 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:15,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4609 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:15,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2024-10-11 04:50:15,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1697. [2024-10-11 04:50:15,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1695 states have (on average 1.6194690265486726) internal successors, (2745), 1696 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call 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:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 2745 transitions. [2024-10-11 04:50:15,611 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 2745 transitions. Word has length 54 [2024-10-11 04:50:15,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:15,612 INFO L471 AbstractCegarLoop]: Abstraction has 1697 states and 2745 transitions. [2024-10-11 04:50:15,612 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:15,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2745 transitions. [2024-10-11 04:50:15,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:50:15,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:15,613 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:15,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:50:15,614 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:15,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:15,614 INFO L85 PathProgramCache]: Analyzing trace with hash -333799254, now seen corresponding path program 1 times [2024-10-11 04:50:15,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:15,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29861974] [2024-10-11 04:50:15,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:15,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:15,681 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:15,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:15,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29861974] [2024-10-11 04:50:15,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29861974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:15,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:15,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:15,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888662783] [2024-10-11 04:50:15,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:15,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:15,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:15,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:15,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:15,684 INFO L87 Difference]: Start difference. First operand 1697 states and 2745 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:15,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:15,724 INFO L93 Difference]: Finished difference Result 1995 states and 3205 transitions. [2024-10-11 04:50:15,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:15,724 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:15,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:15,732 INFO L225 Difference]: With dead ends: 1995 [2024-10-11 04:50:15,732 INFO L226 Difference]: Without dead ends: 1838 [2024-10-11 04:50:15,733 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:15,734 INFO L432 NwaCegarLoop]: 1585 mSDtfsCounter, 1495 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1658 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:15,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 1658 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:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2024-10-11 04:50:15,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1836. [2024-10-11 04:50:15,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1836 states, 1834 states have (on average 1.6117775354416575) internal successors, (2956), 1835 states have internal predecessors, (2956), 0 states have call successors, (0), 0 states have call 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:15,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 2956 transitions. [2024-10-11 04:50:15,782 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 2956 transitions. Word has length 55 [2024-10-11 04:50:15,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:15,783 INFO L471 AbstractCegarLoop]: Abstraction has 1836 states and 2956 transitions. [2024-10-11 04:50:15,784 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:15,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2956 transitions. [2024-10-11 04:50:15,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:50:15,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:15,785 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:15,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:50:15,786 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:15,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:15,787 INFO L85 PathProgramCache]: Analyzing trace with hash -293855318, now seen corresponding path program 1 times [2024-10-11 04:50:15,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:15,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323153154] [2024-10-11 04:50:15,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:15,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:15,848 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:15,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:15,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323153154] [2024-10-11 04:50:15,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323153154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:15,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:15,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:15,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826818669] [2024-10-11 04:50:15,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:15,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:15,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:15,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:15,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:15,851 INFO L87 Difference]: Start difference. First operand 1836 states and 2956 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:15,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:15,904 INFO L93 Difference]: Finished difference Result 2396 states and 3810 transitions. [2024-10-11 04:50:15,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:15,905 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:15,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:15,913 INFO L225 Difference]: With dead ends: 2396 [2024-10-11 04:50:15,914 INFO L226 Difference]: Without dead ends: 2100 [2024-10-11 04:50:15,918 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:15,918 INFO L432 NwaCegarLoop]: 1583 mSDtfsCounter, 1493 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1660 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:15,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 1660 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:15,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2024-10-11 04:50:15,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2098. [2024-10-11 04:50:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2096 states have (on average 1.5963740458015268) internal successors, (3346), 2097 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call 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:15,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 3346 transitions. [2024-10-11 04:50:15,974 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 3346 transitions. Word has length 55 [2024-10-11 04:50:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:15,974 INFO L471 AbstractCegarLoop]: Abstraction has 2098 states and 3346 transitions. [2024-10-11 04:50:15,975 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:15,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 3346 transitions. [2024-10-11 04:50:15,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:50:15,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:15,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:15,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:50:15,976 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:15,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:15,980 INFO L85 PathProgramCache]: Analyzing trace with hash -919511382, now seen corresponding path program 1 times [2024-10-11 04:50:15,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:15,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243924220] [2024-10-11 04:50:15,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:15,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:16,033 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:16,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:16,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243924220] [2024-10-11 04:50:16,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243924220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:16,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:16,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:16,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620955617] [2024-10-11 04:50:16,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:16,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:16,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:16,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:16,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:16,035 INFO L87 Difference]: Start difference. First operand 2098 states and 3346 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:16,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:16,106 INFO L93 Difference]: Finished difference Result 3150 states and 4924 transitions. [2024-10-11 04:50:16,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:16,107 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:16,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:16,116 INFO L225 Difference]: With dead ends: 3150 [2024-10-11 04:50:16,116 INFO L226 Difference]: Without dead ends: 2592 [2024-10-11 04:50:16,118 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:16,118 INFO L432 NwaCegarLoop]: 1581 mSDtfsCounter, 1491 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 1662 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:16,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 1662 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:16,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2024-10-11 04:50:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2590. [2024-10-11 04:50:16,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 2588 states have (on average 1.5695517774343122) internal successors, (4062), 2589 states have internal predecessors, (4062), 0 states have call successors, (0), 0 states have call 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:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 4062 transitions. [2024-10-11 04:50:16,184 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 4062 transitions. Word has length 55 [2024-10-11 04:50:16,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:16,184 INFO L471 AbstractCegarLoop]: Abstraction has 2590 states and 4062 transitions. [2024-10-11 04:50:16,220 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:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 4062 transitions. [2024-10-11 04:50:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:50:16,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:16,222 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:16,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:50:16,222 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:16,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:16,223 INFO L85 PathProgramCache]: Analyzing trace with hash -30777942, now seen corresponding path program 1 times [2024-10-11 04:50:16,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:16,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315522668] [2024-10-11 04:50:16,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:16,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:16,282 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:16,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:16,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315522668] [2024-10-11 04:50:16,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315522668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:16,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:16,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:16,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510405574] [2024-10-11 04:50:16,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:16,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:16,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:16,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:16,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:16,285 INFO L87 Difference]: Start difference. First operand 2590 states and 4062 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:16,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:16,372 INFO L93 Difference]: Finished difference Result 4562 states and 6960 transitions. [2024-10-11 04:50:16,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:16,373 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:16,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:16,385 INFO L225 Difference]: With dead ends: 4562 [2024-10-11 04:50:16,385 INFO L226 Difference]: Without dead ends: 3512 [2024-10-11 04:50:16,388 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:16,389 INFO L432 NwaCegarLoop]: 1579 mSDtfsCounter, 1489 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 1664 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:16,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1489 Valid, 1664 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:16,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3512 states. [2024-10-11 04:50:16,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3512 to 3510. [2024-10-11 04:50:16,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3510 states, 3508 states have (on average 1.5296465222348916) internal successors, (5366), 3509 states have internal predecessors, (5366), 0 states have call successors, (0), 0 states have call 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:16,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3510 states to 3510 states and 5366 transitions. [2024-10-11 04:50:16,506 INFO L78 Accepts]: Start accepts. Automaton has 3510 states and 5366 transitions. Word has length 55 [2024-10-11 04:50:16,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:16,507 INFO L471 AbstractCegarLoop]: Abstraction has 3510 states and 5366 transitions. [2024-10-11 04:50:16,507 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:16,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3510 states and 5366 transitions. [2024-10-11 04:50:16,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 04:50:16,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:16,508 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] [2024-10-11 04:50:16,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:50:16,508 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:16,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:16,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1407843185, now seen corresponding path program 1 times [2024-10-11 04:50:16,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:16,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703400170] [2024-10-11 04:50:16,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:16,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:16,567 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:16,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:16,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703400170] [2024-10-11 04:50:16,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703400170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:16,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:16,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:16,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033578701] [2024-10-11 04:50:16,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:16,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:16,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:16,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:16,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:16,570 INFO L87 Difference]: Start difference. First operand 3510 states and 5366 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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:16,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:16,675 INFO L93 Difference]: Finished difference Result 5565 states and 8412 transitions. [2024-10-11 04:50:16,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:16,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-10-11 04:50:16,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:16,700 INFO L225 Difference]: With dead ends: 5565 [2024-10-11 04:50:16,701 INFO L226 Difference]: Without dead ends: 4442 [2024-10-11 04:50:16,704 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:16,705 INFO L432 NwaCegarLoop]: 1590 mSDtfsCounter, 1494 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 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:16,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1494 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:16,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4442 states. [2024-10-11 04:50:16,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4442 to 4440. [2024-10-11 04:50:16,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4440 states, 4438 states have (on average 1.5087877422262281) internal successors, (6696), 4439 states have internal predecessors, (6696), 0 states have call successors, (0), 0 states have call 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:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 6696 transitions. [2024-10-11 04:50:16,842 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 6696 transitions. Word has length 57 [2024-10-11 04:50:16,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:16,843 INFO L471 AbstractCegarLoop]: Abstraction has 4440 states and 6696 transitions. [2024-10-11 04:50:16,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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:16,844 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 6696 transitions. [2024-10-11 04:50:16,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 04:50:16,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:16,845 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:16,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:50:16,846 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:16,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:16,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1643923532, now seen corresponding path program 1 times [2024-10-11 04:50:16,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:16,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791778998] [2024-10-11 04:50:16,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:16,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 04:50:17,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:17,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791778998] [2024-10-11 04:50:17,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791778998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:17,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:17,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:17,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507589266] [2024-10-11 04:50:17,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:17,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:17,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:17,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:17,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:17,017 INFO L87 Difference]: Start difference. First operand 4440 states and 6696 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:17,508 INFO L93 Difference]: Finished difference Result 19540 states and 28510 transitions. [2024-10-11 04:50:17,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:50:17,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-11 04:50:17,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:17,555 INFO L225 Difference]: With dead ends: 19540 [2024-10-11 04:50:17,555 INFO L226 Difference]: Without dead ends: 16642 [2024-10-11 04:50:17,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:50:17,565 INFO L432 NwaCegarLoop]: 1605 mSDtfsCounter, 6318 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6318 SdHoareTripleChecker+Valid, 3609 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:17,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6318 Valid, 3609 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:17,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16642 states. [2024-10-11 04:50:17,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16642 to 7336. [2024-10-11 04:50:17,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7336 states, 7334 states have (on average 1.478047450231797) internal successors, (10840), 7335 states have internal predecessors, (10840), 0 states have call successors, (0), 0 states have call 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:17,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7336 states to 7336 states and 10840 transitions. [2024-10-11 04:50:17,849 INFO L78 Accepts]: Start accepts. Automaton has 7336 states and 10840 transitions. Word has length 73 [2024-10-11 04:50:17,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:17,850 INFO L471 AbstractCegarLoop]: Abstraction has 7336 states and 10840 transitions. [2024-10-11 04:50:17,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:17,850 INFO L276 IsEmpty]: Start isEmpty. Operand 7336 states and 10840 transitions. [2024-10-11 04:50:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 04:50:17,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:17,852 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:17,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:50:17,852 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:17,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:17,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1683867468, now seen corresponding path program 1 times [2024-10-11 04:50:17,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:17,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689633635] [2024-10-11 04:50:17,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:17,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:18,005 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 04:50:18,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:18,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689633635] [2024-10-11 04:50:18,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689633635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:18,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:18,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:18,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137588139] [2024-10-11 04:50:18,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:18,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:18,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:18,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:18,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:18,006 INFO L87 Difference]: Start difference. First operand 7336 states and 10840 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:18,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:18,584 INFO L93 Difference]: Finished difference Result 22436 states and 32654 transitions. [2024-10-11 04:50:18,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:50:18,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-11 04:50:18,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:18,624 INFO L225 Difference]: With dead ends: 22436 [2024-10-11 04:50:18,625 INFO L226 Difference]: Without dead ends: 19538 [2024-10-11 04:50:18,632 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:50:18,633 INFO L432 NwaCegarLoop]: 1602 mSDtfsCounter, 6338 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6338 SdHoareTripleChecker+Valid, 3557 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:18,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6338 Valid, 3557 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:18,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19538 states. [2024-10-11 04:50:18,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19538 to 11688. [2024-10-11 04:50:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11688 states, 11686 states have (on average 1.4561013178161903) internal successors, (17016), 11687 states have internal predecessors, (17016), 0 states have call successors, (0), 0 states have call 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:19,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11688 states to 11688 states and 17016 transitions. [2024-10-11 04:50:19,032 INFO L78 Accepts]: Start accepts. Automaton has 11688 states and 17016 transitions. Word has length 73 [2024-10-11 04:50:19,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:19,033 INFO L471 AbstractCegarLoop]: Abstraction has 11688 states and 17016 transitions. [2024-10-11 04:50:19,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:19,033 INFO L276 IsEmpty]: Start isEmpty. Operand 11688 states and 17016 transitions. [2024-10-11 04:50:19,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 04:50:19,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:19,035 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:19,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:50:19,035 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:19,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:19,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1058211404, now seen corresponding path program 1 times [2024-10-11 04:50:19,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:19,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138426618] [2024-10-11 04:50:19,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:19,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 04:50:19,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:19,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138426618] [2024-10-11 04:50:19,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138426618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:19,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:19,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:19,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791610066] [2024-10-11 04:50:19,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:19,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:19,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:19,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:19,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:19,202 INFO L87 Difference]: Start difference. First operand 11688 states and 17016 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:19,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:19,845 INFO L93 Difference]: Finished difference Result 25332 states and 36798 transitions. [2024-10-11 04:50:19,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:50:19,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-11 04:50:19,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:19,894 INFO L225 Difference]: With dead ends: 25332 [2024-10-11 04:50:19,894 INFO L226 Difference]: Without dead ends: 22434 [2024-10-11 04:50:19,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:50:19,911 INFO L432 NwaCegarLoop]: 1599 mSDtfsCounter, 6382 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6382 SdHoareTripleChecker+Valid, 3520 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:19,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6382 Valid, 3520 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:19,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22434 states. [2024-10-11 04:50:20,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22434 to 14584. [2024-10-11 04:50:20,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14584 states, 14582 states have (on average 1.4511041009463723) internal successors, (21160), 14583 states have internal predecessors, (21160), 0 states have call successors, (0), 0 states have call 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:20,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14584 states to 14584 states and 21160 transitions. [2024-10-11 04:50:20,557 INFO L78 Accepts]: Start accepts. Automaton has 14584 states and 21160 transitions. Word has length 73 [2024-10-11 04:50:20,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:20,558 INFO L471 AbstractCegarLoop]: Abstraction has 14584 states and 21160 transitions. [2024-10-11 04:50:20,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 14584 states and 21160 transitions. [2024-10-11 04:50:20,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 04:50:20,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:20,561 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:20,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:50:20,561 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:20,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:20,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1946944844, now seen corresponding path program 1 times [2024-10-11 04:50:20,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:20,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160316798] [2024-10-11 04:50:20,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:20,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:20,772 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 04:50:20,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:20,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160316798] [2024-10-11 04:50:20,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160316798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:20,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:20,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:20,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832280125] [2024-10-11 04:50:20,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:20,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:20,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:20,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:20,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:20,775 INFO L87 Difference]: Start difference. First operand 14584 states and 21160 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:21,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:21,480 INFO L93 Difference]: Finished difference Result 28228 states and 40942 transitions. [2024-10-11 04:50:21,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:50:21,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-11 04:50:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:21,534 INFO L225 Difference]: With dead ends: 28228 [2024-10-11 04:50:21,535 INFO L226 Difference]: Without dead ends: 25330 [2024-10-11 04:50:21,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:50:21,551 INFO L432 NwaCegarLoop]: 1603 mSDtfsCounter, 6333 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6333 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:21,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6333 Valid, 3568 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:21,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25330 states. [2024-10-11 04:50:22,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25330 to 17480. [2024-10-11 04:50:22,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17480 states, 17478 states have (on average 1.4477629019338598) internal successors, (25304), 17479 states have internal predecessors, (25304), 0 states have call successors, (0), 0 states have call 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:22,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17480 states to 17480 states and 25304 transitions. [2024-10-11 04:50:22,157 INFO L78 Accepts]: Start accepts. Automaton has 17480 states and 25304 transitions. Word has length 73 [2024-10-11 04:50:22,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:22,157 INFO L471 AbstractCegarLoop]: Abstraction has 17480 states and 25304 transitions. [2024-10-11 04:50:22,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:22,158 INFO L276 IsEmpty]: Start isEmpty. Operand 17480 states and 25304 transitions. [2024-10-11 04:50:22,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 04:50:22,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:22,160 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:22,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 04:50:22,160 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:22,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:22,161 INFO L85 PathProgramCache]: Analyzing trace with hash -881055308, now seen corresponding path program 1 times [2024-10-11 04:50:22,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:22,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181532949] [2024-10-11 04:50:22,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:22,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:22,277 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:22,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:22,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181532949] [2024-10-11 04:50:22,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181532949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:22,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:22,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:22,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207479378] [2024-10-11 04:50:22,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:22,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:22,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:22,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:22,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:22,280 INFO L87 Difference]: Start difference. First operand 17480 states and 25304 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:22,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:22,526 INFO L93 Difference]: Finished difference Result 28767 states and 41694 transitions. [2024-10-11 04:50:22,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:22,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-11 04:50:22,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:22,554 INFO L225 Difference]: With dead ends: 28767 [2024-10-11 04:50:22,554 INFO L226 Difference]: Without dead ends: 12829 [2024-10-11 04:50:22,575 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:22,575 INFO L432 NwaCegarLoop]: 1580 mSDtfsCounter, 50 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3106 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:22,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3106 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:22,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12829 states. [2024-10-11 04:50:22,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12829 to 12827. [2024-10-11 04:50:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12827 states, 12825 states have (on average 1.4592592592592593) internal successors, (18715), 12826 states have internal predecessors, (18715), 0 states have call successors, (0), 0 states have call 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:22,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12827 states to 12827 states and 18715 transitions. [2024-10-11 04:50:23,000 INFO L78 Accepts]: Start accepts. Automaton has 12827 states and 18715 transitions. Word has length 75 [2024-10-11 04:50:23,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:23,000 INFO L471 AbstractCegarLoop]: Abstraction has 12827 states and 18715 transitions. [2024-10-11 04:50:23,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:23,000 INFO L276 IsEmpty]: Start isEmpty. Operand 12827 states and 18715 transitions. [2024-10-11 04:50:23,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 04:50:23,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:23,002 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] [2024-10-11 04:50:23,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 04:50:23,002 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:23,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:23,003 INFO L85 PathProgramCache]: Analyzing trace with hash 808209329, now seen corresponding path program 1 times [2024-10-11 04:50:23,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:23,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517817827] [2024-10-11 04:50:23,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:23,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:23,139 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:50:23,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:23,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517817827] [2024-10-11 04:50:23,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517817827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:23,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:23,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:23,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903803182] [2024-10-11 04:50:23,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:23,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:23,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:23,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:23,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:23,142 INFO L87 Difference]: Start difference. First operand 12827 states and 18715 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:23,527 INFO L93 Difference]: Finished difference Result 23079 states and 33601 transitions. [2024-10-11 04:50:23,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:50:23,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 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 75 [2024-10-11 04:50:23,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:23,572 INFO L225 Difference]: With dead ends: 23079 [2024-10-11 04:50:23,572 INFO L226 Difference]: Without dead ends: 21029 [2024-10-11 04:50:23,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:50:23,586 INFO L432 NwaCegarLoop]: 1597 mSDtfsCounter, 6321 mSDsluCounter, 2095 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6321 SdHoareTripleChecker+Valid, 3692 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:23,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6321 Valid, 3692 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:23,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21029 states. [2024-10-11 04:50:24,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21029 to 14875. [2024-10-11 04:50:24,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14875 states, 14873 states have (on average 1.4562630269616084) internal successors, (21659), 14874 states have internal predecessors, (21659), 0 states have call successors, (0), 0 states have call 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:24,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14875 states to 14875 states and 21659 transitions. [2024-10-11 04:50:24,119 INFO L78 Accepts]: Start accepts. Automaton has 14875 states and 21659 transitions. Word has length 75 [2024-10-11 04:50:24,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:24,119 INFO L471 AbstractCegarLoop]: Abstraction has 14875 states and 21659 transitions. [2024-10-11 04:50:24,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:24,120 INFO L276 IsEmpty]: Start isEmpty. Operand 14875 states and 21659 transitions. [2024-10-11 04:50:24,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 04:50:24,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:24,122 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, 1, 1] [2024-10-11 04:50:24,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 04:50:24,122 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:24,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:24,123 INFO L85 PathProgramCache]: Analyzing trace with hash 448668534, now seen corresponding path program 1 times [2024-10-11 04:50:24,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:24,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008450833] [2024-10-11 04:50:24,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:24,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:24,224 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:24,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:24,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008450833] [2024-10-11 04:50:24,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008450833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:24,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:24,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:24,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639185625] [2024-10-11 04:50:24,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:24,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:24,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:24,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:24,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:24,226 INFO L87 Difference]: Start difference. First operand 14875 states and 21659 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:24,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:24,397 INFO L93 Difference]: Finished difference Result 21535 states and 31229 transitions. [2024-10-11 04:50:24,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:24,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-11 04:50:24,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:24,416 INFO L225 Difference]: With dead ends: 21535 [2024-10-11 04:50:24,417 INFO L226 Difference]: Without dead ends: 8221 [2024-10-11 04:50:24,431 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:24,432 INFO L432 NwaCegarLoop]: 1573 mSDtfsCounter, 45 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3091 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:24,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3091 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8221 states. [2024-10-11 04:50:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8221 to 8219. [2024-10-11 04:50:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8219 states, 8217 states have (on average 1.458804916636242) internal successors, (11987), 8218 states have internal predecessors, (11987), 0 states have call successors, (0), 0 states have call 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:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8219 states to 8219 states and 11987 transitions. [2024-10-11 04:50:24,647 INFO L78 Accepts]: Start accepts. Automaton has 8219 states and 11987 transitions. Word has length 76 [2024-10-11 04:50:24,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:24,647 INFO L471 AbstractCegarLoop]: Abstraction has 8219 states and 11987 transitions. [2024-10-11 04:50:24,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:24,647 INFO L276 IsEmpty]: Start isEmpty. Operand 8219 states and 11987 transitions. [2024-10-11 04:50:24,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 04:50:24,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:24,650 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, 1, 1] [2024-10-11 04:50:24,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 04:50:24,651 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:24,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:24,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1891792292, now seen corresponding path program 1 times [2024-10-11 04:50:24,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:24,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911936259] [2024-10-11 04:50:24,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:24,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:24,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:24,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911936259] [2024-10-11 04:50:24,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911936259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:24,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:24,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:24,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16297676] [2024-10-11 04:50:24,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:24,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:24,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:24,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:24,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:24,750 INFO L87 Difference]: Start difference. First operand 8219 states and 11987 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:24,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:24,909 INFO L93 Difference]: Finished difference Result 11551 states and 16721 transitions. [2024-10-11 04:50:24,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:24,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-11 04:50:24,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:24,922 INFO L225 Difference]: With dead ends: 11551 [2024-10-11 04:50:24,922 INFO L226 Difference]: Without dead ends: 4893 [2024-10-11 04:50:24,930 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:24,930 INFO L432 NwaCegarLoop]: 1566 mSDtfsCounter, 42 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3076 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:24,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3076 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:24,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4893 states. [2024-10-11 04:50:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4893 to 4891. [2024-10-11 04:50:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4891 states, 4889 states have (on average 1.4733074248312539) internal successors, (7203), 4890 states have internal predecessors, (7203), 0 states have call successors, (0), 0 states have call 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:25,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 7203 transitions. [2024-10-11 04:50:25,104 INFO L78 Accepts]: Start accepts. Automaton has 4891 states and 7203 transitions. Word has length 78 [2024-10-11 04:50:25,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:25,105 INFO L471 AbstractCegarLoop]: Abstraction has 4891 states and 7203 transitions. [2024-10-11 04:50:25,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:25,105 INFO L276 IsEmpty]: Start isEmpty. Operand 4891 states and 7203 transitions. [2024-10-11 04:50:25,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 04:50:25,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:25,107 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, 1, 1] [2024-10-11 04:50:25,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 04:50:25,107 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:25,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:25,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2071422638, now seen corresponding path program 1 times [2024-10-11 04:50:25,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:25,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447569427] [2024-10-11 04:50:25,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:25,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:25,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:25,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447569427] [2024-10-11 04:50:25,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447569427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:25,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:25,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:25,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409147922] [2024-10-11 04:50:25,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:25,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:25,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:25,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:25,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:25,233 INFO L87 Difference]: Start difference. First operand 4891 states and 7203 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:25,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:25,324 INFO L93 Difference]: Finished difference Result 6559 states and 9545 transitions. [2024-10-11 04:50:25,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:25,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-11 04:50:25,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:25,331 INFO L225 Difference]: With dead ends: 6559 [2024-10-11 04:50:25,331 INFO L226 Difference]: Without dead ends: 3229 [2024-10-11 04:50:25,336 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:25,336 INFO L432 NwaCegarLoop]: 1559 mSDtfsCounter, 39 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3061 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:25,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3061 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:25,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2024-10-11 04:50:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 3227. [2024-10-11 04:50:25,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3227 states, 3225 states have (on average 1.49984496124031) internal successors, (4837), 3226 states have internal predecessors, (4837), 0 states have call successors, (0), 0 states have call 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:25,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 3227 states and 4837 transitions. [2024-10-11 04:50:25,439 INFO L78 Accepts]: Start accepts. Automaton has 3227 states and 4837 transitions. Word has length 80 [2024-10-11 04:50:25,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:25,439 INFO L471 AbstractCegarLoop]: Abstraction has 3227 states and 4837 transitions. [2024-10-11 04:50:25,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:25,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 4837 transitions. [2024-10-11 04:50:25,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 04:50:25,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:25,441 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, 1, 1] [2024-10-11 04:50:25,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 04:50:25,442 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:25,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:25,442 INFO L85 PathProgramCache]: Analyzing trace with hash -838373760, now seen corresponding path program 1 times [2024-10-11 04:50:25,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:25,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946237188] [2024-10-11 04:50:25,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:25,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:25,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:25,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946237188] [2024-10-11 04:50:25,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946237188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:25,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:25,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:25,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46775189] [2024-10-11 04:50:25,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:25,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:25,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:25,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:25,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:25,561 INFO L87 Difference]: Start difference. First operand 3227 states and 4837 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call 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:25,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:25,619 INFO L93 Difference]: Finished difference Result 4063 states and 5996 transitions. [2024-10-11 04:50:25,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:25,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-11 04:50:25,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:25,625 INFO L225 Difference]: With dead ends: 4063 [2024-10-11 04:50:25,625 INFO L226 Difference]: Without dead ends: 2397 [2024-10-11 04:50:25,627 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:25,628 INFO L432 NwaCegarLoop]: 1552 mSDtfsCounter, 36 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 3046 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:25,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 3046 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:25,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2024-10-11 04:50:25,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 2395. [2024-10-11 04:50:25,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 2393 states have (on average 1.532386126201421) internal successors, (3667), 2394 states have internal predecessors, (3667), 0 states have call successors, (0), 0 states have call 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:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 3667 transitions. [2024-10-11 04:50:25,691 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 3667 transitions. Word has length 82 [2024-10-11 04:50:25,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:25,692 INFO L471 AbstractCegarLoop]: Abstraction has 2395 states and 3667 transitions. [2024-10-11 04:50:25,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call 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:25,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3667 transitions. [2024-10-11 04:50:25,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 04:50:25,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:25,694 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, 1, 1] [2024-10-11 04:50:25,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 04:50:25,695 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:25,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:25,695 INFO L85 PathProgramCache]: Analyzing trace with hash 726521134, now seen corresponding path program 1 times [2024-10-11 04:50:25,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:25,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777154912] [2024-10-11 04:50:25,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:25,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:27,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:27,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777154912] [2024-10-11 04:50:27,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777154912] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:50:27,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786551638] [2024-10-11 04:50:27,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:27,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:50:27,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:50:27,167 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:50:27,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 04:50:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:27,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 04:50:27,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:50:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:50:27,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:50:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:50:27,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786551638] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:50:27,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:50:27,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 18 [2024-10-11 04:50:27,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196467088] [2024-10-11 04:50:27,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:50:27,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 04:50:27,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:27,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 04:50:27,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-10-11 04:50:27,862 INFO L87 Difference]: Start difference. First operand 2395 states and 3667 transitions. Second operand has 18 states, 18 states have (on average 13.222222222222221) internal successors, (238), 18 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:50:30,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:30,588 INFO L93 Difference]: Finished difference Result 7990 states and 11205 transitions. [2024-10-11 04:50:30,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-11 04:50:30,589 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 13.222222222222221) internal successors, (238), 18 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 84 [2024-10-11 04:50:30,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:30,600 INFO L225 Difference]: With dead ends: 7990 [2024-10-11 04:50:30,600 INFO L226 Difference]: Without dead ends: 7156 [2024-10-11 04:50:30,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=714, Invalid=2946, Unknown=0, NotChecked=0, Total=3660 [2024-10-11 04:50:30,604 INFO L432 NwaCegarLoop]: 1518 mSDtfsCounter, 17879 mSDsluCounter, 6390 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17879 SdHoareTripleChecker+Valid, 7908 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:30,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17879 Valid, 7908 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:50:30,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7156 states. [2024-10-11 04:50:30,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7156 to 7108. [2024-10-11 04:50:30,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7108 states, 7106 states have (on average 1.3627920067548551) internal successors, (9684), 7107 states have internal predecessors, (9684), 0 states have call successors, (0), 0 states have call 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:30,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7108 states to 7108 states and 9684 transitions. [2024-10-11 04:50:30,810 INFO L78 Accepts]: Start accepts. Automaton has 7108 states and 9684 transitions. Word has length 84 [2024-10-11 04:50:30,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:30,811 INFO L471 AbstractCegarLoop]: Abstraction has 7108 states and 9684 transitions. [2024-10-11 04:50:30,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 13.222222222222221) internal successors, (238), 18 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:50:30,811 INFO L276 IsEmpty]: Start isEmpty. Operand 7108 states and 9684 transitions. [2024-10-11 04:50:30,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 04:50:30,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:30,812 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, 1, 1, 1, 1, 1] [2024-10-11 04:50:30,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 04:50:31,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-11 04:50:31,017 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:31,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:31,018 INFO L85 PathProgramCache]: Analyzing trace with hash -648800735, now seen corresponding path program 1 times [2024-10-11 04:50:31,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:31,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100383624] [2024-10-11 04:50:31,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:31,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:31,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:31,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100383624] [2024-10-11 04:50:31,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100383624] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:50:31,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893223588] [2024-10-11 04:50:31,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:31,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:50:31,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:50:31,966 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:50:31,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 04:50:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:32,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 04:50:32,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:50:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:32,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:50:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:34,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893223588] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:50:34,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:50:34,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2024-10-11 04:50:34,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899548055] [2024-10-11 04:50:34,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:50:34,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 04:50:34,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:34,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 04:50:34,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 04:50:34,083 INFO L87 Difference]: Start difference. First operand 7108 states and 9684 transitions. Second operand has 35 states, 35 states have (on average 6.485714285714286) internal successors, (227), 35 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call 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:37,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:37,156 INFO L93 Difference]: Finished difference Result 25403 states and 33841 transitions. [2024-10-11 04:50:37,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-11 04:50:37,156 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.485714285714286) internal successors, (227), 35 states have internal predecessors, (227), 0 states have call successors, (0), 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:50:37,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:37,181 INFO L225 Difference]: With dead ends: 25403 [2024-10-11 04:50:37,181 INFO L226 Difference]: Without dead ends: 20003 [2024-10-11 04:50:37,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1461 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1158, Invalid=5004, Unknown=0, NotChecked=0, Total=6162 [2024-10-11 04:50:37,188 INFO L432 NwaCegarLoop]: 1512 mSDtfsCounter, 22165 mSDsluCounter, 11050 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22165 SdHoareTripleChecker+Valid, 12562 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:37,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22165 Valid, 12562 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:50:37,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20003 states. [2024-10-11 04:50:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20003 to 19845. [2024-10-11 04:50:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19845 states, 19843 states have (on average 1.3113944464042735) internal successors, (26022), 19844 states have internal predecessors, (26022), 0 states have call successors, (0), 0 states have call 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:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19845 states to 19845 states and 26022 transitions. [2024-10-11 04:50:37,701 INFO L78 Accepts]: Start accepts. Automaton has 19845 states and 26022 transitions. Word has length 85 [2024-10-11 04:50:37,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:37,701 INFO L471 AbstractCegarLoop]: Abstraction has 19845 states and 26022 transitions. [2024-10-11 04:50:37,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.485714285714286) internal successors, (227), 35 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call 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:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 19845 states and 26022 transitions. [2024-10-11 04:50:37,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 04:50:37,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:37,703 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:50:37,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 04:50:37,904 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:50:37,904 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:37,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:37,905 INFO L85 PathProgramCache]: Analyzing trace with hash 695558255, now seen corresponding path program 1 times [2024-10-11 04:50:37,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:37,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306387370] [2024-10-11 04:50:37,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:37,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:39,511 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:50:39,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:39,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306387370] [2024-10-11 04:50:39,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306387370] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:50:39,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386401871] [2024-10-11 04:50:39,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:39,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:50:39,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:50:39,514 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:50:39,515 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:50:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:39,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:50:39,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:50:40,066 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:50:40,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:50:40,669 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:50:40,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386401871] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:50:40,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:50:40,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2024-10-11 04:50:40,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757154546] [2024-10-11 04:50:40,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:50:40,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 04:50:40,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:40,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 04:50:40,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2024-10-11 04:50:40,672 INFO L87 Difference]: Start difference. First operand 19845 states and 26022 transitions. Second operand has 28 states, 28 states have (on average 8.142857142857142) internal successors, (228), 27 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:43,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:43,160 INFO L93 Difference]: Finished difference Result 60463 states and 78403 transitions. [2024-10-11 04:50:43,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-11 04:50:43,160 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.142857142857142) internal successors, (228), 27 states have internal predecessors, (228), 0 states have call successors, (0), 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:50:43,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:43,211 INFO L225 Difference]: With dead ends: 60463 [2024-10-11 04:50:43,211 INFO L226 Difference]: Without dead ends: 44160 [2024-10-11 04:50:43,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=684, Invalid=2976, Unknown=0, NotChecked=0, Total=3660 [2024-10-11 04:50:43,238 INFO L432 NwaCegarLoop]: 1529 mSDtfsCounter, 21172 mSDsluCounter, 9732 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21172 SdHoareTripleChecker+Valid, 11261 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:43,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21172 Valid, 11261 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:50:43,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44160 states. [2024-10-11 04:50:44,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44160 to 40863. [2024-10-11 04:50:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40863 states, 40861 states have (on average 1.286189765301877) internal successors, (52555), 40862 states have internal predecessors, (52555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:44,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40863 states to 40863 states and 52555 transitions. [2024-10-11 04:50:44,379 INFO L78 Accepts]: Start accepts. Automaton has 40863 states and 52555 transitions. Word has length 85 [2024-10-11 04:50:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:44,379 INFO L471 AbstractCegarLoop]: Abstraction has 40863 states and 52555 transitions. [2024-10-11 04:50:44,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.142857142857142) internal successors, (228), 27 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 40863 states and 52555 transitions. [2024-10-11 04:50:44,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 04:50:44,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:44,382 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:50:44,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 04:50:44,589 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:50:44,590 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:44,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:44,590 INFO L85 PathProgramCache]: Analyzing trace with hash 556628988, now seen corresponding path program 1 times [2024-10-11 04:50:44,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:44,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135631643] [2024-10-11 04:50:44,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:44,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:44,926 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:44,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:44,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135631643] [2024-10-11 04:50:44,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135631643] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:50:44,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730023451] [2024-10-11 04:50:44,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:44,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:50:44,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:50:44,929 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:50:44,931 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:50:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:45,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 04:50:45,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:50:45,660 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:50:45,660 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:50:46,762 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:50:46,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730023451] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:50:46,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:50:46,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 31 [2024-10-11 04:50:46,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470400851] [2024-10-11 04:50:46,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:50:46,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 04:50:46,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:46,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 04:50:46,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2024-10-11 04:50:46,764 INFO L87 Difference]: Start difference. First operand 40863 states and 52555 transitions. Second operand has 31 states, 31 states have (on average 7.903225806451613) internal successors, (245), 31 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:50,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:50,090 INFO L93 Difference]: Finished difference Result 88170 states and 113063 transitions. [2024-10-11 04:50:50,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-11 04:50:50,091 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.903225806451613) internal successors, (245), 31 states have internal predecessors, (245), 0 states have call successors, (0), 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 86 [2024-10-11 04:50:50,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:50,154 INFO L225 Difference]: With dead ends: 88170 [2024-10-11 04:50:50,155 INFO L226 Difference]: Without dead ends: 49531 [2024-10-11 04:50:50,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=734, Invalid=2926, Unknown=0, NotChecked=0, Total=3660 [2024-10-11 04:50:50,181 INFO L432 NwaCegarLoop]: 1508 mSDtfsCounter, 18650 mSDsluCounter, 6587 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18650 SdHoareTripleChecker+Valid, 8095 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:50,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18650 Valid, 8095 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 04:50:50,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49531 states. [2024-10-11 04:50:51,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49531 to 47157. [2024-10-11 04:50:51,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47157 states, 47155 states have (on average 1.268370268264235) internal successors, (59810), 47156 states have internal predecessors, (59810), 0 states have call successors, (0), 0 states have call 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,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47157 states to 47157 states and 59810 transitions. [2024-10-11 04:50:52,014 INFO L78 Accepts]: Start accepts. Automaton has 47157 states and 59810 transitions. Word has length 86 [2024-10-11 04:50:52,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:52,015 INFO L471 AbstractCegarLoop]: Abstraction has 47157 states and 59810 transitions. [2024-10-11 04:50:52,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.903225806451613) internal successors, (245), 31 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call 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,015 INFO L276 IsEmpty]: Start isEmpty. Operand 47157 states and 59810 transitions. [2024-10-11 04:50:52,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 04:50:52,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:52,017 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, 1] [2024-10-11 04:50:52,033 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:50:52,221 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:50:52,222 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:52,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:52,222 INFO L85 PathProgramCache]: Analyzing trace with hash -849144929, now seen corresponding path program 1 times [2024-10-11 04:50:52,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:52,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434802808] [2024-10-11 04:50:52,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:52,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:52,777 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:50:52,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:52,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434802808] [2024-10-11 04:50:52,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434802808] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:50:52,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407595627] [2024-10-11 04:50:52,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:52,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:50:52,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:50:52,779 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:50:52,779 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:50:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:52,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:50:52,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:50:53,388 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:50:53,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:50:53,976 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:50:53,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407595627] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:50:53,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:50:53,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-10-11 04:50:53,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439548241] [2024-10-11 04:50:53,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:50:53,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 04:50:53,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:53,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 04:50:53,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-10-11 04:50:53,978 INFO L87 Difference]: Start difference. First operand 47157 states and 59810 transitions. Second operand has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 21 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call 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:57,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:57,013 INFO L93 Difference]: Finished difference Result 124144 states and 157178 transitions. [2024-10-11 04:50:57,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 04:50:57,014 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 21 states have internal predecessors, (203), 0 states have call successors, (0), 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 87 [2024-10-11 04:50:57,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:57,110 INFO L225 Difference]: With dead ends: 124144 [2024-10-11 04:50:57,110 INFO L226 Difference]: Without dead ends: 83002 [2024-10-11 04:50:57,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=747, Unknown=0, NotChecked=0, Total=992 [2024-10-11 04:50:57,134 INFO L432 NwaCegarLoop]: 1523 mSDtfsCounter, 7854 mSDsluCounter, 4795 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7854 SdHoareTripleChecker+Valid, 6318 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:57,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7854 Valid, 6318 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:50:57,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83002 states. [2024-10-11 04:50:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83002 to 78642. [2024-10-11 04:50:59,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78642 states, 78640 states have (on average 1.250851983723296) internal successors, (98367), 78641 states have internal predecessors, (98367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78642 states to 78642 states and 98367 transitions. [2024-10-11 04:50:59,965 INFO L78 Accepts]: Start accepts. Automaton has 78642 states and 98367 transitions. Word has length 87 [2024-10-11 04:50:59,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:59,966 INFO L471 AbstractCegarLoop]: Abstraction has 78642 states and 98367 transitions. [2024-10-11 04:50:59,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 21 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:59,966 INFO L276 IsEmpty]: Start isEmpty. Operand 78642 states and 98367 transitions. [2024-10-11 04:50:59,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 04:50:59,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:59,968 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, 1, 1] [2024-10-11 04:50:59,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 04:51:00,168 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:00,169 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:51:00,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:51:00,170 INFO L85 PathProgramCache]: Analyzing trace with hash -226728868, now seen corresponding path program 1 times [2024-10-11 04:51:00,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:51:00,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348014805] [2024-10-11 04:51:00,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:00,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:51:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:04,172 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:04,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:51:04,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348014805] [2024-10-11 04:51:04,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348014805] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:51:04,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681199739] [2024-10-11 04:51:04,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:51:04,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:51:04,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:51:04,174 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:04,175 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:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:51:04,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-11 04:51:04,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:51:10,150 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:10,150 INFO L311 TraceCheckSpWp]: Computing backward predicates...