./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label33.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_label33.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 7166744474158954665024dc8c8b3712d72f905c129b3d2684427468d2506fe1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:22:32,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:22:32,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:22:32,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:22:32,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:22:32,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:22:32,792 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:22:32,792 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:22:32,793 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:22:32,795 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:22:32,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:22:32,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:22:32,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:22:32,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:22:32,796 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:22:32,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:22:32,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:22:32,797 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:22:32,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:22:32,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:22:32,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:22:32,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:22:32,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:22:32,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:22:32,800 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:22:32,800 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:22:32,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:22:32,800 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:22:32,801 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:22:32,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:22:32,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:22:32,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:22:32,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:22:32,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:22:32,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:22:32,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:22:32,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:22:32,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:22:32,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:22:32,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:22:32,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:22:32,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:22:32,804 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 -> 7166744474158954665024dc8c8b3712d72f905c129b3d2684427468d2506fe1 [2024-11-09 19:22:33,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:22:33,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:22:33,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:22:33,051 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:22:33,051 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:22:33,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label33.c [2024-11-09 19:22:34,165 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:22:34,436 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:22:34,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label33.c [2024-11-09 19:22:34,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb9d648b/9ea0b1004ecb4f2eabc12e872a16f75a/FLAG254b4f0fd [2024-11-09 19:22:34,757 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb9d648b/9ea0b1004ecb4f2eabc12e872a16f75a [2024-11-09 19:22:34,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:22:34,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:22:34,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:22:34,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:22:34,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:22:34,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:22:34" (1/1) ... [2024-11-09 19:22:34,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58927497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:34, skipping insertion in model container [2024-11-09 19:22:34,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:22:34" (1/1) ... [2024-11-09 19:22:34,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:22:34,974 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_label33.c[4121,4134] [2024-11-09 19:22:35,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:22:35,175 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:22:35,195 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_label33.c[4121,4134] [2024-11-09 19:22:35,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:22:35,294 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:22:35,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:35 WrapperNode [2024-11-09 19:22:35,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:22:35,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:22:35,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:22:35,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:22:35,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:35" (1/1) ... [2024-11-09 19:22:35,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:35" (1/1) ... [2024-11-09 19:22:35,401 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2024-11-09 19:22:35,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:22:35,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:22:35,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:22:35,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:22:35,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:35" (1/1) ... [2024-11-09 19:22:35,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:35" (1/1) ... [2024-11-09 19:22:35,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:35" (1/1) ... [2024-11-09 19:22:35,455 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 19:22:35,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:35" (1/1) ... [2024-11-09 19:22:35,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:35" (1/1) ... [2024-11-09 19:22:35,489 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:35" (1/1) ... [2024-11-09 19:22:35,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:35" (1/1) ... [2024-11-09 19:22:35,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:35" (1/1) ... [2024-11-09 19:22:35,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:35" (1/1) ... [2024-11-09 19:22:35,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:22:35,510 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:22:35,510 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:22:35,510 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:22:35,510 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:35" (1/1) ... [2024-11-09 19:22:35,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:22:35,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:22:35,542 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 19:22:35,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 19:22:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:22:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:22:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:22:35,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:22:35,654 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:22:35,655 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:22:36,916 INFO L? ?]: Removed 248 outVars from TransFormulas that were not future-live. [2024-11-09 19:22:36,916 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:22:36,938 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:22:36,940 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:22:36,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:22:36 BoogieIcfgContainer [2024-11-09 19:22:36,940 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:22:36,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:22:36,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:22:36,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:22:36,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:22:34" (1/3) ... [2024-11-09 19:22:36,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6a14fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:22:36, skipping insertion in model container [2024-11-09 19:22:36,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:35" (2/3) ... [2024-11-09 19:22:36,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6a14fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:22:36, skipping insertion in model container [2024-11-09 19:22:36,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:22:36" (3/3) ... [2024-11-09 19:22:36,948 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label33.c [2024-11-09 19:22:36,960 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:22:36,961 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:22:37,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:22:37,028 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;@289f51f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:22:37,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:22:37,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 286 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 285 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:37,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 19:22:37,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:37,042 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] [2024-11-09 19:22:37,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:37,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:37,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1141890455, now seen corresponding path program 1 times [2024-11-09 19:22:37,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:37,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911422907] [2024-11-09 19:22:37,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:37,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:37,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:37,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:37,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911422907] [2024-11-09 19:22:37,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911422907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:37,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:37,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:22:37,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369589096] [2024-11-09 19:22:37,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:37,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:37,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:37,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:37,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:37,366 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 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:38,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:38,383 INFO L93 Difference]: Finished difference Result 775 states and 1723 transitions. [2024-11-09 19:22:38,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:38,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-09 19:22:38,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:38,399 INFO L225 Difference]: With dead ends: 775 [2024-11-09 19:22:38,399 INFO L226 Difference]: Without dead ends: 425 [2024-11-09 19:22:38,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:38,404 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 331 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:38,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 168 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:22:38,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-09 19:22:38,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 415. [2024-11-09 19:22:38,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 2.0942028985507246) internal successors, (867), 414 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:38,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 867 transitions. [2024-11-09 19:22:38,454 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 867 transitions. Word has length 30 [2024-11-09 19:22:38,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:38,455 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 867 transitions. [2024-11-09 19:22:38,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:38,455 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 867 transitions. [2024-11-09 19:22:38,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 19:22:38,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:38,458 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:38,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:22:38,458 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:38,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:38,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1648940963, now seen corresponding path program 1 times [2024-11-09 19:22:38,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:38,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695537345] [2024-11-09 19:22:38,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:38,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:38,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:38,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695537345] [2024-11-09 19:22:38,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695537345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:38,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:38,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:22:38,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58195690] [2024-11-09 19:22:38,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:38,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:38,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:38,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:38,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:38,643 INFO L87 Difference]: Start difference. First operand 415 states and 867 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:39,456 INFO L93 Difference]: Finished difference Result 1207 states and 2551 transitions. [2024-11-09 19:22:39,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:39,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-11-09 19:22:39,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:39,460 INFO L225 Difference]: With dead ends: 1207 [2024-11-09 19:22:39,460 INFO L226 Difference]: Without dead ends: 794 [2024-11-09 19:22:39,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:39,461 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 275 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:39,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 180 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:22:39,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-11-09 19:22:39,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2024-11-09 19:22:39,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.9722572509457756) internal successors, (1564), 793 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:39,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1564 transitions. [2024-11-09 19:22:39,502 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1564 transitions. Word has length 97 [2024-11-09 19:22:39,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:39,503 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1564 transitions. [2024-11-09 19:22:39,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:39,503 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1564 transitions. [2024-11-09 19:22:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 19:22:39,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:39,505 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:39,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:22:39,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:39,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:39,506 INFO L85 PathProgramCache]: Analyzing trace with hash -993450345, now seen corresponding path program 1 times [2024-11-09 19:22:39,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:39,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162568554] [2024-11-09 19:22:39,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:39,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:39,697 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:39,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:39,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162568554] [2024-11-09 19:22:39,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162568554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:39,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:39,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:22:39,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293961489] [2024-11-09 19:22:39,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:39,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:39,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:39,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:39,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:39,700 INFO L87 Difference]: Start difference. First operand 794 states and 1564 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:40,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:40,476 INFO L93 Difference]: Finished difference Result 2328 states and 4623 transitions. [2024-11-09 19:22:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:40,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-11-09 19:22:40,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:40,483 INFO L225 Difference]: With dead ends: 2328 [2024-11-09 19:22:40,483 INFO L226 Difference]: Without dead ends: 1536 [2024-11-09 19:22:40,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:40,485 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 238 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:40,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 197 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:22:40,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2024-11-09 19:22:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1535. [2024-11-09 19:22:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1534 states have (on average 1.8363754889178618) internal successors, (2817), 1534 states have internal predecessors, (2817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2817 transitions. [2024-11-09 19:22:40,511 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2817 transitions. Word has length 101 [2024-11-09 19:22:40,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:40,511 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 2817 transitions. [2024-11-09 19:22:40,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:40,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2817 transitions. [2024-11-09 19:22:40,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 19:22:40,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:40,514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:40,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:22:40,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:40,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:40,514 INFO L85 PathProgramCache]: Analyzing trace with hash -424179706, now seen corresponding path program 1 times [2024-11-09 19:22:40,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:40,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50728428] [2024-11-09 19:22:40,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:40,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:40,727 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:40,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:40,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50728428] [2024-11-09 19:22:40,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50728428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:40,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:40,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:40,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598557429] [2024-11-09 19:22:40,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:40,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:40,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:40,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:40,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:40,729 INFO L87 Difference]: Start difference. First operand 1535 states and 2817 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:41,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:41,500 INFO L93 Difference]: Finished difference Result 3635 states and 6751 transitions. [2024-11-09 19:22:41,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:41,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2024-11-09 19:22:41,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:41,508 INFO L225 Difference]: With dead ends: 3635 [2024-11-09 19:22:41,508 INFO L226 Difference]: Without dead ends: 2287 [2024-11-09 19:22:41,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:41,515 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 296 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:41,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 460 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:22:41,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2024-11-09 19:22:41,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 1908. [2024-11-09 19:22:41,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1908 states, 1907 states have (on average 1.8384897745149449) internal successors, (3506), 1907 states have internal predecessors, (3506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 3506 transitions. [2024-11-09 19:22:41,546 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 3506 transitions. Word has length 158 [2024-11-09 19:22:41,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:41,546 INFO L471 AbstractCegarLoop]: Abstraction has 1908 states and 3506 transitions. [2024-11-09 19:22:41,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 3506 transitions. [2024-11-09 19:22:41,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-09 19:22:41,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:41,549 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:22:41,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:22:41,549 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:41,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:41,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1622101921, now seen corresponding path program 1 times [2024-11-09 19:22:41,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:41,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45341529] [2024-11-09 19:22:41,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:41,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 19:22:41,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:41,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45341529] [2024-11-09 19:22:41,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45341529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:41,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:41,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:41,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3975832] [2024-11-09 19:22:41,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:41,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:41,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:41,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:41,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:41,745 INFO L87 Difference]: Start difference. First operand 1908 states and 3506 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:42,574 INFO L93 Difference]: Finished difference Result 4376 states and 8116 transitions. [2024-11-09 19:22:42,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:42,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 214 [2024-11-09 19:22:42,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:42,582 INFO L225 Difference]: With dead ends: 4376 [2024-11-09 19:22:42,583 INFO L226 Difference]: Without dead ends: 2470 [2024-11-09 19:22:42,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:42,585 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 288 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 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.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:42,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 511 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:22:42,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2024-11-09 19:22:42,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2278. [2024-11-09 19:22:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2278 states, 2277 states have (on average 1.8410188844971453) internal successors, (4192), 2277 states have internal predecessors, (4192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:42,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 4192 transitions. [2024-11-09 19:22:42,614 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 4192 transitions. Word has length 214 [2024-11-09 19:22:42,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:42,614 INFO L471 AbstractCegarLoop]: Abstraction has 2278 states and 4192 transitions. [2024-11-09 19:22:42,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:42,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 4192 transitions. [2024-11-09 19:22:42,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-09 19:22:42,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:42,617 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:42,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:22:42,617 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:42,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:42,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1777749847, now seen corresponding path program 1 times [2024-11-09 19:22:42,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:42,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102122213] [2024-11-09 19:22:42,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:42,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:42,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:42,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102122213] [2024-11-09 19:22:42,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102122213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:42,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:42,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:42,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265508274] [2024-11-09 19:22:42,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:42,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:42,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:42,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:42,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:42,868 INFO L87 Difference]: Start difference. First operand 2278 states and 4192 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:43,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:43,680 INFO L93 Difference]: Finished difference Result 6049 states and 11269 transitions. [2024-11-09 19:22:43,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:43,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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 241 [2024-11-09 19:22:43,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:43,694 INFO L225 Difference]: With dead ends: 6049 [2024-11-09 19:22:43,694 INFO L226 Difference]: Without dead ends: 3773 [2024-11-09 19:22:43,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:43,699 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 235 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:43,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 184 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:22:43,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3773 states. [2024-11-09 19:22:43,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3773 to 3771. [2024-11-09 19:22:43,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3771 states, 3770 states have (on average 1.8413793103448275) internal successors, (6942), 3770 states have internal predecessors, (6942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3771 states to 3771 states and 6942 transitions. [2024-11-09 19:22:43,747 INFO L78 Accepts]: Start accepts. Automaton has 3771 states and 6942 transitions. Word has length 241 [2024-11-09 19:22:43,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:43,748 INFO L471 AbstractCegarLoop]: Abstraction has 3771 states and 6942 transitions. [2024-11-09 19:22:43,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:43,749 INFO L276 IsEmpty]: Start isEmpty. Operand 3771 states and 6942 transitions. [2024-11-09 19:22:43,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-09 19:22:43,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:43,751 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:22:43,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:22:43,752 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:43,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:43,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1708708277, now seen corresponding path program 1 times [2024-11-09 19:22:43,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:43,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849455028] [2024-11-09 19:22:43,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:43,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 19:22:43,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:43,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849455028] [2024-11-09 19:22:43,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849455028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:43,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:43,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:43,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956221458] [2024-11-09 19:22:43,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:43,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:43,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:43,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:43,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:43,921 INFO L87 Difference]: Start difference. First operand 3771 states and 6942 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:44,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:44,752 INFO L93 Difference]: Finished difference Result 8836 states and 16420 transitions. [2024-11-09 19:22:44,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:44,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2024-11-09 19:22:44,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:44,768 INFO L225 Difference]: With dead ends: 8836 [2024-11-09 19:22:44,769 INFO L226 Difference]: Without dead ends: 5067 [2024-11-09 19:22:44,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:44,774 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 300 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:44,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 162 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:22:44,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5067 states. [2024-11-09 19:22:44,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5067 to 3759. [2024-11-09 19:22:44,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.8427354976051091) internal successors, (6925), 3758 states have internal predecessors, (6925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 6925 transitions. [2024-11-09 19:22:44,830 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 6925 transitions. Word has length 251 [2024-11-09 19:22:44,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:44,831 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 6925 transitions. [2024-11-09 19:22:44,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:44,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 6925 transitions. [2024-11-09 19:22:44,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-09 19:22:44,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:44,834 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:22:44,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:22:44,834 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:44,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:44,834 INFO L85 PathProgramCache]: Analyzing trace with hash 887239051, now seen corresponding path program 1 times [2024-11-09 19:22:44,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:44,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737894355] [2024-11-09 19:22:44,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:44,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:45,226 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:45,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:45,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737894355] [2024-11-09 19:22:45,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737894355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:45,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:45,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:22:45,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402699450] [2024-11-09 19:22:45,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:45,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 19:22:45,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:45,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 19:22:45,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:22:45,228 INFO L87 Difference]: Start difference. First operand 3759 states and 6925 transitions. Second operand has 5 states, 5 states have (on average 50.2) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:46,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:46,906 INFO L93 Difference]: Finished difference Result 12165 states and 22828 transitions. [2024-11-09 19:22:46,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 19:22:46,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2024-11-09 19:22:46,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:46,927 INFO L225 Difference]: With dead ends: 12165 [2024-11-09 19:22:46,927 INFO L226 Difference]: Without dead ends: 8408 [2024-11-09 19:22:46,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:22:46,931 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 799 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 2179 mSolverCounterSat, 453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 2632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 453 IncrementalHoareTripleChecker+Valid, 2179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:46,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 90 Invalid, 2632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [453 Valid, 2179 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 19:22:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8408 states. [2024-11-09 19:22:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8408 to 8207. [2024-11-09 19:22:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8207 states, 8206 states have (on average 1.8398732634657569) internal successors, (15098), 8206 states have internal predecessors, (15098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8207 states to 8207 states and 15098 transitions. [2024-11-09 19:22:47,034 INFO L78 Accepts]: Start accepts. Automaton has 8207 states and 15098 transitions. Word has length 251 [2024-11-09 19:22:47,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:47,034 INFO L471 AbstractCegarLoop]: Abstraction has 8207 states and 15098 transitions. [2024-11-09 19:22:47,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:47,034 INFO L276 IsEmpty]: Start isEmpty. Operand 8207 states and 15098 transitions. [2024-11-09 19:22:47,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-09 19:22:47,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:47,038 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:22:47,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:22:47,038 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:47,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:47,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1230794272, now seen corresponding path program 1 times [2024-11-09 19:22:47,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:47,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131632470] [2024-11-09 19:22:47,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:47,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:47,234 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:47,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:47,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131632470] [2024-11-09 19:22:47,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131632470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:47,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:47,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:47,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435470660] [2024-11-09 19:22:47,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:47,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:22:47,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:47,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:22:47,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:22:47,237 INFO L87 Difference]: Start difference. First operand 8207 states and 15098 transitions. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:48,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:48,448 INFO L93 Difference]: Finished difference Result 23656 states and 43972 transitions. [2024-11-09 19:22:48,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:22:48,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 256 [2024-11-09 19:22:48,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:48,476 INFO L225 Difference]: With dead ends: 23656 [2024-11-09 19:22:48,476 INFO L226 Difference]: Without dead ends: 15821 [2024-11-09 19:22:48,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:22:48,486 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 524 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:48,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 92 Invalid, 1758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:22:48,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15821 states. [2024-11-09 19:22:48,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15821 to 15635. [2024-11-09 19:22:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15635 states, 15634 states have (on average 1.8404758858897274) internal successors, (28774), 15634 states have internal predecessors, (28774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15635 states to 15635 states and 28774 transitions. [2024-11-09 19:22:48,709 INFO L78 Accepts]: Start accepts. Automaton has 15635 states and 28774 transitions. Word has length 256 [2024-11-09 19:22:48,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:48,709 INFO L471 AbstractCegarLoop]: Abstraction has 15635 states and 28774 transitions. [2024-11-09 19:22:48,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand 15635 states and 28774 transitions. [2024-11-09 19:22:48,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-09 19:22:48,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:48,714 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:48,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:22:48,714 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:48,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:48,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1679462610, now seen corresponding path program 1 times [2024-11-09 19:22:48,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:48,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615790689] [2024-11-09 19:22:48,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:48,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:48,818 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-09 19:22:48,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:48,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615790689] [2024-11-09 19:22:48,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615790689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:48,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:48,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:48,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549520558] [2024-11-09 19:22:48,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:48,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:48,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:48,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:48,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:48,821 INFO L87 Difference]: Start difference. First operand 15635 states and 28774 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:49,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:49,580 INFO L93 Difference]: Finished difference Result 35150 states and 64930 transitions. [2024-11-09 19:22:49,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:49,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 262 [2024-11-09 19:22:49,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:49,610 INFO L225 Difference]: With dead ends: 35150 [2024-11-09 19:22:49,610 INFO L226 Difference]: Without dead ends: 19887 [2024-11-09 19:22:49,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:49,625 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 310 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:49,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 478 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:22:49,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19887 states. [2024-11-09 19:22:49,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19887 to 19516. [2024-11-09 19:22:49,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19516 states, 19515 states have (on average 1.8291058160389444) internal successors, (35695), 19515 states have internal predecessors, (35695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19516 states to 19516 states and 35695 transitions. [2024-11-09 19:22:49,908 INFO L78 Accepts]: Start accepts. Automaton has 19516 states and 35695 transitions. Word has length 262 [2024-11-09 19:22:49,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:49,908 INFO L471 AbstractCegarLoop]: Abstraction has 19516 states and 35695 transitions. [2024-11-09 19:22:49,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:49,908 INFO L276 IsEmpty]: Start isEmpty. Operand 19516 states and 35695 transitions. [2024-11-09 19:22:49,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2024-11-09 19:22:49,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:49,924 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:49,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:22:49,925 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:49,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:49,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1518033672, now seen corresponding path program 1 times [2024-11-09 19:22:49,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:49,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540531496] [2024-11-09 19:22:49,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:49,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 19:22:51,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:51,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540531496] [2024-11-09 19:22:51,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540531496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:51,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:51,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 19:22:51,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261206959] [2024-11-09 19:22:51,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:51,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 19:22:51,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:51,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 19:22:51,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:22:51,043 INFO L87 Difference]: Start difference. First operand 19516 states and 35695 transitions. Second operand has 7 states, 7 states have (on average 53.857142857142854) internal successors, (377), 6 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:22:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:52,873 INFO L93 Difference]: Finished difference Result 41257 states and 75371 transitions. [2024-11-09 19:22:52,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 19:22:52,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 53.857142857142854) internal successors, (377), 6 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 403 [2024-11-09 19:22:52,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:52,907 INFO L225 Difference]: With dead ends: 41257 [2024-11-09 19:22:52,908 INFO L226 Difference]: Without dead ends: 22113 [2024-11-09 19:22:52,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-09 19:22:52,987 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 452 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 3684 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 3716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:52,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 284 Invalid, 3716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3684 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 19:22:52,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22113 states. [2024-11-09 19:22:53,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22113 to 21920. [2024-11-09 19:22:53,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21920 states, 21919 states have (on average 1.8231671152881062) internal successors, (39962), 21919 states have internal predecessors, (39962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21920 states to 21920 states and 39962 transitions. [2024-11-09 19:22:53,182 INFO L78 Accepts]: Start accepts. Automaton has 21920 states and 39962 transitions. Word has length 403 [2024-11-09 19:22:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:53,182 INFO L471 AbstractCegarLoop]: Abstraction has 21920 states and 39962 transitions. [2024-11-09 19:22:53,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.857142857142854) internal successors, (377), 6 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:22:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 21920 states and 39962 transitions. [2024-11-09 19:22:53,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2024-11-09 19:22:53,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:53,199 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:53,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:22:53,199 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:53,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:53,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1210539951, now seen corresponding path program 1 times [2024-11-09 19:22:53,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:53,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592217271] [2024-11-09 19:22:53,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:53,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2024-11-09 19:22:53,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:53,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592217271] [2024-11-09 19:22:53,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592217271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:53,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:53,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:53,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509748485] [2024-11-09 19:22:53,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:53,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:53,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:53,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:53,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:53,580 INFO L87 Difference]: Start difference. First operand 21920 states and 39962 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:54,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:54,472 INFO L93 Difference]: Finished difference Result 45316 states and 82904 transitions. [2024-11-09 19:22:54,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:54,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 405 [2024-11-09 19:22:54,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:54,517 INFO L225 Difference]: With dead ends: 45316 [2024-11-09 19:22:54,517 INFO L226 Difference]: Without dead ends: 25248 [2024-11-09 19:22:54,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:54,535 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 241 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:54,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 443 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:22:54,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25248 states. [2024-11-09 19:22:54,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25248 to 23583. [2024-11-09 19:22:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23583 states, 23582 states have (on average 1.8198202018488678) internal successors, (42915), 23582 states have internal predecessors, (42915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23583 states to 23583 states and 42915 transitions. [2024-11-09 19:22:54,833 INFO L78 Accepts]: Start accepts. Automaton has 23583 states and 42915 transitions. Word has length 405 [2024-11-09 19:22:54,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:54,833 INFO L471 AbstractCegarLoop]: Abstraction has 23583 states and 42915 transitions. [2024-11-09 19:22:54,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:54,834 INFO L276 IsEmpty]: Start isEmpty. Operand 23583 states and 42915 transitions. [2024-11-09 19:22:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2024-11-09 19:22:54,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:54,851 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:54,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:22:54,852 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:54,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:54,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1188756630, now seen corresponding path program 1 times [2024-11-09 19:22:54,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:54,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022019128] [2024-11-09 19:22:54,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:54,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 362 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 19:22:55,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:55,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022019128] [2024-11-09 19:22:55,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022019128] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:22:55,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672661509] [2024-11-09 19:22:55,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:55,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:22:55,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:22:55,696 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:22:55,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:22:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:55,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 19:22:55,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:22:56,771 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 248 proven. 122 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 19:22:56,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:22:59,058 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 248 proven. 122 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 19:22:59,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672661509] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 19:22:59,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 19:22:59,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2024-11-09 19:22:59,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606890736] [2024-11-09 19:22:59,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 19:22:59,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 19:22:59,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:59,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 19:22:59,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-09 19:22:59,061 INFO L87 Difference]: Start difference. First operand 23583 states and 42915 transitions. Second operand has 11 states, 11 states have (on average 87.18181818181819) internal successors, (959), 10 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:03,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:03,714 INFO L93 Difference]: Finished difference Result 59588 states and 108373 transitions. [2024-11-09 19:23:03,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 19:23:03,715 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 87.18181818181819) internal successors, (959), 10 states have internal predecessors, (959), 0 states have call successors, (0), 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 413 [2024-11-09 19:23:03,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:03,758 INFO L225 Difference]: With dead ends: 59588 [2024-11-09 19:23:03,758 INFO L226 Difference]: Without dead ends: 35451 [2024-11-09 19:23:03,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 848 GetRequests, 823 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2024-11-09 19:23:03,777 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 3611 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 6684 mSolverCounterSat, 773 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3611 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 7457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 773 IncrementalHoareTripleChecker+Valid, 6684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:03,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3611 Valid, 247 Invalid, 7457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [773 Valid, 6684 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-09 19:23:03,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35451 states. [2024-11-09 19:23:04,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35451 to 22655. [2024-11-09 19:23:04,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22655 states, 22654 states have (on average 1.7797298490332834) internal successors, (40318), 22654 states have internal predecessors, (40318), 0 states have call successors, (0), 0 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:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22655 states to 22655 states and 40318 transitions. [2024-11-09 19:23:04,093 INFO L78 Accepts]: Start accepts. Automaton has 22655 states and 40318 transitions. Word has length 413 [2024-11-09 19:23:04,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:04,094 INFO L471 AbstractCegarLoop]: Abstraction has 22655 states and 40318 transitions. [2024-11-09 19:23:04,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 87.18181818181819) internal successors, (959), 10 states have internal predecessors, (959), 0 states have call successors, (0), 0 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:04,094 INFO L276 IsEmpty]: Start isEmpty. Operand 22655 states and 40318 transitions. [2024-11-09 19:23:04,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2024-11-09 19:23:04,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:04,106 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 19:23:04,310 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,SelfDestructingSolverStorable12 [2024-11-09 19:23:04,311 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:04,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:04,312 INFO L85 PathProgramCache]: Analyzing trace with hash -887610221, now seen corresponding path program 1 times [2024-11-09 19:23:04,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:04,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508713129] [2024-11-09 19:23:04,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:04,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-09 19:23:04,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:04,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508713129] [2024-11-09 19:23:04,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508713129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:04,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:04,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:23:04,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162311582] [2024-11-09 19:23:04,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:04,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:04,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:04,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:04,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:04,489 INFO L87 Difference]: Start difference. First operand 22655 states and 40318 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:05,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:05,139 INFO L93 Difference]: Finished difference Result 45305 states and 80753 transitions. [2024-11-09 19:23:05,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:05,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 424 [2024-11-09 19:23:05,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:05,164 INFO L225 Difference]: With dead ends: 45305 [2024-11-09 19:23:05,165 INFO L226 Difference]: Without dead ends: 24318 [2024-11-09 19:23:05,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:05,179 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 314 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:05,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 151 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:23:05,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24318 states. [2024-11-09 19:23:05,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24318 to 21352. [2024-11-09 19:23:05,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21352 states, 21351 states have (on average 1.773546906468081) internal successors, (37867), 21351 states have internal predecessors, (37867), 0 states have call successors, (0), 0 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:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21352 states to 21352 states and 37867 transitions. [2024-11-09 19:23:05,597 INFO L78 Accepts]: Start accepts. Automaton has 21352 states and 37867 transitions. Word has length 424 [2024-11-09 19:23:05,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:05,598 INFO L471 AbstractCegarLoop]: Abstraction has 21352 states and 37867 transitions. [2024-11-09 19:23:05,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:05,598 INFO L276 IsEmpty]: Start isEmpty. Operand 21352 states and 37867 transitions. [2024-11-09 19:23:05,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2024-11-09 19:23:05,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:05,614 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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:05,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 19:23:05,614 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:05,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:05,615 INFO L85 PathProgramCache]: Analyzing trace with hash -665259895, now seen corresponding path program 1 times [2024-11-09 19:23:05,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:05,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213645357] [2024-11-09 19:23:05,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:05,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:23:06,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:06,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213645357] [2024-11-09 19:23:06,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213645357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:06,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:06,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:23:06,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632660782] [2024-11-09 19:23:06,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:06,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:23:06,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:06,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:23:06,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:23:06,057 INFO L87 Difference]: Start difference. First operand 21352 states and 37867 transitions. Second operand has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 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:07,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:07,195 INFO L93 Difference]: Finished difference Result 44748 states and 79443 transitions. [2024-11-09 19:23:07,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:23:07,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 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 435 [2024-11-09 19:23:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:07,227 INFO L225 Difference]: With dead ends: 44748 [2024-11-09 19:23:07,227 INFO L226 Difference]: Without dead ends: 25250 [2024-11-09 19:23:07,242 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:23:07,242 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 431 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:07,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 71 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:23:07,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25250 states. [2024-11-09 19:23:07,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25250 to 23764. [2024-11-09 19:23:07,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23764 states, 23763 states have (on average 1.7598367209527417) internal successors, (41819), 23763 states have internal predecessors, (41819), 0 states have call successors, (0), 0 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:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23764 states to 23764 states and 41819 transitions. [2024-11-09 19:23:07,519 INFO L78 Accepts]: Start accepts. Automaton has 23764 states and 41819 transitions. Word has length 435 [2024-11-09 19:23:07,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:07,520 INFO L471 AbstractCegarLoop]: Abstraction has 23764 states and 41819 transitions. [2024-11-09 19:23:07,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 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:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand 23764 states and 41819 transitions. [2024-11-09 19:23:07,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2024-11-09 19:23:07,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:07,532 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 19:23:07,532 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:07,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:07,532 INFO L85 PathProgramCache]: Analyzing trace with hash 937099343, now seen corresponding path program 1 times [2024-11-09 19:23:07,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:07,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847636051] [2024-11-09 19:23:07,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:07,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:07,886 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-09 19:23:07,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:07,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847636051] [2024-11-09 19:23:07,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847636051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:07,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:07,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:23:07,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36582089] [2024-11-09 19:23:07,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:07,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:07,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:07,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:07,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:07,888 INFO L87 Difference]: Start difference. First operand 23764 states and 41819 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 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:08,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:08,677 INFO L93 Difference]: Finished difference Result 48264 states and 84963 transitions. [2024-11-09 19:23:08,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:08,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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 450 [2024-11-09 19:23:08,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:08,709 INFO L225 Difference]: With dead ends: 48264 [2024-11-09 19:23:08,709 INFO L226 Difference]: Without dead ends: 25614 [2024-11-09 19:23:08,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:08,724 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 244 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:08,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 421 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:23:08,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25614 states. [2024-11-09 19:23:08,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25614 to 22469. [2024-11-09 19:23:09,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22469 states, 22468 states have (on average 1.7555634680434395) internal successors, (39444), 22468 states have internal predecessors, (39444), 0 states have call successors, (0), 0 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:09,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22469 states to 22469 states and 39444 transitions. [2024-11-09 19:23:09,036 INFO L78 Accepts]: Start accepts. Automaton has 22469 states and 39444 transitions. Word has length 450 [2024-11-09 19:23:09,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:09,036 INFO L471 AbstractCegarLoop]: Abstraction has 22469 states and 39444 transitions. [2024-11-09 19:23:09,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 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:09,036 INFO L276 IsEmpty]: Start isEmpty. Operand 22469 states and 39444 transitions. [2024-11-09 19:23:09,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2024-11-09 19:23:09,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:09,048 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:23:09,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 19:23:09,048 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:09,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:09,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1758231104, now seen corresponding path program 1 times [2024-11-09 19:23:09,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:09,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044152646] [2024-11-09 19:23:09,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:09,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:09,442 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 585 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-09 19:23:09,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:09,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044152646] [2024-11-09 19:23:09,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044152646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:09,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:09,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:23:09,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840576388] [2024-11-09 19:23:09,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:09,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:23:09,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:09,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:23:09,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:23:09,444 INFO L87 Difference]: Start difference. First operand 22469 states and 39444 transitions. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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:10,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:10,494 INFO L93 Difference]: Finished difference Result 43834 states and 77050 transitions. [2024-11-09 19:23:10,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:23:10,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 489 [2024-11-09 19:23:10,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:10,518 INFO L225 Difference]: With dead ends: 43834 [2024-11-09 19:23:10,518 INFO L226 Difference]: Without dead ends: 23219 [2024-11-09 19:23:10,531 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:23:10,531 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 463 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:10,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 118 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1472 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:23:10,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23219 states. [2024-11-09 19:23:10,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23219 to 22658. [2024-11-09 19:23:10,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22658 states, 22657 states have (on average 1.7547777728737255) internal successors, (39758), 22657 states have internal predecessors, (39758), 0 states have call successors, (0), 0 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:10,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22658 states to 22658 states and 39758 transitions. [2024-11-09 19:23:10,802 INFO L78 Accepts]: Start accepts. Automaton has 22658 states and 39758 transitions. Word has length 489 [2024-11-09 19:23:10,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:10,802 INFO L471 AbstractCegarLoop]: Abstraction has 22658 states and 39758 transitions. [2024-11-09 19:23:10,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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:10,803 INFO L276 IsEmpty]: Start isEmpty. Operand 22658 states and 39758 transitions. [2024-11-09 19:23:10,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2024-11-09 19:23:10,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:10,813 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:23:10,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 19:23:10,813 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:10,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:10,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1544489669, now seen corresponding path program 1 times [2024-11-09 19:23:10,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:10,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288888366] [2024-11-09 19:23:10,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:10,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 602 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-09 19:23:11,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:11,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288888366] [2024-11-09 19:23:11,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288888366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:11,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:11,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:23:11,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838416848] [2024-11-09 19:23:11,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:11,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:11,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:11,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:11,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:11,025 INFO L87 Difference]: Start difference. First operand 22658 states and 39758 transitions. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:11,808 INFO L93 Difference]: Finished difference Result 45137 states and 79195 transitions. [2024-11-09 19:23:11,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:11,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 494 [2024-11-09 19:23:11,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:11,837 INFO L225 Difference]: With dead ends: 45137 [2024-11-09 19:23:11,838 INFO L226 Difference]: Without dead ends: 22666 [2024-11-09 19:23:11,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:11,847 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 188 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:11,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 474 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:23:11,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22666 states. [2024-11-09 19:23:12,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22666 to 22472. [2024-11-09 19:23:12,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22472 states, 22471 states have (on average 1.7327666770504206) internal successors, (38937), 22471 states have internal predecessors, (38937), 0 states have call successors, (0), 0 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:12,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22472 states to 22472 states and 38937 transitions. [2024-11-09 19:23:12,143 INFO L78 Accepts]: Start accepts. Automaton has 22472 states and 38937 transitions. Word has length 494 [2024-11-09 19:23:12,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:12,143 INFO L471 AbstractCegarLoop]: Abstraction has 22472 states and 38937 transitions. [2024-11-09 19:23:12,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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:12,144 INFO L276 IsEmpty]: Start isEmpty. Operand 22472 states and 38937 transitions. [2024-11-09 19:23:12,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2024-11-09 19:23:12,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:12,160 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:23:12,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 19:23:12,160 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:12,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:12,160 INFO L85 PathProgramCache]: Analyzing trace with hash 344164625, now seen corresponding path program 1 times [2024-11-09 19:23:12,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:12,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835594385] [2024-11-09 19:23:12,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:12,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:12,407 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2024-11-09 19:23:12,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:12,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835594385] [2024-11-09 19:23:12,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835594385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:12,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:12,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:23:12,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097667693] [2024-11-09 19:23:12,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:12,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:12,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:12,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:12,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:12,410 INFO L87 Difference]: Start difference. First operand 22472 states and 38937 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 2 states have internal predecessors, (268), 0 states have call successors, (0), 0 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:12,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:12,934 INFO L93 Difference]: Finished difference Result 41593 states and 72064 transitions. [2024-11-09 19:23:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:12,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 2 states have internal predecessors, (268), 0 states have call successors, (0), 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 515 [2024-11-09 19:23:12,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:12,951 INFO L225 Difference]: With dead ends: 41593 [2024-11-09 19:23:12,952 INFO L226 Difference]: Without dead ends: 20975 [2024-11-09 19:23:12,959 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:23:12,960 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 288 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:12,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 35 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 19:23:12,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20975 states. [2024-11-09 19:23:13,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20975 to 20973. [2024-11-09 19:23:13,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20973 states, 20972 states have (on average 1.728495136372306) internal successors, (36250), 20972 states have internal predecessors, (36250), 0 states have call successors, (0), 0 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:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20973 states to 20973 states and 36250 transitions. [2024-11-09 19:23:13,123 INFO L78 Accepts]: Start accepts. Automaton has 20973 states and 36250 transitions. Word has length 515 [2024-11-09 19:23:13,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:13,124 INFO L471 AbstractCegarLoop]: Abstraction has 20973 states and 36250 transitions. [2024-11-09 19:23:13,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 2 states have internal predecessors, (268), 0 states have call successors, (0), 0 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:13,124 INFO L276 IsEmpty]: Start isEmpty. Operand 20973 states and 36250 transitions. [2024-11-09 19:23:13,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2024-11-09 19:23:13,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:13,135 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-09 19:23:13,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 19:23:13,136 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:13,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:13,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1893309473, now seen corresponding path program 1 times [2024-11-09 19:23:13,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:13,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245711809] [2024-11-09 19:23:13,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:13,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:13,290 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 578 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-09 19:23:13,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:13,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245711809] [2024-11-09 19:23:13,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245711809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:13,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:13,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:23:13,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4079034] [2024-11-09 19:23:13,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:13,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:13,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:13,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:13,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:13,292 INFO L87 Difference]: Start difference. First operand 20973 states and 36250 transitions. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 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:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:13,962 INFO L93 Difference]: Finished difference Result 41757 states and 72227 transitions. [2024-11-09 19:23:13,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:13,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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 531 [2024-11-09 19:23:13,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:13,979 INFO L225 Difference]: With dead ends: 41757 [2024-11-09 19:23:13,979 INFO L226 Difference]: Without dead ends: 18748 [2024-11-09 19:23:13,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:13,988 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 251 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:13,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 126 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:23:13,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18748 states. [2024-11-09 19:23:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18748 to 16342. [2024-11-09 19:23:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16342 states, 16341 states have (on average 1.6954898721008507) internal successors, (27706), 16341 states have internal predecessors, (27706), 0 states have call successors, (0), 0 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:14,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16342 states to 16342 states and 27706 transitions. [2024-11-09 19:23:14,131 INFO L78 Accepts]: Start accepts. Automaton has 16342 states and 27706 transitions. Word has length 531 [2024-11-09 19:23:14,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:14,132 INFO L471 AbstractCegarLoop]: Abstraction has 16342 states and 27706 transitions. [2024-11-09 19:23:14,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 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:14,132 INFO L276 IsEmpty]: Start isEmpty. Operand 16342 states and 27706 transitions. [2024-11-09 19:23:14,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2024-11-09 19:23:14,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:14,140 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 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] [2024-11-09 19:23:14,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 19:23:14,141 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:14,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:14,141 INFO L85 PathProgramCache]: Analyzing trace with hash -374944874, now seen corresponding path program 1 times [2024-11-09 19:23:14,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:14,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125787030] [2024-11-09 19:23:14,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:14,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 646 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-11-09 19:23:14,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:14,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125787030] [2024-11-09 19:23:14,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125787030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:14,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:14,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:23:14,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083571016] [2024-11-09 19:23:14,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:14,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:14,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:14,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:14,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:14,329 INFO L87 Difference]: Start difference. First operand 16342 states and 27706 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:14,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:14,869 INFO L93 Difference]: Finished difference Result 30644 states and 51975 transitions. [2024-11-09 19:23:14,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:14,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 571 [2024-11-09 19:23:14,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:14,886 INFO L225 Difference]: With dead ends: 30644 [2024-11-09 19:23:14,886 INFO L226 Difference]: Without dead ends: 16156 [2024-11-09 19:23:14,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:14,895 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 313 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:14,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 431 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:23:14,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16156 states. [2024-11-09 19:23:15,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16156 to 16156. [2024-11-09 19:23:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16156 states, 16155 states have (on average 1.6945218198700094) internal successors, (27375), 16155 states have internal predecessors, (27375), 0 states have call successors, (0), 0 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:15,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16156 states to 16156 states and 27375 transitions. [2024-11-09 19:23:15,115 INFO L78 Accepts]: Start accepts. Automaton has 16156 states and 27375 transitions. Word has length 571 [2024-11-09 19:23:15,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:15,115 INFO L471 AbstractCegarLoop]: Abstraction has 16156 states and 27375 transitions. [2024-11-09 19:23:15,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:15,115 INFO L276 IsEmpty]: Start isEmpty. Operand 16156 states and 27375 transitions. [2024-11-09 19:23:15,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2024-11-09 19:23:15,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:15,124 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 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:15,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 19:23:15,125 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:15,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:15,125 INFO L85 PathProgramCache]: Analyzing trace with hash -87676968, now seen corresponding path program 1 times [2024-11-09 19:23:15,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:15,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861008495] [2024-11-09 19:23:15,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:15,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-09 19:23:15,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:15,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861008495] [2024-11-09 19:23:15,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861008495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:15,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:15,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:23:15,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744580220] [2024-11-09 19:23:15,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:15,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:15,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:15,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:15,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:15,394 INFO L87 Difference]: Start difference. First operand 16156 states and 27375 transitions. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 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:15,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:15,962 INFO L93 Difference]: Finished difference Result 33052 states and 56052 transitions. [2024-11-09 19:23:15,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:15,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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 597 [2024-11-09 19:23:15,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:15,981 INFO L225 Difference]: With dead ends: 33052 [2024-11-09 19:23:15,981 INFO L226 Difference]: Without dead ends: 18750 [2024-11-09 19:23:15,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:15,990 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 261 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:15,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 65 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:23:15,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18750 states. [2024-11-09 19:23:16,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18750 to 16896. [2024-11-09 19:23:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16896 states, 16895 states have (on average 1.6929269014501331) internal successors, (28602), 16895 states have internal predecessors, (28602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16896 states to 16896 states and 28602 transitions. [2024-11-09 19:23:16,266 INFO L78 Accepts]: Start accepts. Automaton has 16896 states and 28602 transitions. Word has length 597 [2024-11-09 19:23:16,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:16,266 INFO L471 AbstractCegarLoop]: Abstraction has 16896 states and 28602 transitions. [2024-11-09 19:23:16,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:16,266 INFO L276 IsEmpty]: Start isEmpty. Operand 16896 states and 28602 transitions. [2024-11-09 19:23:16,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2024-11-09 19:23:16,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:16,280 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:23:16,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 19:23:16,281 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:16,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:16,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2082624190, now seen corresponding path program 1 times [2024-11-09 19:23:16,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:16,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642191588] [2024-11-09 19:23:16,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:16,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:17,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 787 proven. 34 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-09 19:23:17,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:17,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642191588] [2024-11-09 19:23:17,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642191588] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:23:17,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710969118] [2024-11-09 19:23:17,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:17,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:23:17,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:23:17,131 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:23:17,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 19:23:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:17,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:23:17,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:23:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 821 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-09 19:23:17,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:23:17,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710969118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:17,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:23:17,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-09 19:23:17,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620550169] [2024-11-09 19:23:17,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:17,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:17,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:17,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:17,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:23:17,447 INFO L87 Difference]: Start difference. First operand 16896 states and 28602 transitions. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:18,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:18,104 INFO L93 Difference]: Finished difference Result 34911 states and 59131 transitions. [2024-11-09 19:23:18,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:18,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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 601 [2024-11-09 19:23:18,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:18,127 INFO L225 Difference]: With dead ends: 34911 [2024-11-09 19:23:18,128 INFO L226 Difference]: Without dead ends: 19869 [2024-11-09 19:23:18,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 600 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:23:18,140 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 197 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:18,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 62 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:23:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19869 states. [2024-11-09 19:23:18,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19869 to 17451. [2024-11-09 19:23:18,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17451 states, 17450 states have (on average 1.6925501432664756) internal successors, (29535), 17450 states have internal predecessors, (29535), 0 states have call successors, (0), 0 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:18,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17451 states to 17451 states and 29535 transitions. [2024-11-09 19:23:18,405 INFO L78 Accepts]: Start accepts. Automaton has 17451 states and 29535 transitions. Word has length 601 [2024-11-09 19:23:18,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:18,405 INFO L471 AbstractCegarLoop]: Abstraction has 17451 states and 29535 transitions. [2024-11-09 19:23:18,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 17451 states and 29535 transitions. [2024-11-09 19:23:18,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2024-11-09 19:23:18,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:18,420 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2024-11-09 19:23:18,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 19:23:18,620 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,SelfDestructingSolverStorable22 [2024-11-09 19:23:18,621 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:18,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:18,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1456655259, now seen corresponding path program 1 times [2024-11-09 19:23:18,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:18,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344474910] [2024-11-09 19:23:18,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:18,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:19,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 900 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-09 19:23:19,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:19,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344474910] [2024-11-09 19:23:19,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344474910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:19,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:19,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:23:19,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449373437] [2024-11-09 19:23:19,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:19,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:23:19,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:19,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:23:19,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:23:19,198 INFO L87 Difference]: Start difference. First operand 17451 states and 29535 transitions. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:20,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:20,210 INFO L93 Difference]: Finished difference Result 34718 states and 58814 transitions. [2024-11-09 19:23:20,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:23:20,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 602 [2024-11-09 19:23:20,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:20,234 INFO L225 Difference]: With dead ends: 34718 [2024-11-09 19:23:20,235 INFO L226 Difference]: Without dead ends: 18936 [2024-11-09 19:23:20,247 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:23:20,247 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 412 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:20,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 70 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:23:20,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18936 states. [2024-11-09 19:23:20,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18936 to 17080. [2024-11-09 19:23:20,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17080 states, 17079 states have (on average 1.6919023362023538) internal successors, (28896), 17079 states have internal predecessors, (28896), 0 states have call successors, (0), 0 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:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17080 states to 17080 states and 28896 transitions. [2024-11-09 19:23:20,488 INFO L78 Accepts]: Start accepts. Automaton has 17080 states and 28896 transitions. Word has length 602 [2024-11-09 19:23:20,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:20,488 INFO L471 AbstractCegarLoop]: Abstraction has 17080 states and 28896 transitions. [2024-11-09 19:23:20,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:20,488 INFO L276 IsEmpty]: Start isEmpty. Operand 17080 states and 28896 transitions. [2024-11-09 19:23:20,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2024-11-09 19:23:20,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:20,497 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:23:20,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 19:23:20,498 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:20,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:20,498 INFO L85 PathProgramCache]: Analyzing trace with hash 2032480613, now seen corresponding path program 1 times [2024-11-09 19:23:20,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:20,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18340592] [2024-11-09 19:23:20,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:20,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 1077 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-09 19:23:20,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:20,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18340592] [2024-11-09 19:23:20,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18340592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:20,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:20,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:23:20,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568619086] [2024-11-09 19:23:20,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:20,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:23:20,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:20,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:23:20,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:23:20,937 INFO L87 Difference]: Start difference. First operand 17080 states and 28896 transitions. Second operand has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 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:21,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:21,855 INFO L93 Difference]: Finished difference Result 35830 states and 60704 transitions. [2024-11-09 19:23:21,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:23:21,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 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 608 [2024-11-09 19:23:21,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:21,873 INFO L225 Difference]: With dead ends: 35830 [2024-11-09 19:23:21,873 INFO L226 Difference]: Without dead ends: 18939 [2024-11-09 19:23:21,881 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:23:21,882 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 423 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:21,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 80 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1432 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:23:21,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18939 states. [2024-11-09 19:23:22,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18939 to 18934. [2024-11-09 19:23:22,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18934 states, 18933 states have (on average 1.6929699466539905) internal successors, (32053), 18933 states have internal predecessors, (32053), 0 states have call successors, (0), 0 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:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18934 states to 18934 states and 32053 transitions. [2024-11-09 19:23:22,123 INFO L78 Accepts]: Start accepts. Automaton has 18934 states and 32053 transitions. Word has length 608 [2024-11-09 19:23:22,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:22,124 INFO L471 AbstractCegarLoop]: Abstraction has 18934 states and 32053 transitions. [2024-11-09 19:23:22,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 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:22,124 INFO L276 IsEmpty]: Start isEmpty. Operand 18934 states and 32053 transitions. [2024-11-09 19:23:22,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2024-11-09 19:23:22,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:22,139 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:23:22,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 19:23:22,139 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:22,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:22,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1003115861, now seen corresponding path program 1 times [2024-11-09 19:23:22,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:22,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3407839] [2024-11-09 19:23:22,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:22,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2024-11-09 19:23:22,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:22,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3407839] [2024-11-09 19:23:22,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3407839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:22,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:22,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:23:22,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995845979] [2024-11-09 19:23:22,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:22,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:22,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:22,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:22,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:22,643 INFO L87 Difference]: Start difference. First operand 18934 states and 32053 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 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:23,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:23,195 INFO L93 Difference]: Finished difference Result 18937 states and 32056 transitions. [2024-11-09 19:23:23,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:23,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 614 [2024-11-09 19:23:23,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:23,197 INFO L225 Difference]: With dead ends: 18937 [2024-11-09 19:23:23,197 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:23:23,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:23,200 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 281 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:23,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 440 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:23:23,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:23:23,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:23:23,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 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:23,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:23:23,201 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 614 [2024-11-09 19:23:23,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:23,201 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:23:23,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 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:23,202 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:23:23,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:23:23,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:23:23,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 19:23:23,206 INFO L407 BasicCegarLoop]: Path program 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] [2024-11-09 19:23:23,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:23:29,529 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:23:29,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:23:29 BoogieIcfgContainer [2024-11-09 19:23:29,546 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:23:29,546 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:23:29,546 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:23:29,546 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:23:29,546 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:22:36" (3/4) ... [2024-11-09 19:23:29,549 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:23:29,569 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 19:23:29,571 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:23:29,572 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:23:29,572 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:23:29,692 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:23:29,692 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:23:29,693 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:23:29,693 INFO L158 Benchmark]: Toolchain (without parser) took 54933.46ms. Allocated memory was 180.4MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 149.7MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. [2024-11-09 19:23:29,693 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 109.1MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:23:29,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.49ms. Allocated memory is still 180.4MB. Free memory was 148.6MB in the beginning and 100.8MB in the end (delta: 47.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-09 19:23:29,694 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.81ms. Allocated memory is still 180.4MB. Free memory was 100.8MB in the beginning and 82.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 19:23:29,694 INFO L158 Benchmark]: Boogie Preprocessor took 106.03ms. Allocated memory is still 180.4MB. Free memory was 82.9MB in the beginning and 58.8MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 19:23:29,694 INFO L158 Benchmark]: IcfgBuilder took 1430.60ms. Allocated memory was 180.4MB in the beginning and 253.8MB in the end (delta: 73.4MB). Free memory was 58.8MB in the beginning and 163.1MB in the end (delta: -104.3MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2024-11-09 19:23:29,696 INFO L158 Benchmark]: TraceAbstraction took 52603.88ms. Allocated memory was 253.8MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 162.0MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. [2024-11-09 19:23:29,696 INFO L158 Benchmark]: Witness Printer took 146.62ms. Allocated memory is still 5.5GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 19:23:29,697 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 109.1MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 534.49ms. Allocated memory is still 180.4MB. Free memory was 148.6MB in the beginning and 100.8MB in the end (delta: 47.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.81ms. Allocated memory is still 180.4MB. Free memory was 100.8MB in the beginning and 82.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.03ms. Allocated memory is still 180.4MB. Free memory was 82.9MB in the beginning and 58.8MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1430.60ms. Allocated memory was 180.4MB in the beginning and 253.8MB in the end (delta: 73.4MB). Free memory was 58.8MB in the beginning and 163.1MB in the end (delta: -104.3MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. * TraceAbstraction took 52603.88ms. Allocated memory was 253.8MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 162.0MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. * Witness Printer took 146.62ms. Allocated memory is still 5.5GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 100]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 286 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.2s, OverallIterations: 26, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 27.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11966 SdHoareTripleChecker+Valid, 23.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11966 mSDsluCounter, 6040 SdHoareTripleChecker+Invalid, 19.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 919 mSDsCounter, 3635 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33546 IncrementalHoareTripleChecker+Invalid, 37181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3635 mSolverCounterUnsat, 5121 mSDtfsCounter, 33546 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1531 GetRequests, 1464 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23764occurred in iteration=15, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 34197 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 11027 NumberOfCodeBlocks, 11027 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 11411 ConstructedInterpolants, 0 QuantifiedInterpolants, 40636 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1342 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 29 InterpolantComputations, 25 PerfectInterpolantSequences, 14635/14921 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:23:29,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE