./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label23.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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/Problem03_label23.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 f8d52330c815f141bcb84aeefc15b1687a66c0b13bb7dfec635891f85eb645e1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 21:21:33,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 21:21:34,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 21:21:34,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 21:21:34,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 21:21:34,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 21:21:34,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 21:21:34,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 21:21:34,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 21:21:34,133 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 21:21:34,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 21:21:34,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 21:21:34,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 21:21:34,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 21:21:34,135 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 21:21:34,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 21:21:34,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 21:21:34,154 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 21:21:34,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 21:21:34,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 21:21:34,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 21:21:34,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 21:21:34,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 21:21:34,162 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 21:21:34,162 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 21:21:34,162 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 21:21:34,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 21:21:34,163 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 21:21:34,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 21:21:34,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 21:21:34,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 21:21:34,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 21:21:34,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:21:34,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 21:21:34,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 21:21:34,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 21:21:34,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 21:21:34,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 21:21:34,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 21:21:34,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 21:21:34,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 21:21:34,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 21:21:34,172 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 -> f8d52330c815f141bcb84aeefc15b1687a66c0b13bb7dfec635891f85eb645e1 [2024-11-21 21:21:34,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 21:21:34,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 21:21:34,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 21:21:34,579 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 21:21:34,579 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 21:21:34,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label23.c [2024-11-21 21:21:36,156 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 21:21:36,431 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 21:21:36,431 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label23.c [2024-11-21 21:21:36,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47cff481a/b634b3507c024942a8f90c74e05e6f5a/FLAG18e19c143 [2024-11-21 21:21:36,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47cff481a/b634b3507c024942a8f90c74e05e6f5a [2024-11-21 21:21:36,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 21:21:36,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 21:21:36,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 21:21:36,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 21:21:36,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 21:21:36,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:21:36" (1/1) ... [2024-11-21 21:21:36,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21c18b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:21:36, skipping insertion in model container [2024-11-21 21:21:36,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:21:36" (1/1) ... [2024-11-21 21:21:36,784 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 21:21:37,262 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/Problem03_label23.c[57306,57319] [2024-11-21 21:21:37,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:21:37,301 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 21:21:37,429 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/Problem03_label23.c[57306,57319] [2024-11-21 21:21:37,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:21:37,458 INFO L204 MainTranslator]: Completed translation [2024-11-21 21:21:37,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:21:37 WrapperNode [2024-11-21 21:21:37,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 21:21:37,460 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 21:21:37,460 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 21:21:37,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 21:21:37,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:21:37" (1/1) ... [2024-11-21 21:21:37,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:21:37" (1/1) ... [2024-11-21 21:21:37,582 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-11-21 21:21:37,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 21:21:37,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 21:21:37,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 21:21:37,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 21:21:37,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:21:37" (1/1) ... [2024-11-21 21:21:37,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:21:37" (1/1) ... [2024-11-21 21:21:37,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:21:37" (1/1) ... [2024-11-21 21:21:37,643 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-21 21:21:37,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:21:37" (1/1) ... [2024-11-21 21:21:37,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:21:37" (1/1) ... [2024-11-21 21:21:37,686 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:21:37" (1/1) ... [2024-11-21 21:21:37,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:21:37" (1/1) ... [2024-11-21 21:21:37,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:21:37" (1/1) ... [2024-11-21 21:21:37,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:21:37" (1/1) ... [2024-11-21 21:21:37,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 21:21:37,731 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 21:21:37,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 21:21:37,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 21:21:37,732 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:21:37" (1/1) ... [2024-11-21 21:21:37,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:21:37,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:21:37,763 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-21 21:21:37,765 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-21 21:21:37,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 21:21:37,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 21:21:37,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 21:21:37,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 21:21:37,874 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 21:21:37,876 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 21:21:39,384 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-21 21:21:39,385 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 21:21:39,405 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 21:21:39,405 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 21:21:39,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:21:39 BoogieIcfgContainer [2024-11-21 21:21:39,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 21:21:39,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 21:21:39,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 21:21:39,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 21:21:39,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:21:36" (1/3) ... [2024-11-21 21:21:39,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431a55a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:21:39, skipping insertion in model container [2024-11-21 21:21:39,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:21:37" (2/3) ... [2024-11-21 21:21:39,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431a55a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:21:39, skipping insertion in model container [2024-11-21 21:21:39,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:21:39" (3/3) ... [2024-11-21 21:21:39,416 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label23.c [2024-11-21 21:21:39,427 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 21:21:39,428 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 21:21:39,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 21:21:39,495 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;@749a5745, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 21:21:39,499 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 21:21:39,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 0 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-21 21:21:39,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-21 21:21:39,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:21:39,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:21:39,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:21:39,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:21:39,537 INFO L85 PathProgramCache]: Analyzing trace with hash 552287235, now seen corresponding path program 1 times [2024-11-21 21:21:39,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:21:39,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158396745] [2024-11-21 21:21:39,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:21:39,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:21:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:21:40,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:21:40,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:21:40,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158396745] [2024-11-21 21:21:40,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158396745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:21:40,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:21:40,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:21:40,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694988877] [2024-11-21 21:21:40,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:21:40,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:21:40,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:21:40,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:21:40,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:21:40,284 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 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 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 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-21 21:21:41,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:21:41,231 INFO L93 Difference]: Finished difference Result 860 states and 1507 transitions. [2024-11-21 21:21:41,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:21:41,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2024-11-21 21:21:41,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:21:41,253 INFO L225 Difference]: With dead ends: 860 [2024-11-21 21:21:41,254 INFO L226 Difference]: Without dead ends: 465 [2024-11-21 21:21:41,259 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-21 21:21:41,261 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 133 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-21 21:21:41,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 170 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-21 21:21:41,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-21 21:21:41,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 459. [2024-11-21 21:21:41,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.556768558951965) internal successors, (713), 458 states have internal predecessors, (713), 0 states have call successors, (0), 0 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-21 21:21:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 713 transitions. [2024-11-21 21:21:41,362 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 713 transitions. Word has length 171 [2024-11-21 21:21:41,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:21:41,363 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 713 transitions. [2024-11-21 21:21:41,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 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-21 21:21:41,363 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 713 transitions. [2024-11-21 21:21:41,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-21 21:21:41,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:21:41,369 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:21:41,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 21:21:41,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:21:41,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:21:41,370 INFO L85 PathProgramCache]: Analyzing trace with hash 48412932, now seen corresponding path program 1 times [2024-11-21 21:21:41,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:21:41,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007015558] [2024-11-21 21:21:41,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:21:41,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:21:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:21:41,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:21:41,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:21:41,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007015558] [2024-11-21 21:21:41,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007015558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:21:41,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:21:41,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:21:41,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589274630] [2024-11-21 21:21:41,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:21:41,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:21:41,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:21:41,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:21:41,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:21:41,807 INFO L87 Difference]: Start difference. First operand 459 states and 713 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 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-21 21:21:42,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:21:42,878 INFO L93 Difference]: Finished difference Result 1343 states and 2102 transitions. [2024-11-21 21:21:42,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:21:42,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 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 179 [2024-11-21 21:21:42,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:21:42,883 INFO L225 Difference]: With dead ends: 1343 [2024-11-21 21:21:42,884 INFO L226 Difference]: Without dead ends: 886 [2024-11-21 21:21:42,885 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-21 21:21:42,886 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:21:42,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 89 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-21 21:21:42,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-11-21 21:21:42,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 868. [2024-11-21 21:21:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 867 states have (on average 1.5340253748558246) internal successors, (1330), 867 states have internal predecessors, (1330), 0 states have call successors, (0), 0 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-21 21:21:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1330 transitions. [2024-11-21 21:21:42,914 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1330 transitions. Word has length 179 [2024-11-21 21:21:42,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:21:42,914 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1330 transitions. [2024-11-21 21:21:42,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 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-21 21:21:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1330 transitions. [2024-11-21 21:21:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-21 21:21:42,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:21:42,919 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:21:42,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 21:21:42,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:21:42,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:21:42,921 INFO L85 PathProgramCache]: Analyzing trace with hash 446591933, now seen corresponding path program 1 times [2024-11-21 21:21:42,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:21:42,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520192675] [2024-11-21 21:21:42,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:21:42,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:21:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:21:43,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:21:43,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:21:43,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520192675] [2024-11-21 21:21:43,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520192675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:21:43,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:21:43,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:21:43,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183129762] [2024-11-21 21:21:43,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:21:43,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:21:43,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:21:43,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:21:43,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:21:43,125 INFO L87 Difference]: Start difference. First operand 868 states and 1330 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 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-21 21:21:43,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:21:43,765 INFO L93 Difference]: Finished difference Result 2573 states and 3946 transitions. [2024-11-21 21:21:43,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:21:43,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 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 180 [2024-11-21 21:21:43,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:21:43,772 INFO L225 Difference]: With dead ends: 2573 [2024-11-21 21:21:43,772 INFO L226 Difference]: Without dead ends: 1707 [2024-11-21 21:21:43,773 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-21 21:21:43,776 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 255 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 21:21:43,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 137 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 21:21:43,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2024-11-21 21:21:43,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1704. [2024-11-21 21:21:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1703 states have (on average 1.4486200822078685) internal successors, (2467), 1703 states have internal predecessors, (2467), 0 states have call successors, (0), 0 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-21 21:21:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2467 transitions. [2024-11-21 21:21:43,813 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2467 transitions. Word has length 180 [2024-11-21 21:21:43,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:21:43,813 INFO L471 AbstractCegarLoop]: Abstraction has 1704 states and 2467 transitions. [2024-11-21 21:21:43,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 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-21 21:21:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2467 transitions. [2024-11-21 21:21:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-21 21:21:43,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:21:43,818 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:21:43,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 21:21:43,818 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:21:43,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:21:43,819 INFO L85 PathProgramCache]: Analyzing trace with hash -620762647, now seen corresponding path program 1 times [2024-11-21 21:21:43,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:21:43,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898077938] [2024-11-21 21:21:43,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:21:43,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:21:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:21:44,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:21:44,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:21:44,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898077938] [2024-11-21 21:21:44,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898077938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:21:44,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:21:44,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:21:44,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137918758] [2024-11-21 21:21:44,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:21:44,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:21:44,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:21:44,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:21:44,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:21:44,111 INFO L87 Difference]: Start difference. First operand 1704 states and 2467 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 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-21 21:21:44,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:21:44,969 INFO L93 Difference]: Finished difference Result 4238 states and 6117 transitions. [2024-11-21 21:21:44,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:21:44,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 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-21 21:21:44,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:21:44,978 INFO L225 Difference]: With dead ends: 4238 [2024-11-21 21:21:44,978 INFO L226 Difference]: Without dead ends: 2536 [2024-11-21 21:21:44,981 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-21 21:21:44,984 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 236 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-21 21:21:44,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 112 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-21 21:21:44,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2024-11-21 21:21:45,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2535. [2024-11-21 21:21:45,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2535 states, 2534 states have (on average 1.4183109707971586) internal successors, (3594), 2534 states have internal predecessors, (3594), 0 states have call successors, (0), 0 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-21 21:21:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 3594 transitions. [2024-11-21 21:21:45,025 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 3594 transitions. Word has length 181 [2024-11-21 21:21:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:21:45,026 INFO L471 AbstractCegarLoop]: Abstraction has 2535 states and 3594 transitions. [2024-11-21 21:21:45,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 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-21 21:21:45,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 3594 transitions. [2024-11-21 21:21:45,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-21 21:21:45,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:21:45,030 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:21:45,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 21:21:45,031 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:21:45,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:21:45,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1529135225, now seen corresponding path program 1 times [2024-11-21 21:21:45,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:21:45,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546182767] [2024-11-21 21:21:45,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:21:45,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:21:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:21:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-21 21:21:45,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:21:45,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546182767] [2024-11-21 21:21:45,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546182767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:21:45,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:21:45,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:21:45,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142935472] [2024-11-21 21:21:45,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:21:45,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:21:45,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:21:45,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:21:45,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:21:45,314 INFO L87 Difference]: Start difference. First operand 2535 states and 3594 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-21 21:21:45,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:21:45,920 INFO L93 Difference]: Finished difference Result 5057 states and 7166 transitions. [2024-11-21 21:21:45,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:21:45,920 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 186 [2024-11-21 21:21:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:21:45,927 INFO L225 Difference]: With dead ends: 5057 [2024-11-21 21:21:45,927 INFO L226 Difference]: Without dead ends: 2524 [2024-11-21 21:21:45,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:21:45,931 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 115 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 21:21:45,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 382 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 21:21:45,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2524 states. [2024-11-21 21:21:45,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2524 to 2523. [2024-11-21 21:21:45,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2523 states, 2522 states have (on average 1.309674861221253) internal successors, (3303), 2522 states have internal predecessors, (3303), 0 states have call successors, (0), 0 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-21 21:21:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 3303 transitions. [2024-11-21 21:21:45,963 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 3303 transitions. Word has length 186 [2024-11-21 21:21:45,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:21:45,964 INFO L471 AbstractCegarLoop]: Abstraction has 2523 states and 3303 transitions. [2024-11-21 21:21:45,964 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-21 21:21:45,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 3303 transitions. [2024-11-21 21:21:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-21 21:21:45,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:21:45,967 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:21:45,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 21:21:45,968 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:21:45,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:21:45,968 INFO L85 PathProgramCache]: Analyzing trace with hash 719185950, now seen corresponding path program 1 times [2024-11-21 21:21:45,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:21:45,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527344338] [2024-11-21 21:21:45,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:21:45,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:21:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:21:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-21 21:21:46,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:21:46,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527344338] [2024-11-21 21:21:46,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527344338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:21:46,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:21:46,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:21:46,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597443200] [2024-11-21 21:21:46,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:21:46,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:21:46,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:21:46,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:21:46,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:21:46,334 INFO L87 Difference]: Start difference. First operand 2523 states and 3303 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 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-21 21:21:47,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:21:47,010 INFO L93 Difference]: Finished difference Result 7480 states and 9794 transitions. [2024-11-21 21:21:47,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:21:47,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 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 188 [2024-11-21 21:21:47,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:21:47,026 INFO L225 Difference]: With dead ends: 7480 [2024-11-21 21:21:47,026 INFO L226 Difference]: Without dead ends: 4959 [2024-11-21 21:21:47,031 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-21 21:21:47,032 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 205 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 21:21:47,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 196 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 21:21:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2024-11-21 21:21:47,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4959. [2024-11-21 21:21:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4959 states, 4958 states have (on average 1.1976603469140783) internal successors, (5938), 4958 states have internal predecessors, (5938), 0 states have call successors, (0), 0 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-21 21:21:47,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4959 states to 4959 states and 5938 transitions. [2024-11-21 21:21:47,096 INFO L78 Accepts]: Start accepts. Automaton has 4959 states and 5938 transitions. Word has length 188 [2024-11-21 21:21:47,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:21:47,097 INFO L471 AbstractCegarLoop]: Abstraction has 4959 states and 5938 transitions. [2024-11-21 21:21:47,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 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-21 21:21:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 4959 states and 5938 transitions. [2024-11-21 21:21:47,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-21 21:21:47,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:21:47,112 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:21:47,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 21:21:47,112 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:21:47,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:21:47,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1988323908, now seen corresponding path program 1 times [2024-11-21 21:21:47,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:21:47,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175667893] [2024-11-21 21:21:47,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:21:47,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:21:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:21:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-21 21:21:47,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:21:47,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175667893] [2024-11-21 21:21:47,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175667893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:21:47,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:21:47,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:21:47,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235419286] [2024-11-21 21:21:47,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:21:47,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:21:47,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:21:47,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:21:47,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:21:47,362 INFO L87 Difference]: Start difference. First operand 4959 states and 5938 transitions. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 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-21 21:21:48,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:21:48,625 INFO L93 Difference]: Finished difference Result 18931 states and 22783 transitions. [2024-11-21 21:21:48,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:21:48,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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 198 [2024-11-21 21:21:48,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:21:48,672 INFO L225 Difference]: With dead ends: 18931 [2024-11-21 21:21:48,672 INFO L226 Difference]: Without dead ends: 13974 [2024-11-21 21:21:48,686 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-21 21:21:48,686 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 561 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:21:48,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 121 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-21 21:21:48,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13974 states. [2024-11-21 21:21:48,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13974 to 13969. [2024-11-21 21:21:48,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13969 states, 13968 states have (on average 1.1935137457044673) internal successors, (16671), 13968 states have internal predecessors, (16671), 0 states have call successors, (0), 0 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-21 21:21:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13969 states to 13969 states and 16671 transitions. [2024-11-21 21:21:48,900 INFO L78 Accepts]: Start accepts. Automaton has 13969 states and 16671 transitions. Word has length 198 [2024-11-21 21:21:48,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:21:48,901 INFO L471 AbstractCegarLoop]: Abstraction has 13969 states and 16671 transitions. [2024-11-21 21:21:48,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 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-21 21:21:48,901 INFO L276 IsEmpty]: Start isEmpty. Operand 13969 states and 16671 transitions. [2024-11-21 21:21:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-21 21:21:48,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:21:48,910 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:21:48,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 21:21:48,910 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:21:48,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:21:48,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2052333172, now seen corresponding path program 1 times [2024-11-21 21:21:48,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:21:48,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712574199] [2024-11-21 21:21:48,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:21:48,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:21:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:21:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-21 21:21:49,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:21:49,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712574199] [2024-11-21 21:21:49,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712574199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:21:49,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:21:49,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:21:49,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282717541] [2024-11-21 21:21:49,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:21:49,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:21:49,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:21:49,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:21:49,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:21:49,101 INFO L87 Difference]: Start difference. First operand 13969 states and 16671 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 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-21 21:21:49,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:21:49,861 INFO L93 Difference]: Finished difference Result 33241 states and 40059 transitions. [2024-11-21 21:21:49,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:21:49,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 209 [2024-11-21 21:21:49,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:21:49,890 INFO L225 Difference]: With dead ends: 33241 [2024-11-21 21:21:49,890 INFO L226 Difference]: Without dead ends: 19274 [2024-11-21 21:21:49,904 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-21 21:21:49,905 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 218 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-21 21:21:49,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 377 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 21:21:49,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19274 states. [2024-11-21 21:21:50,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19274 to 19263. [2024-11-21 21:21:50,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19263 states, 19262 states have (on average 1.1801474405565362) internal successors, (22732), 19262 states have internal predecessors, (22732), 0 states have call successors, (0), 0 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-21 21:21:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19263 states to 19263 states and 22732 transitions. [2024-11-21 21:21:50,109 INFO L78 Accepts]: Start accepts. Automaton has 19263 states and 22732 transitions. Word has length 209 [2024-11-21 21:21:50,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:21:50,109 INFO L471 AbstractCegarLoop]: Abstraction has 19263 states and 22732 transitions. [2024-11-21 21:21:50,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 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-21 21:21:50,110 INFO L276 IsEmpty]: Start isEmpty. Operand 19263 states and 22732 transitions. [2024-11-21 21:21:50,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-21 21:21:50,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:21:50,119 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:21:50,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 21:21:50,120 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:21:50,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:21:50,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1379001516, now seen corresponding path program 1 times [2024-11-21 21:21:50,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:21:50,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220041456] [2024-11-21 21:21:50,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:21:50,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:21:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:21:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-21 21:21:50,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:21:50,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220041456] [2024-11-21 21:21:50,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220041456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:21:50,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:21:50,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:21:50,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794757286] [2024-11-21 21:21:50,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:21:50,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:21:50,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:21:50,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:21:50,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:21:50,335 INFO L87 Difference]: Start difference. First operand 19263 states and 22732 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 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-21 21:21:51,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:21:51,073 INFO L93 Difference]: Finished difference Result 53562 states and 63550 transitions. [2024-11-21 21:21:51,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:21:51,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 213 [2024-11-21 21:21:51,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:21:51,117 INFO L225 Difference]: With dead ends: 53562 [2024-11-21 21:21:51,118 INFO L226 Difference]: Without dead ends: 34301 [2024-11-21 21:21:51,140 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-21 21:21:51,141 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 233 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 21:21:51,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 371 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 21:21:51,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34301 states. [2024-11-21 21:21:51,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34301 to 34292. [2024-11-21 21:21:51,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34292 states, 34291 states have (on average 1.1556385057303666) internal successors, (39628), 34291 states have internal predecessors, (39628), 0 states have call successors, (0), 0 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-21 21:21:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34292 states to 34292 states and 39628 transitions. [2024-11-21 21:21:51,595 INFO L78 Accepts]: Start accepts. Automaton has 34292 states and 39628 transitions. Word has length 213 [2024-11-21 21:21:51,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:21:51,596 INFO L471 AbstractCegarLoop]: Abstraction has 34292 states and 39628 transitions. [2024-11-21 21:21:51,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 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-21 21:21:51,596 INFO L276 IsEmpty]: Start isEmpty. Operand 34292 states and 39628 transitions. [2024-11-21 21:21:51,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-21 21:21:51,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:21:51,609 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:21:51,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 21:21:51,609 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:21:51,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:21:51,610 INFO L85 PathProgramCache]: Analyzing trace with hash 78149368, now seen corresponding path program 1 times [2024-11-21 21:21:51,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:21:51,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85945576] [2024-11-21 21:21:51,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:21:51,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:21:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:21:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 50 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-21 21:21:52,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:21:52,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85945576] [2024-11-21 21:21:52,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85945576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:21:52,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931878913] [2024-11-21 21:21:52,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:21:52,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:21:52,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:21:52,102 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-21 21:21:52,103 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-21 21:21:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:21:52,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-21 21:21:52,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:21:52,364 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-21 21:21:52,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 21:21:52,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931878913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:21:52,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 21:21:52,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-21 21:21:52,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757941196] [2024-11-21 21:21:52,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:21:52,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:21:52,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:21:52,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:21:52,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:21:52,367 INFO L87 Difference]: Start difference. First operand 34292 states and 39628 transitions. Second operand has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 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-21 21:21:53,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:21:53,538 INFO L93 Difference]: Finished difference Result 111131 states and 129028 transitions. [2024-11-21 21:21:53,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:21:53,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 216 [2024-11-21 21:21:53,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:21:53,636 INFO L225 Difference]: With dead ends: 111131 [2024-11-21 21:21:53,637 INFO L226 Difference]: Without dead ends: 76841 [2024-11-21 21:21:53,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:21:53,672 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 556 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-21 21:21:53,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 392 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-21 21:21:53,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76841 states. [2024-11-21 21:21:54,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76841 to 76833. [2024-11-21 21:21:54,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76833 states, 76832 states have (on average 1.1608834860474802) internal successors, (89193), 76832 states have internal predecessors, (89193), 0 states have call successors, (0), 0 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-21 21:21:54,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76833 states to 76833 states and 89193 transitions. [2024-11-21 21:21:54,830 INFO L78 Accepts]: Start accepts. Automaton has 76833 states and 89193 transitions. Word has length 216 [2024-11-21 21:21:54,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:21:54,830 INFO L471 AbstractCegarLoop]: Abstraction has 76833 states and 89193 transitions. [2024-11-21 21:21:54,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 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-21 21:21:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 76833 states and 89193 transitions. [2024-11-21 21:21:54,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-21 21:21:54,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:21:54,845 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:21:54,856 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-21 21:21:55,046 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,SelfDestructingSolverStorable9 [2024-11-21 21:21:55,047 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:21:55,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:21:55,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1740772773, now seen corresponding path program 1 times [2024-11-21 21:21:55,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:21:55,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693198169] [2024-11-21 21:21:55,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:21:55,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:21:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:21:55,614 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 53 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-21 21:21:55,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:21:55,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693198169] [2024-11-21 21:21:55,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693198169] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:21:55,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702138779] [2024-11-21 21:21:55,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:21:55,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:21:55,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:21:55,619 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-21 21:21:55,622 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-21 21:21:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:21:55,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-21 21:21:55,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:21:55,845 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-21 21:21:55,845 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 21:21:55,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702138779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:21:55,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 21:21:55,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-21 21:21:55,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172972091] [2024-11-21 21:21:55,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:21:55,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:21:55,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:21:55,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:21:55,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:21:55,848 INFO L87 Difference]: Start difference. First operand 76833 states and 89193 transitions. Second operand has 4 states, 4 states have (on average 52.5) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 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-21 21:21:57,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:21:57,465 INFO L93 Difference]: Finished difference Result 222380 states and 258397 transitions. [2024-11-21 21:21:57,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:21:57,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 219 [2024-11-21 21:21:57,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:21:57,774 INFO L225 Difference]: With dead ends: 222380 [2024-11-21 21:21:57,774 INFO L226 Difference]: Without dead ends: 145549 [2024-11-21 21:21:57,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:21:57,854 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 590 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-21 21:21:57,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 551 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-21 21:21:58,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145549 states. [2024-11-21 21:21:59,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145549 to 145059. [2024-11-21 21:21:59,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145059 states, 145058 states have (on average 1.158571054336886) internal successors, (168060), 145058 states have internal predecessors, (168060), 0 states have call successors, (0), 0 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-21 21:22:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145059 states to 145059 states and 168060 transitions. [2024-11-21 21:22:00,042 INFO L78 Accepts]: Start accepts. Automaton has 145059 states and 168060 transitions. Word has length 219 [2024-11-21 21:22:00,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:22:00,042 INFO L471 AbstractCegarLoop]: Abstraction has 145059 states and 168060 transitions. [2024-11-21 21:22:00,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 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-21 21:22:00,043 INFO L276 IsEmpty]: Start isEmpty. Operand 145059 states and 168060 transitions. [2024-11-21 21:22:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-21 21:22:00,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:22:00,056 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:22:00,346 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,SelfDestructingSolverStorable10 [2024-11-21 21:22:00,347 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:22:00,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:22:00,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1978538129, now seen corresponding path program 1 times [2024-11-21 21:22:00,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:22:00,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800074133] [2024-11-21 21:22:00,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:22:00,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:22:00,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-21 21:22:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:22:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-21 21:22:00,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:22:00,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800074133] [2024-11-21 21:22:00,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800074133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:22:00,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:22:00,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:22:00,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054105382] [2024-11-21 21:22:00,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:22:00,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:22:00,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:22:00,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:22:00,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:22:00,588 INFO L87 Difference]: Start difference. First operand 145059 states and 168060 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:22:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:22:02,411 INFO L93 Difference]: Finished difference Result 317144 states and 368158 transitions. [2024-11-21 21:22:02,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:22:02,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 248 [2024-11-21 21:22:02,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:22:02,659 INFO L225 Difference]: With dead ends: 317144 [2024-11-21 21:22:02,660 INFO L226 Difference]: Without dead ends: 172087 [2024-11-21 21:22:02,721 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-21 21:22:02,721 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 159 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-21 21:22:02,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 190 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-21 21:22:02,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172087 states. [2024-11-21 21:22:04,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172087 to 172069. [2024-11-21 21:22:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172069 states, 172068 states have (on average 1.1409849594346422) internal successors, (196327), 172068 states have internal predecessors, (196327), 0 states have call successors, (0), 0 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-21 21:22:05,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172069 states to 172069 states and 196327 transitions. [2024-11-21 21:22:05,469 INFO L78 Accepts]: Start accepts. Automaton has 172069 states and 196327 transitions. Word has length 248 [2024-11-21 21:22:05,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:22:05,473 INFO L471 AbstractCegarLoop]: Abstraction has 172069 states and 196327 transitions. [2024-11-21 21:22:05,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:22:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand 172069 states and 196327 transitions. [2024-11-21 21:22:05,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-21 21:22:05,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:22:05,488 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:22:05,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-21 21:22:05,489 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:22:05,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:22:05,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1502145134, now seen corresponding path program 1 times [2024-11-21 21:22:05,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:22:05,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483288699] [2024-11-21 21:22:05,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:22:05,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:22:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:22:05,726 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-21 21:22:05,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:22:05,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483288699] [2024-11-21 21:22:05,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483288699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:22:05,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:22:05,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:22:05,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851736556] [2024-11-21 21:22:05,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:22:05,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:22:05,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:22:05,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:22:05,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:22:05,729 INFO L87 Difference]: Start difference. First operand 172069 states and 196327 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 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-21 21:22:07,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:22:07,378 INFO L93 Difference]: Finished difference Result 353704 states and 403457 transitions. [2024-11-21 21:22:07,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:22:07,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 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 251 [2024-11-21 21:22:07,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:22:07,623 INFO L225 Difference]: With dead ends: 353704 [2024-11-21 21:22:07,623 INFO L226 Difference]: Without dead ends: 181637 [2024-11-21 21:22:07,740 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-21 21:22:07,741 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 189 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 21:22:07,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 386 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 21:22:07,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181637 states. [2024-11-21 21:22:09,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181637 to 181618. [2024-11-21 21:22:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181618 states, 181617 states have (on average 1.1369750629071067) internal successors, (206494), 181617 states have internal predecessors, (206494), 0 states have call successors, (0), 0 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-21 21:22:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181618 states to 181618 states and 206494 transitions. [2024-11-21 21:22:10,691 INFO L78 Accepts]: Start accepts. Automaton has 181618 states and 206494 transitions. Word has length 251 [2024-11-21 21:22:10,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:22:10,695 INFO L471 AbstractCegarLoop]: Abstraction has 181618 states and 206494 transitions. [2024-11-21 21:22:10,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 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-21 21:22:10,696 INFO L276 IsEmpty]: Start isEmpty. Operand 181618 states and 206494 transitions. [2024-11-21 21:22:10,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-21 21:22:10,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:22:10,726 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:22:10,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-21 21:22:10,726 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:22:10,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:22:10,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1028557796, now seen corresponding path program 1 times [2024-11-21 21:22:10,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:22:10,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872707134] [2024-11-21 21:22:10,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:22:10,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:22:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:22:10,921 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-21 21:22:10,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:22:10,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872707134] [2024-11-21 21:22:10,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872707134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:22:10,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:22:10,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:22:10,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622646259] [2024-11-21 21:22:10,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:22:10,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:22:10,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:22:10,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:22:10,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:22:10,924 INFO L87 Difference]: Start difference. First operand 181618 states and 206494 transitions. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 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-21 21:22:13,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:22:13,419 INFO L93 Difference]: Finished difference Result 535466 states and 609423 transitions. [2024-11-21 21:22:13,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:22:13,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 253 [2024-11-21 21:22:13,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:22:14,492 INFO L225 Difference]: With dead ends: 535466 [2024-11-21 21:22:14,493 INFO L226 Difference]: Without dead ends: 353850 [2024-11-21 21:22:14,577 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-21 21:22:14,577 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 796 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-21 21:22:14,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 388 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 21:22:14,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353850 states. [2024-11-21 21:22:18,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353850 to 353214. [2024-11-21 21:22:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353214 states, 353213 states have (on average 1.1378743137993221) internal successors, (401912), 353213 states have internal predecessors, (401912), 0 states have call successors, (0), 0 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-21 21:22:20,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353214 states to 353214 states and 401912 transitions. [2024-11-21 21:22:20,208 INFO L78 Accepts]: Start accepts. Automaton has 353214 states and 401912 transitions. Word has length 253 [2024-11-21 21:22:20,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:22:20,209 INFO L471 AbstractCegarLoop]: Abstraction has 353214 states and 401912 transitions. [2024-11-21 21:22:20,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 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-21 21:22:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand 353214 states and 401912 transitions. [2024-11-21 21:22:20,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-21 21:22:20,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:22:20,221 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:22:20,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-21 21:22:20,221 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:22:20,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:22:20,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1402661518, now seen corresponding path program 1 times [2024-11-21 21:22:20,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:22:20,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15351724] [2024-11-21 21:22:20,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:22:20,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:22:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:22:20,455 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-21 21:22:20,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:22:20,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15351724] [2024-11-21 21:22:20,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15351724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:22:20,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:22:20,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:22:20,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781459444] [2024-11-21 21:22:20,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:22:20,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:22:20,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:22:20,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:22:20,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:22:20,458 INFO L87 Difference]: Start difference. First operand 353214 states and 401912 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 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-21 21:22:23,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:22:23,923 INFO L93 Difference]: Finished difference Result 719360 states and 819336 transitions. [2024-11-21 21:22:23,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:22:23,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 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 273 [2024-11-21 21:22:23,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:22:24,586 INFO L225 Difference]: With dead ends: 719360 [2024-11-21 21:22:24,590 INFO L226 Difference]: Without dead ends: 366148 [2024-11-21 21:22:24,781 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-21 21:22:24,782 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 175 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 21:22:24,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 389 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 21:22:25,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366148 states. [2024-11-21 21:22:29,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366148 to 361930. [2024-11-21 21:22:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361930 states, 361929 states have (on average 1.1238861765705428) internal successors, (406767), 361929 states have internal predecessors, (406767), 0 states have call successors, (0), 0 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-21 21:22:30,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361930 states to 361930 states and 406767 transitions. [2024-11-21 21:22:30,538 INFO L78 Accepts]: Start accepts. Automaton has 361930 states and 406767 transitions. Word has length 273 [2024-11-21 21:22:30,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:22:30,538 INFO L471 AbstractCegarLoop]: Abstraction has 361930 states and 406767 transitions. [2024-11-21 21:22:30,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 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-21 21:22:30,538 INFO L276 IsEmpty]: Start isEmpty. Operand 361930 states and 406767 transitions. [2024-11-21 21:22:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2024-11-21 21:22:30,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:22:30,551 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:22:30,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-21 21:22:30,551 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:22:30,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:22:30,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1033441581, now seen corresponding path program 1 times [2024-11-21 21:22:30,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:22:30,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388954774] [2024-11-21 21:22:30,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:22:30,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:22:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:22:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-21 21:22:30,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:22:30,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388954774] [2024-11-21 21:22:30,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388954774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:22:30,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:22:30,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:22:30,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160988878] [2024-11-21 21:22:30,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:22:30,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:22:30,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:22:30,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:22:30,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:22:30,773 INFO L87 Difference]: Start difference. First operand 361930 states and 406767 transitions. Second operand has 4 states, 4 states have (on average 64.5) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)