./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label24.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label24.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 63c3a28a771a7642d2d01d4b50ea8f0914adef37135dc9c64a20524a1e6d797b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:22:09,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:22:09,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:22:09,167 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:22:09,167 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:22:09,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:22:09,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:22:09,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:22:09,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:22:09,199 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:22:09,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:22:09,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:22:09,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:22:09,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:22:09,202 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:22:09,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:22:09,203 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:22:09,203 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:22:09,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:22:09,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:22:09,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:22:09,208 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:22:09,208 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:22:09,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:22:09,208 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:22:09,209 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:22:09,209 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:22:09,209 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:22:09,209 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:22:09,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:22:09,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:22:09,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:22:09,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:22:09,210 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:22:09,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:22:09,211 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:22:09,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:22:09,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:22:09,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:22:09,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:22:09,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:22:09,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:22:09,214 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/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/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 -> 63c3a28a771a7642d2d01d4b50ea8f0914adef37135dc9c64a20524a1e6d797b [2024-11-09 19:22:09,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:22:09,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:22:09,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:22:09,514 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:22:09,514 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:22:09,516 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label24.c [2024-11-09 19:22:11,018 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:22:11,318 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:22:11,318 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label24.c [2024-11-09 19:22:11,346 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f27e62c3c/73fac884c3c74d9f9bb0eca5406d9eeb/FLAG88e6b5ee5 [2024-11-09 19:22:11,363 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f27e62c3c/73fac884c3c74d9f9bb0eca5406d9eeb [2024-11-09 19:22:11,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:22:11,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:22:11,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:22:11,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:22:11,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:22:11,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:22:11" (1/1) ... [2024-11-09 19:22:11,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47798f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:11, skipping insertion in model container [2024-11-09 19:22:11,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:22:11" (1/1) ... [2024-11-09 19:22:11,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:22:11,679 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label24.c[7451,7464] [2024-11-09 19:22:11,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:22:11,898 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:22:11,930 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label24.c[7451,7464] [2024-11-09 19:22:12,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:22:12,117 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:22:12,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:12 WrapperNode [2024-11-09 19:22:12,118 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:22:12,119 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:22:12,120 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:22:12,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:22:12,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:12" (1/1) ... [2024-11-09 19:22:12,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:12" (1/1) ... [2024-11-09 19:22:12,242 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2024-11-09 19:22:12,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:22:12,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:22:12,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:22:12,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:22:12,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:12" (1/1) ... [2024-11-09 19:22:12,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:12" (1/1) ... [2024-11-09 19:22:12,269 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:12" (1/1) ... [2024-11-09 19:22:12,318 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-11-09 19:22:12,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:12" (1/1) ... [2024-11-09 19:22:12,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:12" (1/1) ... [2024-11-09 19:22:12,357 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:12" (1/1) ... [2024-11-09 19:22:12,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:12" (1/1) ... [2024-11-09 19:22:12,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:12" (1/1) ... [2024-11-09 19:22:12,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:12" (1/1) ... [2024-11-09 19:22:12,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:22:12,408 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:22:12,408 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:22:12,408 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:22:12,409 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:12" (1/1) ... [2024-11-09 19:22:12,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:22:12,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:22:12,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 19:22:12,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 19:22:12,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:22:12,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:22:12,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:22:12,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:22:12,564 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:22:12,567 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:22:14,305 INFO L? ?]: Removed 248 outVars from TransFormulas that were not future-live. [2024-11-09 19:22:14,305 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:22:14,330 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:22:14,333 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:22:14,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:22:14 BoogieIcfgContainer [2024-11-09 19:22:14,333 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:22:14,336 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:22:14,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:22:14,339 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:22:14,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:22:11" (1/3) ... [2024-11-09 19:22:14,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:22:14, skipping insertion in model container [2024-11-09 19:22:14,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:12" (2/3) ... [2024-11-09 19:22:14,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:22:14, skipping insertion in model container [2024-11-09 19:22:14,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:22:14" (3/3) ... [2024-11-09 19:22:14,344 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label24.c [2024-11-09 19:22:14,360 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:22:14,360 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:22:14,435 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:22:14,442 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;@3988a7eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:22:14,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:22:14,448 INFO L276 IsEmpty]: Start isEmpty. Operand has 286 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 285 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:14,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 19:22:14,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:14,460 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-11-09 19:22:14,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:14,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:14,466 INFO L85 PathProgramCache]: Analyzing trace with hash -634812948, now seen corresponding path program 1 times [2024-11-09 19:22:14,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:14,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297799207] [2024-11-09 19:22:14,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:14,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:14,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:14,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297799207] [2024-11-09 19:22:14,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297799207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:14,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:14,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:22:14,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357987744] [2024-11-09 19:22:14,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:14,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:14,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:14,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:14,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:14,962 INFO L87 Difference]: Start difference. First operand has 286 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 285 states have internal predecessors, (604), 0 states have call successors, (0), 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 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 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-11-09 19:22:16,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:16,333 INFO L93 Difference]: Finished difference Result 767 states and 1708 transitions. [2024-11-09 19:22:16,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:16,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 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-11-09 19:22:16,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:16,348 INFO L225 Difference]: With dead ends: 767 [2024-11-09 19:22:16,349 INFO L226 Difference]: Without dead ends: 416 [2024-11-09 19:22:16,352 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-11-09 19:22:16,356 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 296 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:16,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 227 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 19:22:16,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-09 19:22:16,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2024-11-09 19:22:16,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.0240963855421685) internal successors, (840), 415 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 840 transitions. [2024-11-09 19:22:16,428 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 840 transitions. Word has length 53 [2024-11-09 19:22:16,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:16,429 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 840 transitions. [2024-11-09 19:22:16,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 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-11-09 19:22:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 840 transitions. [2024-11-09 19:22:16,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 19:22:16,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:16,435 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:16,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:22:16,436 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:16,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:16,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2033202275, now seen corresponding path program 1 times [2024-11-09 19:22:16,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:16,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834195609] [2024-11-09 19:22:16,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:16,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:16,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:16,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834195609] [2024-11-09 19:22:16,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834195609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:16,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:16,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:22:16,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612203377] [2024-11-09 19:22:16,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:16,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:16,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:16,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:16,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:16,643 INFO L87 Difference]: Start difference. First operand 416 states and 840 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:17,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:17,561 INFO L93 Difference]: Finished difference Result 1219 states and 2485 transitions. [2024-11-09 19:22:17,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:17,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-11-09 19:22:17,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:17,566 INFO L225 Difference]: With dead ends: 1219 [2024-11-09 19:22:17,566 INFO L226 Difference]: Without dead ends: 805 [2024-11-09 19:22:17,568 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-11-09 19:22:17,569 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 264 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:17,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 122 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:22:17,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-09 19:22:17,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 794. [2024-11-09 19:22:17,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.9735182849936947) internal successors, (1565), 793 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:17,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1565 transitions. [2024-11-09 19:22:17,607 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1565 transitions. Word has length 122 [2024-11-09 19:22:17,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:17,607 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1565 transitions. [2024-11-09 19:22:17,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:17,608 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1565 transitions. [2024-11-09 19:22:17,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 19:22:17,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:17,612 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:17,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:22:17,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:17,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:17,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1606423201, now seen corresponding path program 1 times [2024-11-09 19:22:17,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:17,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005334135] [2024-11-09 19:22:17,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:17,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:18,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:18,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005334135] [2024-11-09 19:22:18,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005334135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:18,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:18,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:18,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699444651] [2024-11-09 19:22:18,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:18,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:22:18,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:18,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:22:18,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:22:18,177 INFO L87 Difference]: Start difference. First operand 794 states and 1565 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:19,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:19,953 INFO L93 Difference]: Finished difference Result 2520 states and 4990 transitions. [2024-11-09 19:22:19,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:22:19,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2024-11-09 19:22:19,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:19,961 INFO L225 Difference]: With dead ends: 2520 [2024-11-09 19:22:19,962 INFO L226 Difference]: Without dead ends: 1728 [2024-11-09 19:22:19,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:22:19,964 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 845 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:19,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 225 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 19:22:19,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2024-11-09 19:22:20,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1724. [2024-11-09 19:22:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 1723 states have (on average 1.8467788740568776) internal successors, (3182), 1723 states have internal predecessors, (3182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 3182 transitions. [2024-11-09 19:22:20,038 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 3182 transitions. Word has length 123 [2024-11-09 19:22:20,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:20,040 INFO L471 AbstractCegarLoop]: Abstraction has 1724 states and 3182 transitions. [2024-11-09 19:22:20,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 3182 transitions. [2024-11-09 19:22:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-09 19:22:20,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:20,052 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 19:22:20,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:22:20,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:20,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:20,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1406133824, now seen corresponding path program 1 times [2024-11-09 19:22:20,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:20,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050489274] [2024-11-09 19:22:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:20,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:20,244 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:20,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:20,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050489274] [2024-11-09 19:22:20,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050489274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:20,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:20,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:20,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637184167] [2024-11-09 19:22:20,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:20,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:20,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:20,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:20,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:20,247 INFO L87 Difference]: Start difference. First operand 1724 states and 3182 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:21,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:21,216 INFO L93 Difference]: Finished difference Result 4014 states and 7507 transitions. [2024-11-09 19:22:21,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:21,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 181 [2024-11-09 19:22:21,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:21,228 INFO L225 Difference]: With dead ends: 4014 [2024-11-09 19:22:21,228 INFO L226 Difference]: Without dead ends: 2477 [2024-11-09 19:22:21,233 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-11-09 19:22:21,234 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 273 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:21,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 460 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:22:21,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2024-11-09 19:22:21,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2282. [2024-11-09 19:22:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2282 states, 2281 states have (on average 1.8382288469969312) internal successors, (4193), 2281 states have internal predecessors, (4193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:21,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 4193 transitions. [2024-11-09 19:22:21,283 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 4193 transitions. Word has length 181 [2024-11-09 19:22:21,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:21,284 INFO L471 AbstractCegarLoop]: Abstraction has 2282 states and 4193 transitions. [2024-11-09 19:22:21,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:21,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 4193 transitions. [2024-11-09 19:22:21,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-09 19:22:21,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:21,292 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:21,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:22:21,294 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:21,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:21,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1672927908, now seen corresponding path program 1 times [2024-11-09 19:22:21,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:21,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291157813] [2024-11-09 19:22:21,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:21,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:21,919 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:21,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:21,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291157813] [2024-11-09 19:22:21,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291157813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:21,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:21,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:22:21,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289315342] [2024-11-09 19:22:21,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:21,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:22:21,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:21,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:22:21,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:22:21,923 INFO L87 Difference]: Start difference. First operand 2282 states and 4193 transitions. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:23,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:23,394 INFO L93 Difference]: Finished difference Result 6615 states and 12387 transitions. [2024-11-09 19:22:23,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:22:23,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 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 236 [2024-11-09 19:22:23,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:23,411 INFO L225 Difference]: With dead ends: 6615 [2024-11-09 19:22:23,411 INFO L226 Difference]: Without dead ends: 4335 [2024-11-09 19:22:23,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:22:23,415 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 573 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:23,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 76 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 19:22:23,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4335 states. [2024-11-09 19:22:23,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4335 to 4140. [2024-11-09 19:22:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4140 states, 4139 states have (on average 1.8506885721188693) internal successors, (7660), 4139 states have internal predecessors, (7660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:23,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 7660 transitions. [2024-11-09 19:22:23,496 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 7660 transitions. Word has length 236 [2024-11-09 19:22:23,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:23,497 INFO L471 AbstractCegarLoop]: Abstraction has 4140 states and 7660 transitions. [2024-11-09 19:22:23,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 7660 transitions. [2024-11-09 19:22:23,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-09 19:22:23,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:23,503 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:23,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:22:23,504 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:23,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:23,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1198164028, now seen corresponding path program 1 times [2024-11-09 19:22:23,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:23,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955782237] [2024-11-09 19:22:23,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:23,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 19:22:23,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:23,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955782237] [2024-11-09 19:22:23,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955782237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:23,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:23,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:23,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714359280] [2024-11-09 19:22:23,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:23,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:23,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:23,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:23,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:23,765 INFO L87 Difference]: Start difference. First operand 4140 states and 7660 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:24,653 INFO L93 Difference]: Finished difference Result 9213 states and 17219 transitions. [2024-11-09 19:22:24,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:24,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 237 [2024-11-09 19:22:24,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:24,674 INFO L225 Difference]: With dead ends: 9213 [2024-11-09 19:22:24,675 INFO L226 Difference]: Without dead ends: 5445 [2024-11-09 19:22:24,680 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-11-09 19:22:24,681 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 265 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:24,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 497 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:22:24,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5445 states. [2024-11-09 19:22:24,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5445 to 5435. [2024-11-09 19:22:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5435 states, 5434 states have (on average 1.833271991166728) internal successors, (9962), 5434 states have internal predecessors, (9962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:24,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5435 states to 5435 states and 9962 transitions. [2024-11-09 19:22:24,776 INFO L78 Accepts]: Start accepts. Automaton has 5435 states and 9962 transitions. Word has length 237 [2024-11-09 19:22:24,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:24,777 INFO L471 AbstractCegarLoop]: Abstraction has 5435 states and 9962 transitions. [2024-11-09 19:22:24,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:24,777 INFO L276 IsEmpty]: Start isEmpty. Operand 5435 states and 9962 transitions. [2024-11-09 19:22:24,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-09 19:22:24,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:24,781 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:24,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:22:24,781 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:24,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:24,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1277296807, now seen corresponding path program 1 times [2024-11-09 19:22:24,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:24,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18499042] [2024-11-09 19:22:24,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:24,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:25,165 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:25,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:25,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18499042] [2024-11-09 19:22:25,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18499042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:25,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:25,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:25,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071998315] [2024-11-09 19:22:25,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:25,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:22:25,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:25,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:22:25,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:22:25,168 INFO L87 Difference]: Start difference. First operand 5435 states and 9962 transitions. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:26,713 INFO L93 Difference]: Finished difference Result 11432 states and 21200 transitions. [2024-11-09 19:22:26,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:22:26,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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 247 [2024-11-09 19:22:26,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:26,738 INFO L225 Difference]: With dead ends: 11432 [2024-11-09 19:22:26,738 INFO L226 Difference]: Without dead ends: 6369 [2024-11-09 19:22:26,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:22:26,747 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 478 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:26,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 141 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:22:26,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6369 states. [2024-11-09 19:22:26,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6369 to 6364. [2024-11-09 19:22:26,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6364 states, 6363 states have (on average 1.830897375451831) internal successors, (11650), 6363 states have internal predecessors, (11650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6364 states to 6364 states and 11650 transitions. [2024-11-09 19:22:26,870 INFO L78 Accepts]: Start accepts. Automaton has 6364 states and 11650 transitions. Word has length 247 [2024-11-09 19:22:26,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:26,871 INFO L471 AbstractCegarLoop]: Abstraction has 6364 states and 11650 transitions. [2024-11-09 19:22:26,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:26,871 INFO L276 IsEmpty]: Start isEmpty. Operand 6364 states and 11650 transitions. [2024-11-09 19:22:26,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-09 19:22:26,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:26,876 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:26,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:22:26,877 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:26,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:26,877 INFO L85 PathProgramCache]: Analyzing trace with hash -628583296, now seen corresponding path program 1 times [2024-11-09 19:22:26,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:26,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017890441] [2024-11-09 19:22:26,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:26,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:27,137 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-09 19:22:27,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:27,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017890441] [2024-11-09 19:22:27,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017890441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:27,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:27,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:27,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960449721] [2024-11-09 19:22:27,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:27,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:27,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:27,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:27,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:27,141 INFO L87 Difference]: Start difference. First operand 6364 states and 11650 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:28,000 INFO L93 Difference]: Finished difference Result 13670 states and 25114 transitions. [2024-11-09 19:22:28,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:28,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 257 [2024-11-09 19:22:28,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:28,020 INFO L225 Difference]: With dead ends: 13670 [2024-11-09 19:22:28,020 INFO L226 Difference]: Without dead ends: 7679 [2024-11-09 19:22:28,027 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-11-09 19:22:28,028 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 270 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:28,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 166 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:22:28,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7679 states. [2024-11-09 19:22:28,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7679 to 7288. [2024-11-09 19:22:28,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7288 states, 7287 states have (on average 1.831069027034445) internal successors, (13343), 7287 states have internal predecessors, (13343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:28,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7288 states to 7288 states and 13343 transitions. [2024-11-09 19:22:28,150 INFO L78 Accepts]: Start accepts. Automaton has 7288 states and 13343 transitions. Word has length 257 [2024-11-09 19:22:28,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:28,151 INFO L471 AbstractCegarLoop]: Abstraction has 7288 states and 13343 transitions. [2024-11-09 19:22:28,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:28,151 INFO L276 IsEmpty]: Start isEmpty. Operand 7288 states and 13343 transitions. [2024-11-09 19:22:28,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-11-09 19:22:28,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:28,157 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:28,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:22:28,157 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:28,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:28,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1295322437, now seen corresponding path program 1 times [2024-11-09 19:22:28,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:28,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191364977] [2024-11-09 19:22:28,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:28,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-09 19:22:28,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:28,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191364977] [2024-11-09 19:22:28,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191364977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:28,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:28,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:28,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150102826] [2024-11-09 19:22:28,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:28,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:28,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:28,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:28,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:28,413 INFO L87 Difference]: Start difference. First operand 7288 states and 13343 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:29,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:29,284 INFO L93 Difference]: Finished difference Result 14580 states and 26703 transitions. [2024-11-09 19:22:29,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:29,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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 285 [2024-11-09 19:22:29,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:29,302 INFO L225 Difference]: With dead ends: 14580 [2024-11-09 19:22:29,302 INFO L226 Difference]: Without dead ends: 7479 [2024-11-09 19:22:29,310 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-11-09 19:22:29,312 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 269 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:29,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 501 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:22:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7479 states. [2024-11-09 19:22:29,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7479 to 7472. [2024-11-09 19:22:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7472 states, 7471 states have (on average 1.7948065854637933) internal successors, (13409), 7471 states have internal predecessors, (13409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 13409 transitions. [2024-11-09 19:22:29,407 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 13409 transitions. Word has length 285 [2024-11-09 19:22:29,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:29,408 INFO L471 AbstractCegarLoop]: Abstraction has 7472 states and 13409 transitions. [2024-11-09 19:22:29,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:29,408 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 13409 transitions. [2024-11-09 19:22:29,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-11-09 19:22:29,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:29,417 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:29,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:22:29,418 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:29,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:29,421 INFO L85 PathProgramCache]: Analyzing trace with hash -2074343240, now seen corresponding path program 1 times [2024-11-09 19:22:29,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:29,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187143086] [2024-11-09 19:22:29,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:29,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-09 19:22:29,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:29,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187143086] [2024-11-09 19:22:29,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187143086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:29,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:29,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:29,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189470523] [2024-11-09 19:22:29,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:29,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:29,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:29,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:29,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:29,769 INFO L87 Difference]: Start difference. First operand 7472 states and 13409 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:30,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:30,837 INFO L93 Difference]: Finished difference Result 18644 states and 33725 transitions. [2024-11-09 19:22:30,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:30,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 327 [2024-11-09 19:22:30,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:30,863 INFO L225 Difference]: With dead ends: 18644 [2024-11-09 19:22:30,864 INFO L226 Difference]: Without dead ends: 11545 [2024-11-09 19:22:30,873 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-11-09 19:22:30,873 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 277 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:30,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 69 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:22:30,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11545 states. [2024-11-09 19:22:31,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11545 to 11542. [2024-11-09 19:22:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11542 states, 11541 states have (on average 1.7987176154579325) internal successors, (20759), 11541 states have internal predecessors, (20759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:31,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11542 states to 11542 states and 20759 transitions. [2024-11-09 19:22:31,072 INFO L78 Accepts]: Start accepts. Automaton has 11542 states and 20759 transitions. Word has length 327 [2024-11-09 19:22:31,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:31,073 INFO L471 AbstractCegarLoop]: Abstraction has 11542 states and 20759 transitions. [2024-11-09 19:22:31,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:31,073 INFO L276 IsEmpty]: Start isEmpty. Operand 11542 states and 20759 transitions. [2024-11-09 19:22:31,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-09 19:22:31,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:31,083 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:31,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:22:31,083 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:31,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:31,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1458683437, now seen corresponding path program 1 times [2024-11-09 19:22:31,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:31,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862763123] [2024-11-09 19:22:31,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:31,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 19:22:31,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:31,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862763123] [2024-11-09 19:22:31,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862763123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:31,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:31,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:31,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770041210] [2024-11-09 19:22:31,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:31,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:31,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:31,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:31,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:31,275 INFO L87 Difference]: Start difference. First operand 11542 states and 20759 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:32,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:32,089 INFO L93 Difference]: Finished difference Result 26040 states and 47112 transitions. [2024-11-09 19:22:32,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:32,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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 330 [2024-11-09 19:22:32,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:32,125 INFO L225 Difference]: With dead ends: 26040 [2024-11-09 19:22:32,125 INFO L226 Difference]: Without dead ends: 14871 [2024-11-09 19:22:32,138 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-11-09 19:22:32,139 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 269 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:32,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 154 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:22:32,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14871 states. [2024-11-09 19:22:32,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14871 to 14682. [2024-11-09 19:22:32,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14682 states, 14681 states have (on average 1.765955997547851) internal successors, (25926), 14681 states have internal predecessors, (25926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:32,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14682 states to 14682 states and 25926 transitions. [2024-11-09 19:22:32,340 INFO L78 Accepts]: Start accepts. Automaton has 14682 states and 25926 transitions. Word has length 330 [2024-11-09 19:22:32,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:32,341 INFO L471 AbstractCegarLoop]: Abstraction has 14682 states and 25926 transitions. [2024-11-09 19:22:32,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 14682 states and 25926 transitions. [2024-11-09 19:22:32,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-11-09 19:22:32,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:32,351 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:32,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:22:32,351 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:32,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:32,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1822978433, now seen corresponding path program 1 times [2024-11-09 19:22:32,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:32,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678909001] [2024-11-09 19:22:32,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:32,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:32,611 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2024-11-09 19:22:32,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:32,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678909001] [2024-11-09 19:22:32,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678909001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:32,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:32,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:32,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199418113] [2024-11-09 19:22:32,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:32,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:32,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:32,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:32,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:32,613 INFO L87 Difference]: Start difference. First operand 14682 states and 25926 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:33,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:33,445 INFO L93 Difference]: Finished difference Result 31581 states and 55733 transitions. [2024-11-09 19:22:33,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:33,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 331 [2024-11-09 19:22:33,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:33,471 INFO L225 Difference]: With dead ends: 31581 [2024-11-09 19:22:33,471 INFO L226 Difference]: Without dead ends: 17271 [2024-11-09 19:22:33,488 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-11-09 19:22:33,488 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 287 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:33,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 159 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:22:33,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17271 states. [2024-11-09 19:22:33,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17271 to 10422. [2024-11-09 19:22:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10422 states, 10421 states have (on average 1.7822665771039248) internal successors, (18573), 10421 states have internal predecessors, (18573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:33,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10422 states to 10422 states and 18573 transitions. [2024-11-09 19:22:33,812 INFO L78 Accepts]: Start accepts. Automaton has 10422 states and 18573 transitions. Word has length 331 [2024-11-09 19:22:33,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:33,812 INFO L471 AbstractCegarLoop]: Abstraction has 10422 states and 18573 transitions. [2024-11-09 19:22:33,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:33,813 INFO L276 IsEmpty]: Start isEmpty. Operand 10422 states and 18573 transitions. [2024-11-09 19:22:33,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-09 19:22:33,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:33,825 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:33,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:22:33,825 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:33,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:33,826 INFO L85 PathProgramCache]: Analyzing trace with hash -415305995, now seen corresponding path program 1 times [2024-11-09 19:22:33,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:33,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119350215] [2024-11-09 19:22:33,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:33,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:34,072 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-11-09 19:22:34,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:34,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119350215] [2024-11-09 19:22:34,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119350215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:34,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:34,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:22:34,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818719246] [2024-11-09 19:22:34,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:34,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:34,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:34,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:34,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:34,075 INFO L87 Difference]: Start difference. First operand 10422 states and 18573 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:34,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:34,522 INFO L93 Difference]: Finished difference Result 20468 states and 36520 transitions. [2024-11-09 19:22:34,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:34,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 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 337 [2024-11-09 19:22:34,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:34,541 INFO L225 Difference]: With dead ends: 20468 [2024-11-09 19:22:34,541 INFO L226 Difference]: Without dead ends: 10418 [2024-11-09 19:22:34,552 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-11-09 19:22:34,553 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 309 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:34,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 42 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 19:22:34,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10418 states. [2024-11-09 19:22:34,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10418 to 10418. [2024-11-09 19:22:34,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10418 states, 10417 states have (on average 1.7819909762887587) internal successors, (18563), 10417 states have internal predecessors, (18563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:34,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10418 states to 10418 states and 18563 transitions. [2024-11-09 19:22:34,803 INFO L78 Accepts]: Start accepts. Automaton has 10418 states and 18563 transitions. Word has length 337 [2024-11-09 19:22:34,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:34,804 INFO L471 AbstractCegarLoop]: Abstraction has 10418 states and 18563 transitions. [2024-11-09 19:22:34,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:34,804 INFO L276 IsEmpty]: Start isEmpty. Operand 10418 states and 18563 transitions. [2024-11-09 19:22:34,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-11-09 19:22:34,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:34,819 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:34,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:22:34,820 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:34,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:34,820 INFO L85 PathProgramCache]: Analyzing trace with hash -915969163, now seen corresponding path program 1 times [2024-11-09 19:22:34,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:34,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778616934] [2024-11-09 19:22:34,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:34,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 19:22:35,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:35,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778616934] [2024-11-09 19:22:35,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778616934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:35,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:35,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:35,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098562506] [2024-11-09 19:22:35,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:35,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:35,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:35,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:35,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:35,253 INFO L87 Difference]: Start difference. First operand 10418 states and 18563 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:36,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:36,235 INFO L93 Difference]: Finished difference Result 24164 states and 42958 transitions. [2024-11-09 19:22:36,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:36,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 362 [2024-11-09 19:22:36,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:36,252 INFO L225 Difference]: With dead ends: 24164 [2024-11-09 19:22:36,252 INFO L226 Difference]: Without dead ends: 12262 [2024-11-09 19:22:36,257 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-11-09 19:22:36,258 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 270 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:36,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 432 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:22:36,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12262 states. [2024-11-09 19:22:36,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12262 to 11337. [2024-11-09 19:22:36,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11337 states, 11336 states have (on average 1.738532110091743) internal successors, (19708), 11336 states have internal predecessors, (19708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11337 states to 11337 states and 19708 transitions. [2024-11-09 19:22:36,393 INFO L78 Accepts]: Start accepts. Automaton has 11337 states and 19708 transitions. Word has length 362 [2024-11-09 19:22:36,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:36,393 INFO L471 AbstractCegarLoop]: Abstraction has 11337 states and 19708 transitions. [2024-11-09 19:22:36,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:36,394 INFO L276 IsEmpty]: Start isEmpty. Operand 11337 states and 19708 transitions. [2024-11-09 19:22:36,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2024-11-09 19:22:36,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:36,402 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:36,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 19:22:36,403 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:36,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:36,403 INFO L85 PathProgramCache]: Analyzing trace with hash 329798709, now seen corresponding path program 1 times [2024-11-09 19:22:36,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:36,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476899746] [2024-11-09 19:22:36,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:36,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:36,685 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-09 19:22:36,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:36,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476899746] [2024-11-09 19:22:36,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476899746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:36,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:36,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:36,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035519021] [2024-11-09 19:22:36,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:36,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:36,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:36,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:36,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:36,688 INFO L87 Difference]: Start difference. First operand 11337 states and 19708 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:37,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:37,617 INFO L93 Difference]: Finished difference Result 24534 states and 42677 transitions. [2024-11-09 19:22:37,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:37,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 367 [2024-11-09 19:22:37,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:37,631 INFO L225 Difference]: With dead ends: 24534 [2024-11-09 19:22:37,631 INFO L226 Difference]: Without dead ends: 13569 [2024-11-09 19:22:37,638 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-11-09 19:22:37,639 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 255 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:37,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 116 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:22:37,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13569 states. [2024-11-09 19:22:37,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13569 to 12451. [2024-11-09 19:22:37,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12451 states, 12450 states have (on average 1.7360642570281124) internal successors, (21614), 12450 states have internal predecessors, (21614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12451 states to 12451 states and 21614 transitions. [2024-11-09 19:22:37,794 INFO L78 Accepts]: Start accepts. Automaton has 12451 states and 21614 transitions. Word has length 367 [2024-11-09 19:22:37,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:37,795 INFO L471 AbstractCegarLoop]: Abstraction has 12451 states and 21614 transitions. [2024-11-09 19:22:37,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:37,795 INFO L276 IsEmpty]: Start isEmpty. Operand 12451 states and 21614 transitions. [2024-11-09 19:22:37,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-11-09 19:22:37,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:37,805 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:37,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 19:22:37,805 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:37,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:37,806 INFO L85 PathProgramCache]: Analyzing trace with hash 299722199, now seen corresponding path program 1 times [2024-11-09 19:22:37,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:37,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013271593] [2024-11-09 19:22:37,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:37,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:38,253 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-09 19:22:38,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:38,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013271593] [2024-11-09 19:22:38,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013271593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:38,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:38,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:38,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194307719] [2024-11-09 19:22:38,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:38,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:22:38,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:38,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:22:38,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:22:38,257 INFO L87 Difference]: Start difference. First operand 12451 states and 21614 transitions. Second operand has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:39,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:39,484 INFO L93 Difference]: Finished difference Result 31947 states and 55518 transitions. [2024-11-09 19:22:39,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:22:39,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 377 [2024-11-09 19:22:39,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:39,512 INFO L225 Difference]: With dead ends: 31947 [2024-11-09 19:22:39,512 INFO L226 Difference]: Without dead ends: 19498 [2024-11-09 19:22:39,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:22:39,525 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 473 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1509 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:39,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 74 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1509 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:22:39,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19498 states. [2024-11-09 19:22:39,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19498 to 18383. [2024-11-09 19:22:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18383 states, 18382 states have (on average 1.7331628767272331) internal successors, (31859), 18382 states have internal predecessors, (31859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18383 states to 18383 states and 31859 transitions. [2024-11-09 19:22:39,760 INFO L78 Accepts]: Start accepts. Automaton has 18383 states and 31859 transitions. Word has length 377 [2024-11-09 19:22:39,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:39,761 INFO L471 AbstractCegarLoop]: Abstraction has 18383 states and 31859 transitions. [2024-11-09 19:22:39,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:39,761 INFO L276 IsEmpty]: Start isEmpty. Operand 18383 states and 31859 transitions. [2024-11-09 19:22:39,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2024-11-09 19:22:39,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:39,770 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:39,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 19:22:39,770 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:39,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:39,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1511563760, now seen corresponding path program 1 times [2024-11-09 19:22:39,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:39,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871675248] [2024-11-09 19:22:39,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:39,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:40,408 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 149 proven. 202 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-09 19:22:40,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:40,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871675248] [2024-11-09 19:22:40,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871675248] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:22:40,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332353423] [2024-11-09 19:22:40,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:40,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:22:40,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:22:40,411 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:22:40,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:22:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:40,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 19:22:40,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:22:42,223 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 248 proven. 181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:42,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:22:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 248 proven. 181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:45,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332353423] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 19:22:45,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 19:22:45,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2024-11-09 19:22:45,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772620661] [2024-11-09 19:22:45,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 19:22:45,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 19:22:45,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:45,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 19:22:45,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-09 19:22:45,173 INFO L87 Difference]: Start difference. First operand 18383 states and 31859 transitions. Second operand has 12 states, 12 states have (on average 77.0) internal successors, (924), 11 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:53,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:53,369 INFO L93 Difference]: Finished difference Result 57645 states and 99543 transitions. [2024-11-09 19:22:53,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-09 19:22:53,370 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 77.0) internal successors, (924), 11 states have internal predecessors, (924), 0 states have call successors, (0), 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 394 [2024-11-09 19:22:53,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:53,414 INFO L225 Difference]: With dead ends: 57645 [2024-11-09 19:22:53,414 INFO L226 Difference]: Without dead ends: 39077 [2024-11-09 19:22:53,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 780 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=464, Invalid=1176, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 19:22:53,431 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 8644 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 10876 mSolverCounterSat, 1513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8644 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 12389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1513 IncrementalHoareTripleChecker+Valid, 10876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:53,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8644 Valid, 223 Invalid, 12389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1513 Valid, 10876 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2024-11-09 19:22:53,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39077 states. [2024-11-09 19:22:53,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39077 to 34501. [2024-11-09 19:22:53,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34501 states, 34500 states have (on average 1.7194492753623187) internal successors, (59321), 34500 states have internal predecessors, (59321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:53,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34501 states to 34501 states and 59321 transitions. [2024-11-09 19:22:53,857 INFO L78 Accepts]: Start accepts. Automaton has 34501 states and 59321 transitions. Word has length 394 [2024-11-09 19:22:53,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:53,857 INFO L471 AbstractCegarLoop]: Abstraction has 34501 states and 59321 transitions. [2024-11-09 19:22:53,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 77.0) internal successors, (924), 11 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:53,858 INFO L276 IsEmpty]: Start isEmpty. Operand 34501 states and 59321 transitions. [2024-11-09 19:22:53,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2024-11-09 19:22:53,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:53,865 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:53,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:22:54,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 19:22:54,066 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:54,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:54,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1305167919, now seen corresponding path program 1 times [2024-11-09 19:22:54,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:54,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4763878] [2024-11-09 19:22:54,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:54,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-11-09 19:22:54,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:54,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4763878] [2024-11-09 19:22:54,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4763878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:54,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:54,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:54,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451980250] [2024-11-09 19:22:54,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:54,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:22:54,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:54,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:22:54,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:22:54,791 INFO L87 Difference]: Start difference. First operand 34501 states and 59321 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:56,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:56,254 INFO L93 Difference]: Finished difference Result 70486 states and 121282 transitions. [2024-11-09 19:22:56,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:22:56,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 398 [2024-11-09 19:22:56,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:56,297 INFO L225 Difference]: With dead ends: 70486 [2024-11-09 19:22:56,297 INFO L226 Difference]: Without dead ends: 36357 [2024-11-09 19:22:56,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:22:56,317 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 457 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:56,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 113 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:22:56,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36357 states. [2024-11-09 19:22:56,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36357 to 32830. [2024-11-09 19:22:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32830 states, 32829 states have (on average 1.7191812117335283) internal successors, (56439), 32829 states have internal predecessors, (56439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:56,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32830 states to 32830 states and 56439 transitions. [2024-11-09 19:22:56,723 INFO L78 Accepts]: Start accepts. Automaton has 32830 states and 56439 transitions. Word has length 398 [2024-11-09 19:22:56,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:56,723 INFO L471 AbstractCegarLoop]: Abstraction has 32830 states and 56439 transitions. [2024-11-09 19:22:56,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:56,723 INFO L276 IsEmpty]: Start isEmpty. Operand 32830 states and 56439 transitions. [2024-11-09 19:22:56,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-11-09 19:22:56,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:56,814 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:56,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 19:22:56,814 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:56,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:56,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1827586573, now seen corresponding path program 1 times [2024-11-09 19:22:56,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:56,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771641224] [2024-11-09 19:22:56,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:56,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:56,978 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2024-11-09 19:22:56,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:56,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771641224] [2024-11-09 19:22:56,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771641224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:56,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:56,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:56,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184386351] [2024-11-09 19:22:56,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:56,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:56,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:56,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:56,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:56,980 INFO L87 Difference]: Start difference. First operand 32830 states and 56439 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:57,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:57,758 INFO L93 Difference]: Finished difference Result 62873 states and 108159 transitions. [2024-11-09 19:22:57,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:57,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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 408 [2024-11-09 19:22:57,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:57,806 INFO L225 Difference]: With dead ends: 62873 [2024-11-09 19:22:57,806 INFO L226 Difference]: Without dead ends: 33009 [2024-11-09 19:22:57,825 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-11-09 19:22:57,826 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 269 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:57,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 132 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:22:57,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33009 states. [2024-11-09 19:22:58,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33009 to 32081. [2024-11-09 19:22:58,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32081 states, 32080 states have (on average 1.7158354114713217) internal successors, (55044), 32080 states have internal predecessors, (55044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32081 states to 32081 states and 55044 transitions. [2024-11-09 19:22:58,171 INFO L78 Accepts]: Start accepts. Automaton has 32081 states and 55044 transitions. Word has length 408 [2024-11-09 19:22:58,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:58,172 INFO L471 AbstractCegarLoop]: Abstraction has 32081 states and 55044 transitions. [2024-11-09 19:22:58,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:58,172 INFO L276 IsEmpty]: Start isEmpty. Operand 32081 states and 55044 transitions. [2024-11-09 19:22:58,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2024-11-09 19:22:58,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:58,182 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:58,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 19:22:58,182 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:58,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:58,183 INFO L85 PathProgramCache]: Analyzing trace with hash 925260655, now seen corresponding path program 1 times [2024-11-09 19:22:58,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:58,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466596814] [2024-11-09 19:22:58,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:58,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:58,714 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2024-11-09 19:22:58,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:58,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466596814] [2024-11-09 19:22:58,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466596814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:58,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:58,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:58,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238907984] [2024-11-09 19:22:58,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:58,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:58,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:58,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:58,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:58,717 INFO L87 Difference]: Start difference. First operand 32081 states and 55044 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:59,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:59,526 INFO L93 Difference]: Finished difference Result 65821 states and 113000 transitions. [2024-11-09 19:22:59,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:59,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 439 [2024-11-09 19:22:59,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:59,578 INFO L225 Difference]: With dead ends: 65821 [2024-11-09 19:22:59,578 INFO L226 Difference]: Without dead ends: 34112 [2024-11-09 19:22:59,602 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-11-09 19:22:59,602 INFO L432 NwaCegarLoop]: 414 mSDtfsCounter, 274 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:59,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 434 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:22:59,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34112 states. [2024-11-09 19:22:59,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34112 to 28001. [2024-11-09 19:22:59,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28001 states, 28000 states have (on average 1.7101428571428572) internal successors, (47884), 28000 states have internal predecessors, (47884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28001 states to 28001 states and 47884 transitions. [2024-11-09 19:22:59,961 INFO L78 Accepts]: Start accepts. Automaton has 28001 states and 47884 transitions. Word has length 439 [2024-11-09 19:22:59,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:59,962 INFO L471 AbstractCegarLoop]: Abstraction has 28001 states and 47884 transitions. [2024-11-09 19:22:59,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:59,962 INFO L276 IsEmpty]: Start isEmpty. Operand 28001 states and 47884 transitions. [2024-11-09 19:22:59,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2024-11-09 19:22:59,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:59,972 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:59,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 19:22:59,972 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:59,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:59,973 INFO L85 PathProgramCache]: Analyzing trace with hash -541910317, now seen corresponding path program 1 times [2024-11-09 19:22:59,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:59,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219403615] [2024-11-09 19:22:59,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:59,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 616 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-09 19:23:00,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:00,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219403615] [2024-11-09 19:23:00,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219403615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:00,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:00,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:23:00,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704491918] [2024-11-09 19:23:00,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:00,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:00,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:00,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:00,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:00,402 INFO L87 Difference]: Start difference. First operand 28001 states and 47884 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:01,167 INFO L93 Difference]: Finished difference Result 54337 states and 92993 transitions. [2024-11-09 19:23:01,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:01,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 474 [2024-11-09 19:23:01,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:01,200 INFO L225 Difference]: With dead ends: 54337 [2024-11-09 19:23:01,200 INFO L226 Difference]: Without dead ends: 28930 [2024-11-09 19:23:01,216 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-11-09 19:23:01,217 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 245 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:01,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 125 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:23:01,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28930 states. [2024-11-09 19:23:01,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28930 to 27631. [2024-11-09 19:23:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27631 states, 27630 states have (on average 1.709554831704669) internal successors, (47235), 27630 states have internal predecessors, (47235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27631 states to 27631 states and 47235 transitions. [2024-11-09 19:23:01,535 INFO L78 Accepts]: Start accepts. Automaton has 27631 states and 47235 transitions. Word has length 474 [2024-11-09 19:23:01,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:01,535 INFO L471 AbstractCegarLoop]: Abstraction has 27631 states and 47235 transitions. [2024-11-09 19:23:01,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:01,536 INFO L276 IsEmpty]: Start isEmpty. Operand 27631 states and 47235 transitions. [2024-11-09 19:23:01,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2024-11-09 19:23:01,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:01,545 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:23:01,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 19:23:01,545 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:01,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:01,545 INFO L85 PathProgramCache]: Analyzing trace with hash 703218880, now seen corresponding path program 1 times [2024-11-09 19:23:01,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:01,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079932340] [2024-11-09 19:23:01,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:01,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2024-11-09 19:23:01,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:01,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079932340] [2024-11-09 19:23:01,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079932340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:01,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:01,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:23:01,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811637431] [2024-11-09 19:23:01,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:01,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:01,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:01,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:01,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:01,970 INFO L87 Difference]: Start difference. First operand 27631 states and 47235 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:02,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:02,851 INFO L93 Difference]: Finished difference Result 52483 states and 89780 transitions. [2024-11-09 19:23:02,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:02,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 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 478 [2024-11-09 19:23:02,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:02,885 INFO L225 Difference]: With dead ends: 52483 [2024-11-09 19:23:02,885 INFO L226 Difference]: Without dead ends: 27261 [2024-11-09 19:23:02,902 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-11-09 19:23:02,903 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 238 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:02,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 161 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:23:02,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27261 states. [2024-11-09 19:23:03,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27261 to 26706. [2024-11-09 19:23:03,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26706 states, 26705 states have (on average 1.709380265867815) internal successors, (45649), 26705 states have internal predecessors, (45649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:03,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26706 states to 26706 states and 45649 transitions. [2024-11-09 19:23:03,361 INFO L78 Accepts]: Start accepts. Automaton has 26706 states and 45649 transitions. Word has length 478 [2024-11-09 19:23:03,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:03,361 INFO L471 AbstractCegarLoop]: Abstraction has 26706 states and 45649 transitions. [2024-11-09 19:23:03,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:03,361 INFO L276 IsEmpty]: Start isEmpty. Operand 26706 states and 45649 transitions. [2024-11-09 19:23:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2024-11-09 19:23:03,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:03,377 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-09 19:23:03,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 19:23:03,377 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:03,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:03,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1333619055, now seen corresponding path program 1 times [2024-11-09 19:23:03,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:03,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637258043] [2024-11-09 19:23:03,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:03,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:04,461 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-09 19:23:04,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:04,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637258043] [2024-11-09 19:23:04,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637258043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:04,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:04,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 19:23:04,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274772526] [2024-11-09 19:23:04,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:04,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 19:23:04,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:04,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 19:23:04,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:23:04,463 INFO L87 Difference]: Start difference. First operand 26706 states and 45649 transitions. Second operand has 7 states, 7 states have (on average 56.857142857142854) internal successors, (398), 6 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:06,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:06,343 INFO L93 Difference]: Finished difference Result 56005 states and 95729 transitions. [2024-11-09 19:23:06,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 19:23:06,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 56.857142857142854) internal successors, (398), 6 states have internal predecessors, (398), 0 states have call successors, (0), 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 529 [2024-11-09 19:23:06,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:06,378 INFO L225 Difference]: With dead ends: 56005 [2024-11-09 19:23:06,378 INFO L226 Difference]: Without dead ends: 31708 [2024-11-09 19:23:06,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-09 19:23:06,395 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 512 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 2776 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 2804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:06,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 203 Invalid, 2804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2776 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 19:23:06,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31708 states. [2024-11-09 19:23:06,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31708 to 27633. [2024-11-09 19:23:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27633 states, 27632 states have (on average 1.709973943254198) internal successors, (47250), 27632 states have internal predecessors, (47250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27633 states to 27633 states and 47250 transitions. [2024-11-09 19:23:06,722 INFO L78 Accepts]: Start accepts. Automaton has 27633 states and 47250 transitions. Word has length 529 [2024-11-09 19:23:06,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:06,723 INFO L471 AbstractCegarLoop]: Abstraction has 27633 states and 47250 transitions. [2024-11-09 19:23:06,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 56.857142857142854) internal successors, (398), 6 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:06,723 INFO L276 IsEmpty]: Start isEmpty. Operand 27633 states and 47250 transitions. [2024-11-09 19:23:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2024-11-09 19:23:06,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:06,739 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:23:06,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 19:23:06,739 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:06,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:06,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1893163085, now seen corresponding path program 1 times [2024-11-09 19:23:06,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:06,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106454844] [2024-11-09 19:23:06,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:06,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 613 proven. 8 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-09 19:23:08,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:08,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106454844] [2024-11-09 19:23:08,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106454844] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:23:08,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370955019] [2024-11-09 19:23:08,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:08,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:23:08,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:23:08,134 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:23:08,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 19:23:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:08,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 19:23:08,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:23:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 499 proven. 122 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-09 19:23:09,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:23:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 499 proven. 122 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-09 19:23:11,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370955019] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 19:23:11,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 19:23:11,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2024-11-09 19:23:11,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722569874] [2024-11-09 19:23:11,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 19:23:11,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 19:23:11,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:11,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 19:23:11,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-09 19:23:11,583 INFO L87 Difference]: Start difference. First operand 27633 states and 47250 transitions. Second operand has 11 states, 11 states have (on average 89.0909090909091) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:16,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:16,088 INFO L93 Difference]: Finished difference Result 58968 states and 100719 transitions. [2024-11-09 19:23:16,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 19:23:16,089 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 89.0909090909091) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 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 539 [2024-11-09 19:23:16,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:16,120 INFO L225 Difference]: With dead ends: 58968 [2024-11-09 19:23:16,120 INFO L226 Difference]: Without dead ends: 27638 [2024-11-09 19:23:16,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1099 GetRequests, 1075 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=436, Unknown=0, NotChecked=0, Total=650 [2024-11-09 19:23:16,137 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 3705 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 5791 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3705 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 6278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 5791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:16,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3705 Valid, 152 Invalid, 6278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 5791 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-09 19:23:16,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27638 states. [2024-11-09 19:23:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27638 to 13734. [2024-11-09 19:23:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13734 states, 13733 states have (on average 1.694968324473895) internal successors, (23277), 13733 states have internal predecessors, (23277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13734 states to 13734 states and 23277 transitions. [2024-11-09 19:23:16,331 INFO L78 Accepts]: Start accepts. Automaton has 13734 states and 23277 transitions. Word has length 539 [2024-11-09 19:23:16,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:16,332 INFO L471 AbstractCegarLoop]: Abstraction has 13734 states and 23277 transitions. [2024-11-09 19:23:16,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.0909090909091) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 13734 states and 23277 transitions. [2024-11-09 19:23:16,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2024-11-09 19:23:16,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:16,340 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:23:16,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 19:23:16,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 19:23:16,541 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:16,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:16,542 INFO L85 PathProgramCache]: Analyzing trace with hash 240547959, now seen corresponding path program 1 times [2024-11-09 19:23:16,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:16,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873521963] [2024-11-09 19:23:16,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:16,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 396 proven. 209 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-09 19:23:17,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:17,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873521963] [2024-11-09 19:23:17,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873521963] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:23:17,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198399414] [2024-11-09 19:23:17,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:17,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:23:17,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:23:17,568 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:23:17,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 19:23:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:17,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 19:23:17,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:23:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 346 proven. 259 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-09 19:23:19,509 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:23:20,711 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 535 proven. 70 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-09 19:23:20,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198399414] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 19:23:20,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 19:23:20,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 19:23:20,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670426064] [2024-11-09 19:23:20,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 19:23:20,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 19:23:20,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:20,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 19:23:20,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2024-11-09 19:23:20,714 INFO L87 Difference]: Start difference. First operand 13734 states and 23277 transitions. Second operand has 10 states, 10 states have (on average 85.3) internal successors, (853), 10 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)