./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label54.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label54.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 edb6f856db72a43ad08c83ff0e1ee56d288f58300ccdf5a7b1b400a926b63cbe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:23:53,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:23:53,637 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:23:53,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:23:53,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:23:53,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:23:53,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:23:53,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:23:53,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:23:53,675 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:23:53,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:23:53,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:23:53,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:23:53,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:23:53,677 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:23:53,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:23:53,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:23:53,678 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:23:53,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:23:53,682 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:23:53,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:23:53,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:23:53,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:23:53,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:23:53,683 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:23:53,684 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:23:53,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:23:53,684 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:23:53,684 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:23:53,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:23:53,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:23:53,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:23:53,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:23:53,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:23:53,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:23:53,689 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:23:53,690 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:23:53,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:23:53,690 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:23:53,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:23:53,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:23:53,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:23:53,692 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 -> edb6f856db72a43ad08c83ff0e1ee56d288f58300ccdf5a7b1b400a926b63cbe [2024-11-09 19:23:53,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:23:53,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:23:53,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:23:53,964 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:23:53,969 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:23:53,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label54.c [2024-11-09 19:23:55,412 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:23:55,740 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:23:55,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label54.c [2024-11-09 19:23:55,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45c677452/2a440daeee1843a58a50117acd15be9e/FLAGa1869ca2f [2024-11-09 19:23:55,967 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45c677452/2a440daeee1843a58a50117acd15be9e [2024-11-09 19:23:55,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:23:55,970 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:23:55,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:23:55,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:23:55,977 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:23:55,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:23:55" (1/1) ... [2024-11-09 19:23:55,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f53776a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:55, skipping insertion in model container [2024-11-09 19:23:55,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:23:55" (1/1) ... [2024-11-09 19:23:56,035 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:23:56,277 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label54.c[5423,5436] [2024-11-09 19:23:56,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:23:56,541 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:23:56,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label54.c[5423,5436] [2024-11-09 19:23:56,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:23:56,708 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:23:56,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:56 WrapperNode [2024-11-09 19:23:56,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:23:56,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:23:56,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:23:56,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:23:56,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:56" (1/1) ... [2024-11-09 19:23:56,744 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:56" (1/1) ... [2024-11-09 19:23:56,850 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2024-11-09 19:23:56,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:23:56,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:23:56,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:23:56,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:23:56,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:56" (1/1) ... [2024-11-09 19:23:56,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:56" (1/1) ... [2024-11-09 19:23:56,886 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:56" (1/1) ... [2024-11-09 19:23:56,929 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 19:23:56,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:56" (1/1) ... [2024-11-09 19:23:56,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:56" (1/1) ... [2024-11-09 19:23:56,972 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:56" (1/1) ... [2024-11-09 19:23:56,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:56" (1/1) ... [2024-11-09 19:23:56,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:56" (1/1) ... [2024-11-09 19:23:56,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:56" (1/1) ... [2024-11-09 19:23:57,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:23:57,008 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:23:57,008 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:23:57,008 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:23:57,009 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:56" (1/1) ... [2024-11-09 19:23:57,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:23:57,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:23:57,045 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 19:23:57,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 19:23:57,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:23:57,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:23:57,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:23:57,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:23:57,164 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:23:57,166 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:23:59,005 INFO L? ?]: Removed 248 outVars from TransFormulas that were not future-live. [2024-11-09 19:23:59,006 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:23:59,027 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:23:59,028 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:23:59,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:23:59 BoogieIcfgContainer [2024-11-09 19:23:59,028 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:23:59,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:23:59,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:23:59,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:23:59,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:23:55" (1/3) ... [2024-11-09 19:23:59,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788528b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:23:59, skipping insertion in model container [2024-11-09 19:23:59,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:56" (2/3) ... [2024-11-09 19:23:59,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788528b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:23:59, skipping insertion in model container [2024-11-09 19:23:59,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:23:59" (3/3) ... [2024-11-09 19:23:59,036 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label54.c [2024-11-09 19:23:59,052 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:23:59,053 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:23:59,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:23:59,141 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;@305a82a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:23:59,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:23:59,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 286 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 285 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:59,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 19:23:59,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:59,160 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] [2024-11-09 19:23:59,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:59,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:59,165 INFO L85 PathProgramCache]: Analyzing trace with hash -681336863, now seen corresponding path program 1 times [2024-11-09 19:23:59,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:59,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114110707] [2024-11-09 19:23:59,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:59,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:59,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:23:59,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:59,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114110707] [2024-11-09 19:23:59,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114110707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:59,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:59,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:23:59,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176138659] [2024-11-09 19:23:59,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:59,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:59,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:59,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:59,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:59,618 INFO L87 Difference]: Start difference. First operand has 286 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 285 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:00,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:00,969 INFO L93 Difference]: Finished difference Result 782 states and 1726 transitions. [2024-11-09 19:24:00,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:24:00,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-09 19:24:00,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:00,984 INFO L225 Difference]: With dead ends: 782 [2024-11-09 19:24:00,984 INFO L226 Difference]: Without dead ends: 416 [2024-11-09 19:24:00,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:00,990 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 309 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:00,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 200 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 19:24:01,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-09 19:24:01,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 414. [2024-11-09 19:24:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 2.0314769975786926) internal successors, (839), 413 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 839 transitions. [2024-11-09 19:24:01,060 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 839 transitions. Word has length 39 [2024-11-09 19:24:01,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:01,061 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 839 transitions. [2024-11-09 19:24:01,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:01,061 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 839 transitions. [2024-11-09 19:24:01,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 19:24:01,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:01,066 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:24:01,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:24:01,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:01,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:01,068 INFO L85 PathProgramCache]: Analyzing trace with hash -630673096, now seen corresponding path program 1 times [2024-11-09 19:24:01,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:01,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404638184] [2024-11-09 19:24:01,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:01,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:01,338 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:24:01,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:01,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404638184] [2024-11-09 19:24:01,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404638184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:01,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:01,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:24:01,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952990133] [2024-11-09 19:24:01,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:01,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:01,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:01,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:01,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:01,347 INFO L87 Difference]: Start difference. First operand 414 states and 839 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:02,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:02,279 INFO L93 Difference]: Finished difference Result 1217 states and 2487 transitions. [2024-11-09 19:24:02,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:24:02,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2024-11-09 19:24:02,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:02,284 INFO L225 Difference]: With dead ends: 1217 [2024-11-09 19:24:02,284 INFO L226 Difference]: Without dead ends: 805 [2024-11-09 19:24:02,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:02,287 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 264 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:02,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 124 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:24:02,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-09 19:24:02,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 792. [2024-11-09 19:24:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 791 states have (on average 1.9848293299620734) internal successors, (1570), 791 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:02,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1570 transitions. [2024-11-09 19:24:02,335 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1570 transitions. Word has length 108 [2024-11-09 19:24:02,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:02,336 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1570 transitions. [2024-11-09 19:24:02,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:02,336 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1570 transitions. [2024-11-09 19:24:02,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 19:24:02,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:02,339 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:24:02,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:24:02,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:02,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:02,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1224784372, now seen corresponding path program 1 times [2024-11-09 19:24:02,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:02,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37218385] [2024-11-09 19:24:02,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:02,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:02,883 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:24:02,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:02,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37218385] [2024-11-09 19:24:02,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37218385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:02,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:02,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:02,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053436643] [2024-11-09 19:24:02,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:02,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:24:02,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:02,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:24:02,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:02,890 INFO L87 Difference]: Start difference. First operand 792 states and 1570 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:04,387 INFO L93 Difference]: Finished difference Result 2330 states and 4536 transitions. [2024-11-09 19:24:04,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:24:04,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2024-11-09 19:24:04,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:04,394 INFO L225 Difference]: With dead ends: 2330 [2024-11-09 19:24:04,394 INFO L226 Difference]: Without dead ends: 1540 [2024-11-09 19:24:04,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:24:04,397 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 845 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:04,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 225 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 19:24:04,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2024-11-09 19:24:04,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1537. [2024-11-09 19:24:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1536 states have (on average 1.869140625) internal successors, (2871), 1536 states have internal predecessors, (2871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:04,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 2871 transitions. [2024-11-09 19:24:04,439 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 2871 transitions. Word has length 109 [2024-11-09 19:24:04,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:04,439 INFO L471 AbstractCegarLoop]: Abstraction has 1537 states and 2871 transitions. [2024-11-09 19:24:04,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:04,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 2871 transitions. [2024-11-09 19:24:04,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 19:24:04,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:04,447 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:24:04,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:24:04,449 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:04,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:04,450 INFO L85 PathProgramCache]: Analyzing trace with hash -988073914, now seen corresponding path program 1 times [2024-11-09 19:24:04,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:04,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35995307] [2024-11-09 19:24:04,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:04,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:24:04,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:04,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35995307] [2024-11-09 19:24:04,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35995307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:04,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:04,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:04,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470414597] [2024-11-09 19:24:04,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:04,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:04,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:04,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:04,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:04,653 INFO L87 Difference]: Start difference. First operand 1537 states and 2871 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:05,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:05,658 INFO L93 Difference]: Finished difference Result 3643 states and 6889 transitions. [2024-11-09 19:24:05,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:24:05,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2024-11-09 19:24:05,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:05,668 INFO L225 Difference]: With dead ends: 3643 [2024-11-09 19:24:05,669 INFO L226 Difference]: Without dead ends: 2293 [2024-11-09 19:24:05,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:05,673 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 288 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:05,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 459 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:24:05,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2024-11-09 19:24:05,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2097. [2024-11-09 19:24:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2097 states, 2096 states have (on average 1.8530534351145038) internal successors, (3884), 2096 states have internal predecessors, (3884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:05,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 3884 transitions. [2024-11-09 19:24:05,717 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 3884 transitions. Word has length 152 [2024-11-09 19:24:05,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:05,719 INFO L471 AbstractCegarLoop]: Abstraction has 2097 states and 3884 transitions. [2024-11-09 19:24:05,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:05,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 3884 transitions. [2024-11-09 19:24:05,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-09 19:24:05,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:05,726 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:24:05,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:24:05,727 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:05,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:05,727 INFO L85 PathProgramCache]: Analyzing trace with hash 598250474, now seen corresponding path program 1 times [2024-11-09 19:24:05,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:05,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342135003] [2024-11-09 19:24:05,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:05,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-09 19:24:05,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:05,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342135003] [2024-11-09 19:24:05,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342135003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:05,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:05,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:24:05,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298159212] [2024-11-09 19:24:05,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:05,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:05,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:05,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:06,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:06,000 INFO L87 Difference]: Start difference. First operand 2097 states and 3884 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:06,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:06,934 INFO L93 Difference]: Finished difference Result 4939 states and 9282 transitions. [2024-11-09 19:24:06,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:24:06,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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 183 [2024-11-09 19:24:06,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:06,945 INFO L225 Difference]: With dead ends: 4939 [2024-11-09 19:24:06,945 INFO L226 Difference]: Without dead ends: 2844 [2024-11-09 19:24:06,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:06,949 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 196 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:06,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 161 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:24:06,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2024-11-09 19:24:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2844. [2024-11-09 19:24:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2844 states, 2843 states have (on average 1.8371438621174816) internal successors, (5223), 2843 states have internal predecessors, (5223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:07,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 5223 transitions. [2024-11-09 19:24:07,000 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 5223 transitions. Word has length 183 [2024-11-09 19:24:07,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:07,002 INFO L471 AbstractCegarLoop]: Abstraction has 2844 states and 5223 transitions. [2024-11-09 19:24:07,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:07,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 5223 transitions. [2024-11-09 19:24:07,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-09 19:24:07,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:07,007 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:24:07,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:24:07,008 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:07,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:07,008 INFO L85 PathProgramCache]: Analyzing trace with hash -829816167, now seen corresponding path program 1 times [2024-11-09 19:24:07,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:07,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117471244] [2024-11-09 19:24:07,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:07,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:07,301 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 19:24:07,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:07,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117471244] [2024-11-09 19:24:07,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117471244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:07,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:07,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:07,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169321069] [2024-11-09 19:24:07,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:07,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:07,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:07,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:07,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:07,305 INFO L87 Difference]: Start difference. First operand 2844 states and 5223 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:08,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:08,288 INFO L93 Difference]: Finished difference Result 7375 states and 13654 transitions. [2024-11-09 19:24:08,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:24:08,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 222 [2024-11-09 19:24:08,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:08,305 INFO L225 Difference]: With dead ends: 7375 [2024-11-09 19:24:08,305 INFO L226 Difference]: Without dead ends: 4533 [2024-11-09 19:24:08,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:08,309 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 303 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:08,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 471 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:24:08,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2024-11-09 19:24:08,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 4533. [2024-11-09 19:24:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4533 states, 4532 states have (on average 1.8312003530450132) internal successors, (8299), 4532 states have internal predecessors, (8299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:08,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4533 states to 4533 states and 8299 transitions. [2024-11-09 19:24:08,390 INFO L78 Accepts]: Start accepts. Automaton has 4533 states and 8299 transitions. Word has length 222 [2024-11-09 19:24:08,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:08,391 INFO L471 AbstractCegarLoop]: Abstraction has 4533 states and 8299 transitions. [2024-11-09 19:24:08,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:08,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4533 states and 8299 transitions. [2024-11-09 19:24:08,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-09 19:24:08,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:08,398 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:24:08,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:24:08,398 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:08,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:08,399 INFO L85 PathProgramCache]: Analyzing trace with hash 244563897, now seen corresponding path program 1 times [2024-11-09 19:24:08,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:08,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313589517] [2024-11-09 19:24:08,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:08,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:08,613 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 19:24:08,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:08,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313589517] [2024-11-09 19:24:08,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313589517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:08,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:08,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:08,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781649115] [2024-11-09 19:24:08,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:08,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:08,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:08,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:08,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:08,617 INFO L87 Difference]: Start difference. First operand 4533 states and 8299 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:09,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:09,525 INFO L93 Difference]: Finished difference Result 10188 states and 18791 transitions. [2024-11-09 19:24:09,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:24:09,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 223 [2024-11-09 19:24:09,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:09,547 INFO L225 Difference]: With dead ends: 10188 [2024-11-09 19:24:09,547 INFO L226 Difference]: Without dead ends: 5657 [2024-11-09 19:24:09,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:09,553 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 279 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:09,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 511 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:24:09,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5657 states. [2024-11-09 19:24:09,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5657 to 5643. [2024-11-09 19:24:09,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5643 states, 5642 states have (on average 1.8144275079758951) internal successors, (10237), 5642 states have internal predecessors, (10237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:09,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5643 states to 5643 states and 10237 transitions. [2024-11-09 19:24:09,655 INFO L78 Accepts]: Start accepts. Automaton has 5643 states and 10237 transitions. Word has length 223 [2024-11-09 19:24:09,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:09,656 INFO L471 AbstractCegarLoop]: Abstraction has 5643 states and 10237 transitions. [2024-11-09 19:24:09,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:09,657 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 10237 transitions. [2024-11-09 19:24:09,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-09 19:24:09,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:09,660 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:24:09,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:24:09,660 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:09,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:09,661 INFO L85 PathProgramCache]: Analyzing trace with hash 111908213, now seen corresponding path program 1 times [2024-11-09 19:24:09,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:09,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721470405] [2024-11-09 19:24:09,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:09,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:09,990 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-09 19:24:09,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:09,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721470405] [2024-11-09 19:24:09,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721470405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:09,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:09,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:09,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084041969] [2024-11-09 19:24:09,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:09,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:09,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:09,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:09,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:09,994 INFO L87 Difference]: Start difference. First operand 5643 states and 10237 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:10,988 INFO L93 Difference]: Finished difference Result 12420 states and 22581 transitions. [2024-11-09 19:24:10,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:24:10,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 243 [2024-11-09 19:24:10,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:11,025 INFO L225 Difference]: With dead ends: 12420 [2024-11-09 19:24:11,027 INFO L226 Difference]: Without dead ends: 6779 [2024-11-09 19:24:11,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:11,035 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 284 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:11,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 212 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:24:11,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6779 states. [2024-11-09 19:24:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6779 to 6568. [2024-11-09 19:24:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6568 states, 6567 states have (on average 1.8149840109639104) internal successors, (11919), 6567 states have internal predecessors, (11919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6568 states to 6568 states and 11919 transitions. [2024-11-09 19:24:11,159 INFO L78 Accepts]: Start accepts. Automaton has 6568 states and 11919 transitions. Word has length 243 [2024-11-09 19:24:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:11,160 INFO L471 AbstractCegarLoop]: Abstraction has 6568 states and 11919 transitions. [2024-11-09 19:24:11,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 6568 states and 11919 transitions. [2024-11-09 19:24:11,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-09 19:24:11,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:11,164 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:24:11,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:24:11,165 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:11,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:11,165 INFO L85 PathProgramCache]: Analyzing trace with hash -333001873, now seen corresponding path program 1 times [2024-11-09 19:24:11,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:11,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118193367] [2024-11-09 19:24:11,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:11,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:11,460 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-09 19:24:11,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:11,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118193367] [2024-11-09 19:24:11,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118193367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:11,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:11,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:11,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756023447] [2024-11-09 19:24:11,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:11,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:11,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:11,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:11,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:11,462 INFO L87 Difference]: Start difference. First operand 6568 states and 11919 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:12,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:12,468 INFO L93 Difference]: Finished difference Result 13142 states and 23853 transitions. [2024-11-09 19:24:12,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:24:12,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 250 [2024-11-09 19:24:12,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:12,483 INFO L225 Difference]: With dead ends: 13142 [2024-11-09 19:24:12,483 INFO L226 Difference]: Without dead ends: 6576 [2024-11-09 19:24:12,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:12,490 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 283 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:12,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 502 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:24:12,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6576 states. [2024-11-09 19:24:12,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6576 to 6382. [2024-11-09 19:24:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6382 states, 6381 states have (on average 1.7896881366556967) internal successors, (11420), 6381 states have internal predecessors, (11420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6382 states to 6382 states and 11420 transitions. [2024-11-09 19:24:12,629 INFO L78 Accepts]: Start accepts. Automaton has 6382 states and 11420 transitions. Word has length 250 [2024-11-09 19:24:12,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:12,629 INFO L471 AbstractCegarLoop]: Abstraction has 6382 states and 11420 transitions. [2024-11-09 19:24:12,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:12,630 INFO L276 IsEmpty]: Start isEmpty. Operand 6382 states and 11420 transitions. [2024-11-09 19:24:12,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-09 19:24:12,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:12,634 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:24:12,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:24:12,634 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:12,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:12,635 INFO L85 PathProgramCache]: Analyzing trace with hash 89417514, now seen corresponding path program 1 times [2024-11-09 19:24:12,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:12,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437760772] [2024-11-09 19:24:12,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:12,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:24:12,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:12,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437760772] [2024-11-09 19:24:12,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437760772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:12,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:12,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:12,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862733050] [2024-11-09 19:24:12,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:12,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:12,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:12,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:12,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:12,854 INFO L87 Difference]: Start difference. First operand 6382 states and 11420 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:13,854 INFO L93 Difference]: Finished difference Result 17072 states and 30633 transitions. [2024-11-09 19:24:13,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:24:13,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2024-11-09 19:24:13,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:13,876 INFO L225 Difference]: With dead ends: 17072 [2024-11-09 19:24:13,876 INFO L226 Difference]: Without dead ends: 10692 [2024-11-09 19:24:13,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:13,885 INFO L432 NwaCegarLoop]: 465 mSDtfsCounter, 261 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:13,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 499 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:24:13,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10692 states. [2024-11-09 19:24:13,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10692 to 10688. [2024-11-09 19:24:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10688 states, 10687 states have (on average 1.7842238233367642) internal successors, (19068), 10687 states have internal predecessors, (19068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10688 states to 10688 states and 19068 transitions. [2024-11-09 19:24:14,032 INFO L78 Accepts]: Start accepts. Automaton has 10688 states and 19068 transitions. Word has length 259 [2024-11-09 19:24:14,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:14,033 INFO L471 AbstractCegarLoop]: Abstraction has 10688 states and 19068 transitions. [2024-11-09 19:24:14,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:14,033 INFO L276 IsEmpty]: Start isEmpty. Operand 10688 states and 19068 transitions. [2024-11-09 19:24:14,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-09 19:24:14,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:14,039 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:24:14,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:24:14,039 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:14,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:14,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1250027242, now seen corresponding path program 1 times [2024-11-09 19:24:14,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:14,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638026802] [2024-11-09 19:24:14,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:14,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:14,352 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-09 19:24:14,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:14,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638026802] [2024-11-09 19:24:14,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638026802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:14,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:14,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:14,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320198052] [2024-11-09 19:24:14,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:14,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:14,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:14,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:14,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:14,356 INFO L87 Difference]: Start difference. First operand 10688 states and 19068 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:15,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:15,309 INFO L93 Difference]: Finished difference Result 22305 states and 39964 transitions. [2024-11-09 19:24:15,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:24:15,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 273 [2024-11-09 19:24:15,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:15,333 INFO L225 Difference]: With dead ends: 22305 [2024-11-09 19:24:15,333 INFO L226 Difference]: Without dead ends: 11619 [2024-11-09 19:24:15,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:15,346 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 306 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:15,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 159 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:24:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11619 states. [2024-11-09 19:24:15,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11619 to 10688. [2024-11-09 19:24:15,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10688 states, 10687 states have (on average 1.7842238233367642) internal successors, (19068), 10687 states have internal predecessors, (19068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:15,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10688 states to 10688 states and 19068 transitions. [2024-11-09 19:24:15,501 INFO L78 Accepts]: Start accepts. Automaton has 10688 states and 19068 transitions. Word has length 273 [2024-11-09 19:24:15,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:15,501 INFO L471 AbstractCegarLoop]: Abstraction has 10688 states and 19068 transitions. [2024-11-09 19:24:15,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:15,502 INFO L276 IsEmpty]: Start isEmpty. Operand 10688 states and 19068 transitions. [2024-11-09 19:24:15,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-11-09 19:24:15,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:15,507 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:24:15,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:24:15,507 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:15,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:15,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1744037921, now seen corresponding path program 1 times [2024-11-09 19:24:15,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:15,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662661689] [2024-11-09 19:24:15,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:15,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 19:24:15,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:15,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662661689] [2024-11-09 19:24:15,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662661689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:15,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:15,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:15,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826280337] [2024-11-09 19:24:15,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:15,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:15,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:15,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:15,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:15,765 INFO L87 Difference]: Start difference. First operand 10688 states and 19068 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:16,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:16,680 INFO L93 Difference]: Finished difference Result 25265 states and 45370 transitions. [2024-11-09 19:24:16,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:24:16,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 276 [2024-11-09 19:24:16,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:16,709 INFO L225 Difference]: With dead ends: 25265 [2024-11-09 19:24:16,710 INFO L226 Difference]: Without dead ends: 14579 [2024-11-09 19:24:16,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:16,724 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 305 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:16,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 107 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:24:16,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14579 states. [2024-11-09 19:24:16,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14579 to 14573. [2024-11-09 19:24:16,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14573 states, 14572 states have (on average 1.7939884710403513) internal successors, (26142), 14572 states have internal predecessors, (26142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14573 states to 14573 states and 26142 transitions. [2024-11-09 19:24:16,977 INFO L78 Accepts]: Start accepts. Automaton has 14573 states and 26142 transitions. Word has length 276 [2024-11-09 19:24:16,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:16,978 INFO L471 AbstractCegarLoop]: Abstraction has 14573 states and 26142 transitions. [2024-11-09 19:24:16,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:16,978 INFO L276 IsEmpty]: Start isEmpty. Operand 14573 states and 26142 transitions. [2024-11-09 19:24:16,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-11-09 19:24:16,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:16,987 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:24:16,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:24:16,987 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:16,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:16,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1226353870, now seen corresponding path program 1 times [2024-11-09 19:24:16,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:16,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826519263] [2024-11-09 19:24:16,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:16,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-09 19:24:17,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:17,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826519263] [2024-11-09 19:24:17,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826519263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:17,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:17,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:17,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708804272] [2024-11-09 19:24:17,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:17,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:17,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:17,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:17,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:17,144 INFO L87 Difference]: Start difference. First operand 14573 states and 26142 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:18,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:18,024 INFO L93 Difference]: Finished difference Result 31178 states and 56196 transitions. [2024-11-09 19:24:18,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:24:18,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 315 [2024-11-09 19:24:18,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:18,054 INFO L225 Difference]: With dead ends: 31178 [2024-11-09 19:24:18,054 INFO L226 Difference]: Without dead ends: 16607 [2024-11-09 19:24:18,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:18,067 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 306 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:18,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 155 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:24:18,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16607 states. [2024-11-09 19:24:18,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16607 to 14566. [2024-11-09 19:24:18,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14566 states, 14565 states have (on average 1.7933401991074494) internal successors, (26120), 14565 states have internal predecessors, (26120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:18,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14566 states to 14566 states and 26120 transitions. [2024-11-09 19:24:18,259 INFO L78 Accepts]: Start accepts. Automaton has 14566 states and 26120 transitions. Word has length 315 [2024-11-09 19:24:18,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:18,259 INFO L471 AbstractCegarLoop]: Abstraction has 14566 states and 26120 transitions. [2024-11-09 19:24:18,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 14566 states and 26120 transitions. [2024-11-09 19:24:18,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-09 19:24:18,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:18,271 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:24:18,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:24:18,271 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:18,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:18,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1426513338, now seen corresponding path program 1 times [2024-11-09 19:24:18,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:18,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161662127] [2024-11-09 19:24:18,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:18,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-09 19:24:18,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:18,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161662127] [2024-11-09 19:24:18,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161662127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:18,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:18,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:18,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522310500] [2024-11-09 19:24:18,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:18,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:24:18,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:18,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:24:18,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:18,953 INFO L87 Difference]: Start difference. First operand 14566 states and 26120 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:20,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:20,025 INFO L93 Difference]: Finished difference Result 34326 states and 61673 transitions. [2024-11-09 19:24:20,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:24:20,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 324 [2024-11-09 19:24:20,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:20,062 INFO L225 Difference]: With dead ends: 34326 [2024-11-09 19:24:20,062 INFO L226 Difference]: Without dead ends: 18452 [2024-11-09 19:24:20,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:20,077 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 191 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:20,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 171 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:24:20,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18452 states. [2024-11-09 19:24:20,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18452 to 17155. [2024-11-09 19:24:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17155 states, 17154 states have (on average 1.7729975515914655) internal successors, (30414), 17154 states have internal predecessors, (30414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:20,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17155 states to 17155 states and 30414 transitions. [2024-11-09 19:24:20,392 INFO L78 Accepts]: Start accepts. Automaton has 17155 states and 30414 transitions. Word has length 324 [2024-11-09 19:24:20,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:20,393 INFO L471 AbstractCegarLoop]: Abstraction has 17155 states and 30414 transitions. [2024-11-09 19:24:20,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:20,393 INFO L276 IsEmpty]: Start isEmpty. Operand 17155 states and 30414 transitions. [2024-11-09 19:24:20,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2024-11-09 19:24:20,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:20,409 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:24:20,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 19:24:20,409 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:20,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:20,410 INFO L85 PathProgramCache]: Analyzing trace with hash -220962627, now seen corresponding path program 1 times [2024-11-09 19:24:20,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:20,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718799223] [2024-11-09 19:24:20,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:20,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-09 19:24:20,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:20,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718799223] [2024-11-09 19:24:20,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718799223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:20,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:20,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:24:20,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404033624] [2024-11-09 19:24:20,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:20,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:24:20,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:20,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:24:20,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:20,817 INFO L87 Difference]: Start difference. First operand 17155 states and 30414 transitions. Second operand has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:22,293 INFO L93 Difference]: Finished difference Result 44136 states and 78455 transitions. [2024-11-09 19:24:22,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:24:22,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 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 399 [2024-11-09 19:24:22,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:22,331 INFO L225 Difference]: With dead ends: 44136 [2024-11-09 19:24:22,331 INFO L226 Difference]: Without dead ends: 26613 [2024-11-09 19:24:22,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:22,348 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 540 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:22,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 97 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1586 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 19:24:22,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26613 states. [2024-11-09 19:24:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26613 to 22913. [2024-11-09 19:24:22,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22913 states, 22912 states have (on average 1.7767108938547487) internal successors, (40708), 22912 states have internal predecessors, (40708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22913 states to 22913 states and 40708 transitions. [2024-11-09 19:24:22,663 INFO L78 Accepts]: Start accepts. Automaton has 22913 states and 40708 transitions. Word has length 399 [2024-11-09 19:24:22,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:22,663 INFO L471 AbstractCegarLoop]: Abstraction has 22913 states and 40708 transitions. [2024-11-09 19:24:22,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:22,663 INFO L276 IsEmpty]: Start isEmpty. Operand 22913 states and 40708 transitions. [2024-11-09 19:24:22,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2024-11-09 19:24:22,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:22,688 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:24:22,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 19:24:22,688 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:22,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:22,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1647081636, now seen corresponding path program 1 times [2024-11-09 19:24:22,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:22,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145182876] [2024-11-09 19:24:22,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:22,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:23,098 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 19:24:23,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:23,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145182876] [2024-11-09 19:24:23,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145182876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:23,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:23,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:23,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705938819] [2024-11-09 19:24:23,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:23,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:24:23,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:23,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:24:23,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:23,103 INFO L87 Difference]: Start difference. First operand 22913 states and 40708 transitions. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:24,461 INFO L93 Difference]: Finished difference Result 58274 states and 103603 transitions. [2024-11-09 19:24:24,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:24:24,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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 452 [2024-11-09 19:24:24,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:24,622 INFO L225 Difference]: With dead ends: 58274 [2024-11-09 19:24:24,623 INFO L226 Difference]: Without dead ends: 35548 [2024-11-09 19:24:24,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:24,638 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 462 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:24,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 105 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:24:24,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35548 states. [2024-11-09 19:24:25,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35548 to 30531. [2024-11-09 19:24:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30531 states, 30530 states have (on average 1.7793645594497216) internal successors, (54324), 30530 states have internal predecessors, (54324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30531 states to 30531 states and 54324 transitions. [2024-11-09 19:24:25,121 INFO L78 Accepts]: Start accepts. Automaton has 30531 states and 54324 transitions. Word has length 452 [2024-11-09 19:24:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:25,122 INFO L471 AbstractCegarLoop]: Abstraction has 30531 states and 54324 transitions. [2024-11-09 19:24:25,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 30531 states and 54324 transitions. [2024-11-09 19:24:25,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2024-11-09 19:24:25,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:25,148 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:24:25,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 19:24:25,149 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:25,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:25,149 INFO L85 PathProgramCache]: Analyzing trace with hash 101691357, now seen corresponding path program 1 times [2024-11-09 19:24:25,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:25,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079133862] [2024-11-09 19:24:25,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:25,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:25,502 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-09 19:24:25,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:25,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079133862] [2024-11-09 19:24:25,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079133862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:25,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:25,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:24:25,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975282747] [2024-11-09 19:24:25,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:25,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:25,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:25,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:25,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:25,506 INFO L87 Difference]: Start difference. First operand 30531 states and 54324 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 2 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:26,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:26,046 INFO L93 Difference]: Finished difference Result 59935 states and 106653 transitions. [2024-11-09 19:24:26,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:24:26,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 2 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 474 [2024-11-09 19:24:26,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:26,082 INFO L225 Difference]: With dead ends: 59935 [2024-11-09 19:24:26,082 INFO L226 Difference]: Without dead ends: 29591 [2024-11-09 19:24:26,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:26,105 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 304 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:26,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 44 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 19:24:26,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29591 states. [2024-11-09 19:24:26,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29591 to 29581. [2024-11-09 19:24:26,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29581 states, 29580 states have (on average 1.7785327924273158) internal successors, (52609), 29580 states have internal predecessors, (52609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:26,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29581 states to 29581 states and 52609 transitions. [2024-11-09 19:24:26,585 INFO L78 Accepts]: Start accepts. Automaton has 29581 states and 52609 transitions. Word has length 474 [2024-11-09 19:24:26,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:26,585 INFO L471 AbstractCegarLoop]: Abstraction has 29581 states and 52609 transitions. [2024-11-09 19:24:26,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 2 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:26,586 INFO L276 IsEmpty]: Start isEmpty. Operand 29581 states and 52609 transitions. [2024-11-09 19:24:26,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2024-11-09 19:24:26,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:26,602 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:24:26,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 19:24:26,602 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:26,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:26,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1318301878, now seen corresponding path program 1 times [2024-11-09 19:24:26,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:26,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219588411] [2024-11-09 19:24:26,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:26,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:26,972 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 556 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-09 19:24:26,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:26,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219588411] [2024-11-09 19:24:26,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219588411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:26,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:26,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:26,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030126314] [2024-11-09 19:24:26,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:26,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:26,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:26,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:26,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:26,974 INFO L87 Difference]: Start difference. First operand 29581 states and 52609 transitions. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:27,817 INFO L93 Difference]: Finished difference Result 50774 states and 90125 transitions. [2024-11-09 19:24:27,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:24:27,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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 487 [2024-11-09 19:24:27,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:27,841 INFO L225 Difference]: With dead ends: 50774 [2024-11-09 19:24:27,841 INFO L226 Difference]: Without dead ends: 20452 [2024-11-09 19:24:27,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:27,857 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 279 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:27,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 136 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:24:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20452 states. [2024-11-09 19:24:28,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20452 to 18045. [2024-11-09 19:24:28,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18045 states, 18044 states have (on average 1.7517734426956328) internal successors, (31609), 18044 states have internal predecessors, (31609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:28,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18045 states to 18045 states and 31609 transitions. [2024-11-09 19:24:28,214 INFO L78 Accepts]: Start accepts. Automaton has 18045 states and 31609 transitions. Word has length 487 [2024-11-09 19:24:28,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:28,214 INFO L471 AbstractCegarLoop]: Abstraction has 18045 states and 31609 transitions. [2024-11-09 19:24:28,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:28,215 INFO L276 IsEmpty]: Start isEmpty. Operand 18045 states and 31609 transitions. [2024-11-09 19:24:28,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2024-11-09 19:24:28,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:28,226 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:24:28,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 19:24:28,226 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:28,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:28,227 INFO L85 PathProgramCache]: Analyzing trace with hash 362902364, now seen corresponding path program 1 times [2024-11-09 19:24:28,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:28,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464491401] [2024-11-09 19:24:28,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:28,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:28,505 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2024-11-09 19:24:28,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:28,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464491401] [2024-11-09 19:24:28,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464491401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:28,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:28,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:28,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7900347] [2024-11-09 19:24:28,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:28,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:28,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:28,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:28,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:28,508 INFO L87 Difference]: Start difference. First operand 18045 states and 31609 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:29,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:29,453 INFO L93 Difference]: Finished difference Result 37198 states and 65151 transitions. [2024-11-09 19:24:29,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:24:29,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 520 [2024-11-09 19:24:29,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:29,485 INFO L225 Difference]: With dead ends: 37198 [2024-11-09 19:24:29,486 INFO L226 Difference]: Without dead ends: 18968 [2024-11-09 19:24:29,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:29,499 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 180 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:29,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 425 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:24:29,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18968 states. [2024-11-09 19:24:29,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18968 to 15063. [2024-11-09 19:24:29,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15063 states, 15062 states have (on average 1.7496348426503785) internal successors, (26353), 15062 states have internal predecessors, (26353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15063 states to 15063 states and 26353 transitions. [2024-11-09 19:24:29,733 INFO L78 Accepts]: Start accepts. Automaton has 15063 states and 26353 transitions. Word has length 520 [2024-11-09 19:24:29,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:29,734 INFO L471 AbstractCegarLoop]: Abstraction has 15063 states and 26353 transitions. [2024-11-09 19:24:29,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 15063 states and 26353 transitions. [2024-11-09 19:24:29,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2024-11-09 19:24:29,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:29,753 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2024-11-09 19:24:29,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 19:24:29,753 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:29,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:29,754 INFO L85 PathProgramCache]: Analyzing trace with hash 399425591, now seen corresponding path program 1 times [2024-11-09 19:24:29,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:29,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146032311] [2024-11-09 19:24:29,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:29,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 567 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-11-09 19:24:30,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:30,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146032311] [2024-11-09 19:24:30,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146032311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:30,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:30,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:24:30,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100497078] [2024-11-09 19:24:30,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:30,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:24:30,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:30,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:24:30,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:30,329 INFO L87 Difference]: Start difference. First operand 15063 states and 26353 transitions. Second operand has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:31,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:31,629 INFO L93 Difference]: Finished difference Result 36060 states and 63100 transitions. [2024-11-09 19:24:31,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:24:31,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 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 541 [2024-11-09 19:24:31,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:31,651 INFO L225 Difference]: With dead ends: 36060 [2024-11-09 19:24:31,651 INFO L226 Difference]: Without dead ends: 20814 [2024-11-09 19:24:31,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:31,661 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 526 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:31,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 79 Invalid, 1758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:24:31,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20814 states. [2024-11-09 19:24:31,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20814 to 14693. [2024-11-09 19:24:31,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14693 states, 14692 states have (on average 1.7514293493057447) internal successors, (25732), 14692 states have internal predecessors, (25732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:31,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14693 states to 14693 states and 25732 transitions. [2024-11-09 19:24:31,814 INFO L78 Accepts]: Start accepts. Automaton has 14693 states and 25732 transitions. Word has length 541 [2024-11-09 19:24:31,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:31,815 INFO L471 AbstractCegarLoop]: Abstraction has 14693 states and 25732 transitions. [2024-11-09 19:24:31,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:31,815 INFO L276 IsEmpty]: Start isEmpty. Operand 14693 states and 25732 transitions. [2024-11-09 19:24:31,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2024-11-09 19:24:31,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:31,828 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:24:31,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 19:24:31,829 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:31,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:31,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1028205042, now seen corresponding path program 1 times [2024-11-09 19:24:31,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:31,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468913276] [2024-11-09 19:24:31,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:31,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:32,673 INFO L134 CoverageAnalysis]: Checked inductivity of 839 backedges. 714 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-11-09 19:24:32,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:32,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468913276] [2024-11-09 19:24:32,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468913276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:32,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:32,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:24:32,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826032019] [2024-11-09 19:24:32,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:32,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:24:32,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:32,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:24:32,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:32,676 INFO L87 Difference]: Start difference. First operand 14693 states and 25732 transitions. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:34,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:34,062 INFO L93 Difference]: Finished difference Result 35140 states and 61530 transitions. [2024-11-09 19:24:34,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:24:34,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 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 567 [2024-11-09 19:24:34,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:34,090 INFO L225 Difference]: With dead ends: 35140 [2024-11-09 19:24:34,090 INFO L226 Difference]: Without dead ends: 20634 [2024-11-09 19:24:34,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:34,102 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 409 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:34,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 97 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:24:34,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20634 states. [2024-11-09 19:24:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20634 to 16366. [2024-11-09 19:24:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16366 states, 16365 states have (on average 1.7500763825236785) internal successors, (28640), 16365 states have internal predecessors, (28640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:34,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16366 states to 16366 states and 28640 transitions. [2024-11-09 19:24:34,372 INFO L78 Accepts]: Start accepts. Automaton has 16366 states and 28640 transitions. Word has length 567 [2024-11-09 19:24:34,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:34,372 INFO L471 AbstractCegarLoop]: Abstraction has 16366 states and 28640 transitions. [2024-11-09 19:24:34,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:34,373 INFO L276 IsEmpty]: Start isEmpty. Operand 16366 states and 28640 transitions. [2024-11-09 19:24:34,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2024-11-09 19:24:34,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:34,392 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:24:34,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 19:24:34,392 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:34,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:34,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1657353418, now seen corresponding path program 1 times [2024-11-09 19:24:34,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:34,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931274718] [2024-11-09 19:24:34,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:34,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 629 proven. 154 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-09 19:24:35,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:35,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931274718] [2024-11-09 19:24:35,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931274718] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:24:35,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767481068] [2024-11-09 19:24:35,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:35,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:24:35,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:24:35,051 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:24:35,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:24:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:35,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 19:24:35,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:24:36,886 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 629 proven. 154 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-09 19:24:36,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:24:38,369 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 629 proven. 154 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-09 19:24:38,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767481068] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 19:24:38,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 19:24:38,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-09 19:24:38,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785138997] [2024-11-09 19:24:38,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 19:24:38,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 19:24:38,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:38,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 19:24:38,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:24:38,373 INFO L87 Difference]: Start difference. First operand 16366 states and 28640 transitions. Second operand has 5 states, 5 states have (on average 94.6) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:39,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:39,951 INFO L93 Difference]: Finished difference Result 34143 states and 59665 transitions. [2024-11-09 19:24:39,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 19:24:39,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 94.6) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 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 632 [2024-11-09 19:24:39,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:39,970 INFO L225 Difference]: With dead ends: 34143 [2024-11-09 19:24:39,970 INFO L226 Difference]: Without dead ends: 17409 [2024-11-09 19:24:39,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1268 GetRequests, 1263 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:24:39,979 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 865 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:39,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 67 Invalid, 2339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 2109 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 19:24:39,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17409 states. [2024-11-09 19:24:40,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17409 to 13389. [2024-11-09 19:24:40,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13389 states, 13388 states have (on average 1.733642067523155) internal successors, (23210), 13388 states have internal predecessors, (23210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13389 states to 13389 states and 23210 transitions. [2024-11-09 19:24:40,122 INFO L78 Accepts]: Start accepts. Automaton has 13389 states and 23210 transitions. Word has length 632 [2024-11-09 19:24:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:40,123 INFO L471 AbstractCegarLoop]: Abstraction has 13389 states and 23210 transitions. [2024-11-09 19:24:40,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.6) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:40,123 INFO L276 IsEmpty]: Start isEmpty. Operand 13389 states and 23210 transitions. [2024-11-09 19:24:40,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2024-11-09 19:24:40,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:40,135 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:24:40,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:24:40,335 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,SelfDestructingSolverStorable21 [2024-11-09 19:24:40,336 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:40,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:40,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1045396906, now seen corresponding path program 1 times [2024-11-09 19:24:40,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:40,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792289165] [2024-11-09 19:24:40,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:40,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:40,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2024-11-09 19:24:40,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:40,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792289165] [2024-11-09 19:24:40,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792289165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:40,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:40,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:40,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435140013] [2024-11-09 19:24:40,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:40,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:40,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:40,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:40,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:40,656 INFO L87 Difference]: Start difference. First operand 13389 states and 23210 transitions. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:41,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:41,492 INFO L93 Difference]: Finished difference Result 28254 states and 48983 transitions. [2024-11-09 19:24:41,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:24:41,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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 652 [2024-11-09 19:24:41,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:41,515 INFO L225 Difference]: With dead ends: 28254 [2024-11-09 19:24:41,516 INFO L226 Difference]: Without dead ends: 15794 [2024-11-09 19:24:41,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:41,527 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 236 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:41,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 116 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:24:41,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15794 states. [2024-11-09 19:24:41,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15794 to 14867. [2024-11-09 19:24:41,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14867 states, 14866 states have (on average 1.7277007937575677) internal successors, (25684), 14866 states have internal predecessors, (25684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:41,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14867 states to 14867 states and 25684 transitions. [2024-11-09 19:24:41,806 INFO L78 Accepts]: Start accepts. Automaton has 14867 states and 25684 transitions. Word has length 652 [2024-11-09 19:24:41,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:41,807 INFO L471 AbstractCegarLoop]: Abstraction has 14867 states and 25684 transitions. [2024-11-09 19:24:41,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:41,807 INFO L276 IsEmpty]: Start isEmpty. Operand 14867 states and 25684 transitions. [2024-11-09 19:24:41,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2024-11-09 19:24:41,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:41,822 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2024-11-09 19:24:41,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 19:24:41,822 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:41,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:41,823 INFO L85 PathProgramCache]: Analyzing trace with hash -864814441, now seen corresponding path program 1 times [2024-11-09 19:24:41,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:41,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003100483] [2024-11-09 19:24:41,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:41,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:42,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 1060 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-09 19:24:42,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:42,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003100483] [2024-11-09 19:24:42,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003100483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:42,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:42,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:42,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904344256] [2024-11-09 19:24:42,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:42,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:24:42,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:42,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:24:42,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:42,234 INFO L87 Difference]: Start difference. First operand 14867 states and 25684 transitions. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:43,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:43,342 INFO L93 Difference]: Finished difference Result 31591 states and 54600 transitions. [2024-11-09 19:24:43,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:24:43,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 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 687 [2024-11-09 19:24:43,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:43,362 INFO L225 Difference]: With dead ends: 31591 [2024-11-09 19:24:43,362 INFO L226 Difference]: Without dead ends: 17838 [2024-11-09 19:24:43,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:43,372 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 410 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:43,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 70 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:24:43,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17838 states. [2024-11-09 19:24:43,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17838 to 14867. [2024-11-09 19:24:43,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14867 states, 14866 states have (on average 1.7277007937575677) internal successors, (25684), 14866 states have internal predecessors, (25684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14867 states to 14867 states and 25684 transitions. [2024-11-09 19:24:43,595 INFO L78 Accepts]: Start accepts. Automaton has 14867 states and 25684 transitions. Word has length 687 [2024-11-09 19:24:43,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:43,595 INFO L471 AbstractCegarLoop]: Abstraction has 14867 states and 25684 transitions. [2024-11-09 19:24:43,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:43,595 INFO L276 IsEmpty]: Start isEmpty. Operand 14867 states and 25684 transitions. [2024-11-09 19:24:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2024-11-09 19:24:43,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:43,605 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:24:43,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 19:24:43,605 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:43,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:43,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1127719397, now seen corresponding path program 1 times [2024-11-09 19:24:43,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:43,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927018044] [2024-11-09 19:24:43,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:43,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1605 backedges. 1048 proven. 0 refuted. 0 times theorem prover too weak. 557 trivial. 0 not checked. [2024-11-09 19:24:43,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:43,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927018044] [2024-11-09 19:24:43,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927018044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:43,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:43,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:43,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164093655] [2024-11-09 19:24:43,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:43,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:43,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:43,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:43,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:43,852 INFO L87 Difference]: Start difference. First operand 14867 states and 25684 transitions. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:44,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:44,532 INFO L93 Difference]: Finished difference Result 29175 states and 50420 transitions. [2024-11-09 19:24:44,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:24:44,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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 702 [2024-11-09 19:24:44,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:44,549 INFO L225 Difference]: With dead ends: 29175 [2024-11-09 19:24:44,549 INFO L226 Difference]: Without dead ends: 15237 [2024-11-09 19:24:44,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:44,558 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 219 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:44,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 134 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:24:44,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15237 states. [2024-11-09 19:24:44,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15237 to 14306. [2024-11-09 19:24:44,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14306 states, 14305 states have (on average 1.7238028661307234) internal successors, (24659), 14305 states have internal predecessors, (24659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14306 states to 14306 states and 24659 transitions. [2024-11-09 19:24:44,688 INFO L78 Accepts]: Start accepts. Automaton has 14306 states and 24659 transitions. Word has length 702 [2024-11-09 19:24:44,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:44,689 INFO L471 AbstractCegarLoop]: Abstraction has 14306 states and 24659 transitions. [2024-11-09 19:24:44,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:44,689 INFO L276 IsEmpty]: Start isEmpty. Operand 14306 states and 24659 transitions. [2024-11-09 19:24:44,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2024-11-09 19:24:44,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:44,702 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2024-11-09 19:24:44,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 19:24:44,703 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:44,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:44,703 INFO L85 PathProgramCache]: Analyzing trace with hash 763874911, now seen corresponding path program 1 times [2024-11-09 19:24:44,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:44,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821668996] [2024-11-09 19:24:44,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:44,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1394 backedges. 963 proven. 0 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2024-11-09 19:24:45,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:45,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821668996] [2024-11-09 19:24:45,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821668996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:45,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:45,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:45,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410834056] [2024-11-09 19:24:45,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:45,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:24:45,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:45,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:24:45,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:45,709 INFO L87 Difference]: Start difference. First operand 14306 states and 24659 transitions. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:47,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:47,058 INFO L93 Difference]: Finished difference Result 31026 states and 53526 transitions. [2024-11-09 19:24:47,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:24:47,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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 732 [2024-11-09 19:24:47,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:47,081 INFO L225 Difference]: With dead ends: 31026 [2024-11-09 19:24:47,081 INFO L226 Difference]: Without dead ends: 17091 [2024-11-09 19:24:47,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:47,093 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 358 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:47,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 99 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:24:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17091 states. [2024-11-09 19:24:47,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17091 to 15792. [2024-11-09 19:24:47,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15792 states, 15791 states have (on average 1.721233614083972) internal successors, (27180), 15791 states have internal predecessors, (27180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15792 states to 15792 states and 27180 transitions. [2024-11-09 19:24:47,456 INFO L78 Accepts]: Start accepts. Automaton has 15792 states and 27180 transitions. Word has length 732 [2024-11-09 19:24:47,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:47,457 INFO L471 AbstractCegarLoop]: Abstraction has 15792 states and 27180 transitions. [2024-11-09 19:24:47,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:47,457 INFO L276 IsEmpty]: Start isEmpty. Operand 15792 states and 27180 transitions. [2024-11-09 19:24:47,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 764 [2024-11-09 19:24:47,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:47,470 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-09 19:24:47,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 19:24:47,470 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:47,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:47,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2089339232, now seen corresponding path program 1 times [2024-11-09 19:24:47,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:47,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437854622] [2024-11-09 19:24:47,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:47,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:47,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 912 proven. 0 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2024-11-09 19:24:47,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:47,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437854622] [2024-11-09 19:24:47,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437854622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:47,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:47,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:47,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432457135] [2024-11-09 19:24:47,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:47,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:47,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:47,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:47,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:47,752 INFO L87 Difference]: Start difference. First operand 15792 states and 27180 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:48,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:48,486 INFO L93 Difference]: Finished difference Result 31212 states and 53763 transitions. [2024-11-09 19:24:48,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:24:48,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 763 [2024-11-09 19:24:48,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:48,505 INFO L225 Difference]: With dead ends: 31212 [2024-11-09 19:24:48,505 INFO L226 Difference]: Without dead ends: 16162 [2024-11-09 19:24:48,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:48,515 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 316 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:48,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 452 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:24:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16162 states. [2024-11-09 19:24:48,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16162 to 13194. [2024-11-09 19:24:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13194 states, 13193 states have (on average 1.7156067611612218) internal successors, (22634), 13193 states have internal predecessors, (22634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:48,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13194 states to 13194 states and 22634 transitions. [2024-11-09 19:24:48,648 INFO L78 Accepts]: Start accepts. Automaton has 13194 states and 22634 transitions. Word has length 763 [2024-11-09 19:24:48,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:48,649 INFO L471 AbstractCegarLoop]: Abstraction has 13194 states and 22634 transitions. [2024-11-09 19:24:48,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:48,649 INFO L276 IsEmpty]: Start isEmpty. Operand 13194 states and 22634 transitions. [2024-11-09 19:24:48,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 771 [2024-11-09 19:24:48,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:48,661 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:24:48,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 19:24:48,661 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:48,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:48,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1956098246, now seen corresponding path program 1 times [2024-11-09 19:24:48,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:48,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707951951] [2024-11-09 19:24:48,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:48,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:49,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1421 backedges. 656 proven. 559 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-09 19:24:49,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:49,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707951951] [2024-11-09 19:24:49,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707951951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:24:49,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204781264] [2024-11-09 19:24:49,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:49,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:24:49,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:24:49,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:24:49,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 19:24:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:49,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 19:24:49,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:24:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1421 backedges. 1038 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2024-11-09 19:24:50,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:24:50,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204781264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:50,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:24:50,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:24:50,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667830289] [2024-11-09 19:24:50,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:50,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:50,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:50,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:50,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:24:50,236 INFO L87 Difference]: Start difference. First operand 13194 states and 22634 transitions. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:50,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:50,942 INFO L93 Difference]: Finished difference Result 26395 states and 45300 transitions. [2024-11-09 19:24:50,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:24:50,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 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 770 [2024-11-09 19:24:50,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:50,956 INFO L225 Difference]: With dead ends: 26395 [2024-11-09 19:24:50,957 INFO L226 Difference]: Without dead ends: 13760 [2024-11-09 19:24:50,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 769 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:24:50,964 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 222 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:50,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 441 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:24:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13760 states. [2024-11-09 19:24:51,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13760 to 13566. [2024-11-09 19:24:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13566 states, 13565 states have (on average 1.71478068558791) internal successors, (23261), 13565 states have internal predecessors, (23261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13566 states to 13566 states and 23261 transitions. [2024-11-09 19:24:51,087 INFO L78 Accepts]: Start accepts. Automaton has 13566 states and 23261 transitions. Word has length 770 [2024-11-09 19:24:51,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:51,088 INFO L471 AbstractCegarLoop]: Abstraction has 13566 states and 23261 transitions. [2024-11-09 19:24:51,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:51,088 INFO L276 IsEmpty]: Start isEmpty. Operand 13566 states and 23261 transitions. [2024-11-09 19:24:51,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 827 [2024-11-09 19:24:51,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:51,099 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:24:51,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 19:24:51,299 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,SelfDestructingSolverStorable27 [2024-11-09 19:24:51,300 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:51,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:51,300 INFO L85 PathProgramCache]: Analyzing trace with hash -518529586, now seen corresponding path program 1 times [2024-11-09 19:24:51,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:51,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510219776] [2024-11-09 19:24:51,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:51,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2210 backedges. 1335 proven. 0 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2024-11-09 19:24:52,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:52,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510219776] [2024-11-09 19:24:52,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510219776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:52,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:52,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:24:52,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724712740] [2024-11-09 19:24:52,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:52,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:24:52,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:52,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:24:52,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:52,195 INFO L87 Difference]: Start difference. First operand 13566 states and 23261 transitions. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:53,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:53,298 INFO L93 Difference]: Finished difference Result 26386 states and 45212 transitions. [2024-11-09 19:24:53,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:24:53,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 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 826 [2024-11-09 19:24:53,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:53,313 INFO L225 Difference]: With dead ends: 26386 [2024-11-09 19:24:53,313 INFO L226 Difference]: Without dead ends: 13379 [2024-11-09 19:24:53,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:53,321 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 416 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:53,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 56 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1442 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:24:53,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13379 states. [2024-11-09 19:24:53,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13379 to 11521. [2024-11-09 19:24:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11521 states, 11520 states have (on average 1.71015625) internal successors, (19701), 11520 states have internal predecessors, (19701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:53,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11521 states to 11521 states and 19701 transitions. [2024-11-09 19:24:53,435 INFO L78 Accepts]: Start accepts. Automaton has 11521 states and 19701 transitions. Word has length 826 [2024-11-09 19:24:53,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:53,435 INFO L471 AbstractCegarLoop]: Abstraction has 11521 states and 19701 transitions. [2024-11-09 19:24:53,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:53,435 INFO L276 IsEmpty]: Start isEmpty. Operand 11521 states and 19701 transitions. [2024-11-09 19:24:53,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 873 [2024-11-09 19:24:53,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:53,445 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:24:53,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 19:24:53,446 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:53,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:53,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1858461017, now seen corresponding path program 1 times [2024-11-09 19:24:53,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:53,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727260440] [2024-11-09 19:24:53,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:53,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:53,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2440 backedges. 1361 proven. 0 refuted. 0 times theorem prover too weak. 1079 trivial. 0 not checked. [2024-11-09 19:24:53,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:53,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727260440] [2024-11-09 19:24:53,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727260440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:53,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:53,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:53,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377368034] [2024-11-09 19:24:53,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:53,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:53,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:53,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:53,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:53,809 INFO L87 Difference]: Start difference. First operand 11521 states and 19701 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:54,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:54,522 INFO L93 Difference]: Finished difference Result 22849 states and 39099 transitions. [2024-11-09 19:24:54,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:24:54,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 872 [2024-11-09 19:24:54,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:54,534 INFO L225 Difference]: With dead ends: 22849 [2024-11-09 19:24:54,534 INFO L226 Difference]: Without dead ends: 11887 [2024-11-09 19:24:54,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:54,539 INFO L432 NwaCegarLoop]: 403 mSDtfsCounter, 309 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:54,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 421 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:24:54,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2024-11-09 19:24:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 11887. [2024-11-09 19:24:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11887 states, 11886 states have (on average 1.7067137809187278) internal successors, (20286), 11886 states have internal predecessors, (20286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:54,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11887 states to 11887 states and 20286 transitions. [2024-11-09 19:24:54,646 INFO L78 Accepts]: Start accepts. Automaton has 11887 states and 20286 transitions. Word has length 872 [2024-11-09 19:24:54,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:54,647 INFO L471 AbstractCegarLoop]: Abstraction has 11887 states and 20286 transitions. [2024-11-09 19:24:54,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 11887 states and 20286 transitions. [2024-11-09 19:24:54,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 877 [2024-11-09 19:24:54,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:54,659 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2024-11-09 19:24:54,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 19:24:54,659 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:54,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:54,659 INFO L85 PathProgramCache]: Analyzing trace with hash -539461188, now seen corresponding path program 1 times [2024-11-09 19:24:54,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:54,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099813111] [2024-11-09 19:24:54,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:54,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2033 backedges. 1314 proven. 163 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-09 19:24:55,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:55,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099813111] [2024-11-09 19:24:55,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099813111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:24:55,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679355809] [2024-11-09 19:24:55,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:55,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:24:55,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:24:55,653 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:24:55,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 19:24:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:55,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 19:24:55,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:24:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2033 backedges. 1400 proven. 202 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2024-11-09 19:24:58,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:25:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2033 backedges. 1314 proven. 163 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-09 19:25:01,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679355809] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 19:25:01,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 19:25:01,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 12 [2024-11-09 19:25:01,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004641651] [2024-11-09 19:25:01,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 19:25:01,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 19:25:01,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:01,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 19:25:01,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-09 19:25:01,117 INFO L87 Difference]: Start difference. First operand 11887 states and 20286 transitions. Second operand has 13 states, 13 states have (on average 61.30769230769231) internal successors, (797), 12 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)