./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label56.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/Problem12_label56.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 2fec0dbf4b6ddb0b1603ab7a0ec8993384a9d6ffa347e857313f4dbf633d9cf3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:29:49,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:29:49,459 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:29:49,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:29:49,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:29:49,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:29:49,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:29:49,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:29:49,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:29:49,486 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:29:49,487 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:29:49,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:29:49,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:29:49,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:29:49,488 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:29:49,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:29:49,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:29:49,489 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:29:49,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:29:49,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:29:49,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:29:49,491 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:29:49,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:29:49,491 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:29:49,492 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:29:49,492 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:29:49,492 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:29:49,492 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:29:49,493 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:29:49,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:29:49,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:29:49,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:29:49,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:29:49,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:29:49,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:29:49,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:29:49,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:29:49,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:29:49,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:29:49,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:29:49,496 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:29:49,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:29:49,496 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 -> 2fec0dbf4b6ddb0b1603ab7a0ec8993384a9d6ffa347e857313f4dbf633d9cf3 [2024-11-09 19:29:49,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:29:49,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:29:49,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:29:49,709 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:29:49,709 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:29:49,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label56.c [2024-11-09 19:29:50,998 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:29:51,291 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:29:51,293 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label56.c [2024-11-09 19:29:51,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cecea7be1/26f7fd80b5b24d8387081d5a77fd94ce/FLAGdf6f6d120 [2024-11-09 19:29:51,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cecea7be1/26f7fd80b5b24d8387081d5a77fd94ce [2024-11-09 19:29:51,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:29:51,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:29:51,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:29:51,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:29:51,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:29:51,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:29:51" (1/1) ... [2024-11-09 19:29:51,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dcb3e58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:51, skipping insertion in model container [2024-11-09 19:29:51,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:29:51" (1/1) ... [2024-11-09 19:29:51,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:29:51,709 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/Problem12_label56.c[6959,6972] [2024-11-09 19:29:52,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:29:52,276 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:29:52,295 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/Problem12_label56.c[6959,6972] [2024-11-09 19:29:52,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:29:52,702 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:29:52,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:52 WrapperNode [2024-11-09 19:29:52,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:29:52,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:29:52,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:29:52,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:29:52,710 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:29:52" (1/1) ... [2024-11-09 19:29:52,747 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:29:52" (1/1) ... [2024-11-09 19:29:52,899 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4760 [2024-11-09 19:29:52,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:29:52,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:29:52,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:29:52,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:29:52,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:52" (1/1) ... [2024-11-09 19:29:52,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:52" (1/1) ... [2024-11-09 19:29:52,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:52" (1/1) ... [2024-11-09 19:29:53,212 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:29:53,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:52" (1/1) ... [2024-11-09 19:29:53,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:52" (1/1) ... [2024-11-09 19:29:53,310 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:52" (1/1) ... [2024-11-09 19:29:53,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:52" (1/1) ... [2024-11-09 19:29:53,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:52" (1/1) ... [2024-11-09 19:29:53,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:52" (1/1) ... [2024-11-09 19:29:53,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:29:53,393 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:29:53,393 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:29:53,393 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:29:53,394 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:52" (1/1) ... [2024-11-09 19:29:53,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:29:53,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:29:53,418 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:29:53,420 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:29:53,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:29:53,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:29:53,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:29:53,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:29:53,577 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:29:53,579 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:29:58,185 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2024-11-09 19:29:58,185 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2024-11-09 19:29:58,185 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2024-11-09 19:29:58,543 INFO L? ?]: Removed 2039 outVars from TransFormulas that were not future-live. [2024-11-09 19:29:58,543 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:29:58,582 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:29:58,582 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:29:58,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:29:58 BoogieIcfgContainer [2024-11-09 19:29:58,583 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:29:58,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:29:58,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:29:58,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:29:58,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:29:51" (1/3) ... [2024-11-09 19:29:58,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac9293b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:29:58, skipping insertion in model container [2024-11-09 19:29:58,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:52" (2/3) ... [2024-11-09 19:29:58,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac9293b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:29:58, skipping insertion in model container [2024-11-09 19:29:58,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:29:58" (3/3) ... [2024-11-09 19:29:58,593 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label56.c [2024-11-09 19:29:58,605 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:29:58,606 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:29:58,680 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:29:58,685 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;@3f56ad78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:29:58,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:29:58,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 821 states, 819 states have (on average 2.744810744810745) internal successors, (2248), 820 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states 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:29:58,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 19:29:58,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:29:58,699 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:29:58,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:29:58,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:29:58,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1044828307, now seen corresponding path program 1 times [2024-11-09 19:29:58,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:29:58,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597552226] [2024-11-09 19:29:58,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:29:58,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:29:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:29:59,005 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:29:59,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:29:59,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597552226] [2024-11-09 19:29:59,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597552226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:29:59,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:29:59,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:29:59,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842885073] [2024-11-09 19:29:59,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:29:59,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:29:59,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:29:59,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:29:59,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:29:59,049 INFO L87 Difference]: Start difference. First operand has 821 states, 819 states have (on average 2.744810744810745) internal successors, (2248), 820 states have internal predecessors, (2248), 0 states have call successors, (0), 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 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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:30:03,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:03,285 INFO L93 Difference]: Finished difference Result 2410 states and 6691 transitions. [2024-11-09 19:30:03,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:03,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-11-09 19:30:03,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:03,315 INFO L225 Difference]: With dead ends: 2410 [2024-11-09 19:30:03,315 INFO L226 Difference]: Without dead ends: 1509 [2024-11-09 19:30:03,319 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:30:03,322 INFO L432 NwaCegarLoop]: 517 mSDtfsCounter, 1444 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3697 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 4393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 3697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:03,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 529 Invalid, 4393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 3697 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 19:30:03,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2024-11-09 19:30:03,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509. [2024-11-09 19:30:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 2.5072944297082227) internal successors, (3781), 1508 states have internal predecessors, (3781), 0 states have call successors, (0), 0 states 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:30:03,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 3781 transitions. [2024-11-09 19:30:03,410 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 3781 transitions. Word has length 58 [2024-11-09 19:30:03,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:03,411 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 3781 transitions. [2024-11-09 19:30:03,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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:30:03,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 3781 transitions. [2024-11-09 19:30:03,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 19:30:03,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:03,417 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:03,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:30:03,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:03,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:03,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1533336959, now seen corresponding path program 1 times [2024-11-09 19:30:03,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:03,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079508647] [2024-11-09 19:30:03,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:03,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:30:03,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:03,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079508647] [2024-11-09 19:30:03,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079508647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:03,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:03,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:30:03,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132047850] [2024-11-09 19:30:03,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:03,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 19:30:03,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:03,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 19:30:03,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:30:03,818 INFO L87 Difference]: Start difference. First operand 1509 states and 3781 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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:30:08,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:08,133 INFO L93 Difference]: Finished difference Result 3768 states and 9220 transitions. [2024-11-09 19:30:08,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:30:08,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2024-11-09 19:30:08,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:08,140 INFO L225 Difference]: With dead ends: 3768 [2024-11-09 19:30:08,141 INFO L226 Difference]: Without dead ends: 2261 [2024-11-09 19:30:08,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:30:08,143 INFO L432 NwaCegarLoop]: 693 mSDtfsCounter, 2938 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 5192 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2938 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 5413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 5192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:08,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2938 Valid, 1175 Invalid, 5413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 5192 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-09 19:30:08,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2024-11-09 19:30:08,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2261. [2024-11-09 19:30:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2260 states have (on average 2.3092920353982302) internal successors, (5219), 2260 states have internal predecessors, (5219), 0 states have call successors, (0), 0 states 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:30:08,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 5219 transitions. [2024-11-09 19:30:08,174 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 5219 transitions. Word has length 134 [2024-11-09 19:30:08,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:08,174 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 5219 transitions. [2024-11-09 19:30:08,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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:30:08,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 5219 transitions. [2024-11-09 19:30:08,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-09 19:30:08,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:08,178 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:30:08,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:30:08,178 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:08,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:08,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1868775559, now seen corresponding path program 1 times [2024-11-09 19:30:08,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:08,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796718874] [2024-11-09 19:30:08,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:08,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 19:30:08,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:08,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796718874] [2024-11-09 19:30:08,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796718874] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:30:08,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956666286] [2024-11-09 19:30:08,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:08,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:30:08,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:30:08,555 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:30:08,563 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:30:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:08,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:30:08,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:30:08,898 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-09 19:30:08,899 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:30:08,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956666286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:08,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:30:08,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-09 19:30:08,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605457272] [2024-11-09 19:30:08,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:08,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:08,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:08,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:08,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:30:08,901 INFO L87 Difference]: Start difference. First operand 2261 states and 5219 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:30:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:12,842 INFO L93 Difference]: Finished difference Result 5272 states and 12775 transitions. [2024-11-09 19:30:12,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:12,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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 200 [2024-11-09 19:30:12,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:12,867 INFO L225 Difference]: With dead ends: 5272 [2024-11-09 19:30:12,867 INFO L226 Difference]: Without dead ends: 3765 [2024-11-09 19:30:12,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:30:12,875 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 1342 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3701 mSolverCounterSat, 585 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 4286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 585 IncrementalHoareTripleChecker+Valid, 3701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:12,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 515 Invalid, 4286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [585 Valid, 3701 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-09 19:30:12,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2024-11-09 19:30:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 3765. [2024-11-09 19:30:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3765 states, 3764 states have (on average 2.2446865037194472) internal successors, (8449), 3764 states have internal predecessors, (8449), 0 states have call successors, (0), 0 states 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:30:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 8449 transitions. [2024-11-09 19:30:12,978 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 8449 transitions. Word has length 200 [2024-11-09 19:30:12,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:12,980 INFO L471 AbstractCegarLoop]: Abstraction has 3765 states and 8449 transitions. [2024-11-09 19:30:12,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:30:12,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 8449 transitions. [2024-11-09 19:30:12,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-09 19:30:12,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:12,989 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:30:13,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:30:13,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:30:13,190 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:13,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:13,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1200333085, now seen corresponding path program 1 times [2024-11-09 19:30:13,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:13,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654689866] [2024-11-09 19:30:13,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:13,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:13,458 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 19:30:13,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:13,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654689866] [2024-11-09 19:30:13,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654689866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:13,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:13,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:13,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503550011] [2024-11-09 19:30:13,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:13,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:30:13,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:13,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:30:13,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:30:13,462 INFO L87 Difference]: Start difference. First operand 3765 states and 8449 transitions. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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:30:18,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:18,481 INFO L93 Difference]: Finished difference Result 8318 states and 18678 transitions. [2024-11-09 19:30:18,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:30:18,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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 206 [2024-11-09 19:30:18,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:18,495 INFO L225 Difference]: With dead ends: 8318 [2024-11-09 19:30:18,495 INFO L226 Difference]: Without dead ends: 5269 [2024-11-09 19:30:18,498 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:30:18,498 INFO L432 NwaCegarLoop]: 697 mSDtfsCounter, 1368 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5844 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 6051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 5844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:18,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 719 Invalid, 6051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 5844 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-09 19:30:18,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5269 states. [2024-11-09 19:30:18,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5269 to 5269. [2024-11-09 19:30:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5269 states, 5268 states have (on average 2.1575550493545936) internal successors, (11366), 5268 states have internal predecessors, (11366), 0 states have call successors, (0), 0 states 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:30:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5269 states to 5269 states and 11366 transitions. [2024-11-09 19:30:18,566 INFO L78 Accepts]: Start accepts. Automaton has 5269 states and 11366 transitions. Word has length 206 [2024-11-09 19:30:18,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:18,567 INFO L471 AbstractCegarLoop]: Abstraction has 5269 states and 11366 transitions. [2024-11-09 19:30:18,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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:30:18,567 INFO L276 IsEmpty]: Start isEmpty. Operand 5269 states and 11366 transitions. [2024-11-09 19:30:18,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-09 19:30:18,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:18,569 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:18,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:30:18,570 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:18,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:18,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2077770775, now seen corresponding path program 1 times [2024-11-09 19:30:18,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:18,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230053744] [2024-11-09 19:30:18,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:18,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:18,798 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-09 19:30:18,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:18,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230053744] [2024-11-09 19:30:18,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230053744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:18,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:18,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:18,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575918018] [2024-11-09 19:30:18,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:18,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:30:18,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:18,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:30:18,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:30:18,800 INFO L87 Difference]: Start difference. First operand 5269 states and 11366 transitions. Second operand has 4 states, 4 states have (on average 50.5) 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:30:23,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:23,662 INFO L93 Difference]: Finished difference Result 12871 states and 28305 transitions. [2024-11-09 19:30:23,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:30:23,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) 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 272 [2024-11-09 19:30:23,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:23,685 INFO L225 Difference]: With dead ends: 12871 [2024-11-09 19:30:23,685 INFO L226 Difference]: Without dead ends: 8280 [2024-11-09 19:30:23,689 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:30:23,689 INFO L432 NwaCegarLoop]: 495 mSDtfsCounter, 1531 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5508 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 6061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 5508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:23,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1531 Valid, 514 Invalid, 6061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 5508 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-09 19:30:23,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8280 states. [2024-11-09 19:30:23,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8280 to 8277. [2024-11-09 19:30:23,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8277 states, 8276 states have (on average 2.126389560173997) internal successors, (17598), 8276 states have internal predecessors, (17598), 0 states have call successors, (0), 0 states 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:30:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8277 states to 8277 states and 17598 transitions. [2024-11-09 19:30:23,790 INFO L78 Accepts]: Start accepts. Automaton has 8277 states and 17598 transitions. Word has length 272 [2024-11-09 19:30:23,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:23,791 INFO L471 AbstractCegarLoop]: Abstraction has 8277 states and 17598 transitions. [2024-11-09 19:30:23,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) 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:30:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 8277 states and 17598 transitions. [2024-11-09 19:30:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-11-09 19:30:23,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:23,793 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:23,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:30:23,794 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:23,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:23,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1444889739, now seen corresponding path program 1 times [2024-11-09 19:30:23,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:23,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675205365] [2024-11-09 19:30:23,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:23,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-09 19:30:23,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:23,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675205365] [2024-11-09 19:30:23,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675205365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:23,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:23,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:30:23,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439459496] [2024-11-09 19:30:23,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:23,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:23,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:23,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:23,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:23,921 INFO L87 Difference]: Start difference. First operand 8277 states and 17598 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 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:30:28,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:28,052 INFO L93 Difference]: Finished difference Result 23320 states and 49914 transitions. [2024-11-09 19:30:28,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:28,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 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 275 [2024-11-09 19:30:28,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:28,081 INFO L225 Difference]: With dead ends: 23320 [2024-11-09 19:30:28,081 INFO L226 Difference]: Without dead ends: 15797 [2024-11-09 19:30:28,089 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:30:28,090 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 1374 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3327 mSolverCounterSat, 841 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 4168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 841 IncrementalHoareTripleChecker+Valid, 3327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:28,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 426 Invalid, 4168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [841 Valid, 3327 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-09 19:30:28,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15797 states. [2024-11-09 19:30:28,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15797 to 14293. [2024-11-09 19:30:28,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14293 states, 14292 states have (on average 2.068919675342849) internal successors, (29569), 14292 states have internal predecessors, (29569), 0 states have call successors, (0), 0 states 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:30:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14293 states to 14293 states and 29569 transitions. [2024-11-09 19:30:28,268 INFO L78 Accepts]: Start accepts. Automaton has 14293 states and 29569 transitions. Word has length 275 [2024-11-09 19:30:28,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:28,268 INFO L471 AbstractCegarLoop]: Abstraction has 14293 states and 29569 transitions. [2024-11-09 19:30:28,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 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:30:28,269 INFO L276 IsEmpty]: Start isEmpty. Operand 14293 states and 29569 transitions. [2024-11-09 19:30:28,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-11-09 19:30:28,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:28,271 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:28,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:30:28,272 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:28,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:28,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1932640813, now seen corresponding path program 1 times [2024-11-09 19:30:28,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:28,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405599663] [2024-11-09 19:30:28,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:28,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:30:28,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:28,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405599663] [2024-11-09 19:30:28,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405599663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:28,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:28,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:28,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405236244] [2024-11-09 19:30:28,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:28,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:28,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:28,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:28,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:28,396 INFO L87 Difference]: Start difference. First operand 14293 states and 29569 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states 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:30:32,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:32,370 INFO L93 Difference]: Finished difference Result 41368 states and 85827 transitions. [2024-11-09 19:30:32,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:32,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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 286 [2024-11-09 19:30:32,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:32,411 INFO L225 Difference]: With dead ends: 41368 [2024-11-09 19:30:32,412 INFO L226 Difference]: Without dead ends: 27829 [2024-11-09 19:30:32,423 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:30:32,423 INFO L432 NwaCegarLoop]: 2061 mSDtfsCounter, 1347 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 4080 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1347 SdHoareTripleChecker+Valid, 2071 SdHoareTripleChecker+Invalid, 4441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 4080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:32,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1347 Valid, 2071 Invalid, 4441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 4080 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-09 19:30:32,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27829 states. [2024-11-09 19:30:32,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27829 to 24821. [2024-11-09 19:30:32,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24821 states, 24820 states have (on average 2.062530217566479) internal successors, (51192), 24820 states have internal predecessors, (51192), 0 states have call successors, (0), 0 states 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:30:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24821 states to 24821 states and 51192 transitions. [2024-11-09 19:30:32,698 INFO L78 Accepts]: Start accepts. Automaton has 24821 states and 51192 transitions. Word has length 286 [2024-11-09 19:30:32,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:32,699 INFO L471 AbstractCegarLoop]: Abstraction has 24821 states and 51192 transitions. [2024-11-09 19:30:32,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states 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:30:32,699 INFO L276 IsEmpty]: Start isEmpty. Operand 24821 states and 51192 transitions. [2024-11-09 19:30:32,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-11-09 19:30:32,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:32,702 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:32,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:30:32,703 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:32,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:32,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1924071585, now seen corresponding path program 1 times [2024-11-09 19:30:32,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:32,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245875651] [2024-11-09 19:30:32,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:32,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-09 19:30:32,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:32,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245875651] [2024-11-09 19:30:32,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245875651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:32,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:32,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:32,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446642485] [2024-11-09 19:30:32,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:32,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:32,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:32,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:32,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:32,819 INFO L87 Difference]: Start difference. First operand 24821 states and 51192 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states 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:30:36,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:36,315 INFO L93 Difference]: Finished difference Result 48888 states and 100945 transitions. [2024-11-09 19:30:36,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:36,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 290 [2024-11-09 19:30:36,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:36,350 INFO L225 Difference]: With dead ends: 48888 [2024-11-09 19:30:36,350 INFO L226 Difference]: Without dead ends: 24821 [2024-11-09 19:30:36,367 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:30:36,368 INFO L432 NwaCegarLoop]: 1668 mSDtfsCounter, 1451 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3657 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1451 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 4047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 3657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:36,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1451 Valid, 1678 Invalid, 4047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 3657 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 19:30:36,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24821 states. [2024-11-09 19:30:36,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24821 to 24821. [2024-11-09 19:30:36,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24821 states, 24820 states have (on average 2.031385979049154) internal successors, (50419), 24820 states have internal predecessors, (50419), 0 states have call successors, (0), 0 states 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:30:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24821 states to 24821 states and 50419 transitions. [2024-11-09 19:30:36,628 INFO L78 Accepts]: Start accepts. Automaton has 24821 states and 50419 transitions. Word has length 290 [2024-11-09 19:30:36,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:36,629 INFO L471 AbstractCegarLoop]: Abstraction has 24821 states and 50419 transitions. [2024-11-09 19:30:36,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states 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:30:36,629 INFO L276 IsEmpty]: Start isEmpty. Operand 24821 states and 50419 transitions. [2024-11-09 19:30:36,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-11-09 19:30:36,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:36,634 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:36,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:30:36,634 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:36,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:36,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1397647237, now seen corresponding path program 1 times [2024-11-09 19:30:36,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:36,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083604060] [2024-11-09 19:30:36,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:36,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:36,863 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-09 19:30:36,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:36,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083604060] [2024-11-09 19:30:36,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083604060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:36,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:36,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:36,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409558751] [2024-11-09 19:30:36,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:36,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:36,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:36,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:36,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:36,870 INFO L87 Difference]: Start difference. First operand 24821 states and 50419 transitions. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:30:40,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:40,706 INFO L93 Difference]: Finished difference Result 60168 states and 123077 transitions. [2024-11-09 19:30:40,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:40,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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 360 [2024-11-09 19:30:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:40,761 INFO L225 Difference]: With dead ends: 60168 [2024-11-09 19:30:40,761 INFO L226 Difference]: Without dead ends: 36101 [2024-11-09 19:30:40,791 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:30:40,791 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 1388 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3596 mSolverCounterSat, 659 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 4255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 659 IncrementalHoareTripleChecker+Valid, 3596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:40,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1388 Valid, 462 Invalid, 4255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [659 Valid, 3596 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:30:40,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36101 states. [2024-11-09 19:30:41,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36101 to 35349. [2024-11-09 19:30:41,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35349 states, 35348 states have (on average 2.030242163630191) internal successors, (71765), 35348 states have internal predecessors, (71765), 0 states have call successors, (0), 0 states 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:30:41,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35349 states to 35349 states and 71765 transitions. [2024-11-09 19:30:41,349 INFO L78 Accepts]: Start accepts. Automaton has 35349 states and 71765 transitions. Word has length 360 [2024-11-09 19:30:41,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:41,350 INFO L471 AbstractCegarLoop]: Abstraction has 35349 states and 71765 transitions. [2024-11-09 19:30:41,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:30:41,350 INFO L276 IsEmpty]: Start isEmpty. Operand 35349 states and 71765 transitions. [2024-11-09 19:30:41,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2024-11-09 19:30:41,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:41,357 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:41,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:30:41,357 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:41,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:41,358 INFO L85 PathProgramCache]: Analyzing trace with hash 216210213, now seen corresponding path program 1 times [2024-11-09 19:30:41,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:41,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738224572] [2024-11-09 19:30:41,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:41,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:41,634 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-09 19:30:41,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:41,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738224572] [2024-11-09 19:30:41,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738224572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:41,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:41,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:41,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090706757] [2024-11-09 19:30:41,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:41,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:41,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:41,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:41,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:41,636 INFO L87 Difference]: Start difference. First operand 35349 states and 71765 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:45,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:45,145 INFO L93 Difference]: Finished difference Result 83480 states and 169049 transitions. [2024-11-09 19:30:45,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:45,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 392 [2024-11-09 19:30:45,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:45,202 INFO L225 Difference]: With dead ends: 83480 [2024-11-09 19:30:45,202 INFO L226 Difference]: Without dead ends: 43621 [2024-11-09 19:30:45,222 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:30:45,222 INFO L432 NwaCegarLoop]: 1991 mSDtfsCounter, 1419 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3322 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1419 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 3706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 3322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:45,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1419 Valid, 2001 Invalid, 3706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 3322 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-09 19:30:45,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43621 states. [2024-11-09 19:30:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43621 to 39861. [2024-11-09 19:30:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39861 states, 39860 states have (on average 2.0148519819367787) internal successors, (80312), 39860 states have internal predecessors, (80312), 0 states have call successors, (0), 0 states 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:30:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39861 states to 39861 states and 80312 transitions. [2024-11-09 19:30:46,005 INFO L78 Accepts]: Start accepts. Automaton has 39861 states and 80312 transitions. Word has length 392 [2024-11-09 19:30:46,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:46,006 INFO L471 AbstractCegarLoop]: Abstraction has 39861 states and 80312 transitions. [2024-11-09 19:30:46,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:46,006 INFO L276 IsEmpty]: Start isEmpty. Operand 39861 states and 80312 transitions. [2024-11-09 19:30:46,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2024-11-09 19:30:46,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:46,013 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:30:46,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:30:46,013 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:46,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:46,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1659924781, now seen corresponding path program 1 times [2024-11-09 19:30:46,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:46,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198618440] [2024-11-09 19:30:46,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:46,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:46,491 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-09 19:30:46,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:46,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198618440] [2024-11-09 19:30:46,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198618440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:46,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:46,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:46,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067897521] [2024-11-09 19:30:46,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:46,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:46,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:46,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:46,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:46,494 INFO L87 Difference]: Start difference. First operand 39861 states and 80312 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) 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:30:50,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:50,338 INFO L93 Difference]: Finished difference Result 98520 states and 199458 transitions. [2024-11-09 19:30:50,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:50,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) 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 479 [2024-11-09 19:30:50,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:50,418 INFO L225 Difference]: With dead ends: 98520 [2024-11-09 19:30:50,419 INFO L226 Difference]: Without dead ends: 59413 [2024-11-09 19:30:50,439 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:30:50,439 INFO L432 NwaCegarLoop]: 1966 mSDtfsCounter, 1402 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3493 mSolverCounterSat, 636 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 4129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 636 IncrementalHoareTripleChecker+Valid, 3493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:50,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1402 Valid, 1976 Invalid, 4129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [636 Valid, 3493 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 19:30:50,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59413 states. [2024-11-09 19:30:51,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59413 to 57909. [2024-11-09 19:30:51,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57909 states, 57908 states have (on average 2.0012951578365685) internal successors, (115891), 57908 states have internal predecessors, (115891), 0 states have call successors, (0), 0 states 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:30:51,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57909 states to 57909 states and 115891 transitions. [2024-11-09 19:30:51,322 INFO L78 Accepts]: Start accepts. Automaton has 57909 states and 115891 transitions. Word has length 479 [2024-11-09 19:30:51,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:51,324 INFO L471 AbstractCegarLoop]: Abstraction has 57909 states and 115891 transitions. [2024-11-09 19:30:51,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) 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:30:51,324 INFO L276 IsEmpty]: Start isEmpty. Operand 57909 states and 115891 transitions. [2024-11-09 19:30:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2024-11-09 19:30:51,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:51,343 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:51,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:30:51,343 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:51,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:51,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1044734211, now seen corresponding path program 1 times [2024-11-09 19:30:51,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:51,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125682545] [2024-11-09 19:30:51,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:51,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-11-09 19:30:52,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:52,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125682545] [2024-11-09 19:30:52,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125682545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:52,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:52,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:52,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884607234] [2024-11-09 19:30:52,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:52,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:52,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:52,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:52,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:52,202 INFO L87 Difference]: Start difference. First operand 57909 states and 115891 transitions. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:30:56,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:56,268 INFO L93 Difference]: Finished difference Result 133112 states and 267354 transitions. [2024-11-09 19:30:56,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:56,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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 578 [2024-11-09 19:30:56,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:56,498 INFO L225 Difference]: With dead ends: 133112 [2024-11-09 19:30:56,498 INFO L226 Difference]: Without dead ends: 75957 [2024-11-09 19:30:56,517 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:30:56,518 INFO L432 NwaCegarLoop]: 1907 mSDtfsCounter, 1268 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3595 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 4108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 3595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:56,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 1915 Invalid, 4108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 3595 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:30:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75957 states. [2024-11-09 19:30:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75957 to 73701. [2024-11-09 19:30:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73701 states, 73700 states have (on average 1.993202170963365) internal successors, (146899), 73700 states have internal predecessors, (146899), 0 states have call successors, (0), 0 states 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:30:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73701 states to 73701 states and 146899 transitions. [2024-11-09 19:30:57,813 INFO L78 Accepts]: Start accepts. Automaton has 73701 states and 146899 transitions. Word has length 578 [2024-11-09 19:30:57,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:57,813 INFO L471 AbstractCegarLoop]: Abstraction has 73701 states and 146899 transitions. [2024-11-09 19:30:57,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:30:57,813 INFO L276 IsEmpty]: Start isEmpty. Operand 73701 states and 146899 transitions. [2024-11-09 19:30:57,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2024-11-09 19:30:57,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:57,872 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:30:57,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:30:57,873 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:57,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:57,873 INFO L85 PathProgramCache]: Analyzing trace with hash 565689867, now seen corresponding path program 1 times [2024-11-09 19:30:57,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:57,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906742746] [2024-11-09 19:30:57,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:57,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1328 backedges. 1011 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2024-11-09 19:30:58,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:58,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906742746] [2024-11-09 19:30:58,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906742746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:58,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:58,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:58,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025818969] [2024-11-09 19:30:58,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:58,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:58,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:58,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:58,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:58,415 INFO L87 Difference]: Start difference. First operand 73701 states and 146899 transitions. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:02,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:31:02,480 INFO L93 Difference]: Finished difference Result 148904 states and 296703 transitions. [2024-11-09 19:31:02,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:31:02,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 713 [2024-11-09 19:31:02,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:31:02,585 INFO L225 Difference]: With dead ends: 148904 [2024-11-09 19:31:02,585 INFO L226 Difference]: Without dead ends: 72949 [2024-11-09 19:31:02,605 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:31:02,606 INFO L432 NwaCegarLoop]: 1862 mSDtfsCounter, 1362 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3465 mSolverCounterSat, 533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 3998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 3465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:31:02,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1362 Valid, 1870 Invalid, 3998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 3465 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 19:31:02,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72949 states. [2024-11-09 19:31:03,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72949 to 69189. [2024-11-09 19:31:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69189 states, 69188 states have (on average 1.9640833670578712) internal successors, (135891), 69188 states have internal predecessors, (135891), 0 states have call successors, (0), 0 states 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:31:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69189 states to 69189 states and 135891 transitions. [2024-11-09 19:31:03,680 INFO L78 Accepts]: Start accepts. Automaton has 69189 states and 135891 transitions. Word has length 713 [2024-11-09 19:31:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:31:03,680 INFO L471 AbstractCegarLoop]: Abstraction has 69189 states and 135891 transitions. [2024-11-09 19:31:03,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 69189 states and 135891 transitions. [2024-11-09 19:31:03,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 763 [2024-11-09 19:31:03,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:31:03,707 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:03,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:31:03,707 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:31:03,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:31:03,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1656633628, now seen corresponding path program 1 times [2024-11-09 19:31:03,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:31:03,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028327674] [2024-11-09 19:31:03,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:03,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:31:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:31:05,094 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 774 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2024-11-09 19:31:05,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:31:05,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028327674] [2024-11-09 19:31:05,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028327674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:31:05,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:31:05,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:31:05,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326005293] [2024-11-09 19:31:05,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:31:05,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:31:05,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:31:05,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:31:05,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:31:05,097 INFO L87 Difference]: Start difference. First operand 69189 states and 135891 transitions. Second operand has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 states 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:31:09,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:31:09,334 INFO L93 Difference]: Finished difference Result 164696 states and 324443 transitions. [2024-11-09 19:31:09,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:31:09,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 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 762 [2024-11-09 19:31:09,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:31:09,455 INFO L225 Difference]: With dead ends: 164696 [2024-11-09 19:31:09,456 INFO L226 Difference]: Without dead ends: 96261 [2024-11-09 19:31:09,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:31:09,475 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 1438 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3368 mSolverCounterSat, 741 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 4109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 741 IncrementalHoareTripleChecker+Valid, 3368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:31:09,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1438 Valid, 254 Invalid, 4109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [741 Valid, 3368 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 19:31:09,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96261 states. [2024-11-09 19:31:10,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96261 to 94757. [2024-11-09 19:31:10,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94757 states, 94756 states have (on average 1.9656380598590062) internal successors, (186256), 94756 states have internal predecessors, (186256), 0 states have call successors, (0), 0 states 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:31:10,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94757 states to 94757 states and 186256 transitions. [2024-11-09 19:31:10,829 INFO L78 Accepts]: Start accepts. Automaton has 94757 states and 186256 transitions. Word has length 762 [2024-11-09 19:31:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:31:10,829 INFO L471 AbstractCegarLoop]: Abstraction has 94757 states and 186256 transitions. [2024-11-09 19:31:10,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 states 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:31:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 94757 states and 186256 transitions. [2024-11-09 19:31:10,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 771 [2024-11-09 19:31:10,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:31:10,858 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:10,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 19:31:10,858 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:31:10,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:31:10,859 INFO L85 PathProgramCache]: Analyzing trace with hash -19733508, now seen corresponding path program 1 times [2024-11-09 19:31:10,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:31:10,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531183769] [2024-11-09 19:31:10,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:10,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:31:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:31:11,194 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 782 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-09 19:31:11,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:31:11,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531183769] [2024-11-09 19:31:11,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531183769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:31:11,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:31:11,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:31:11,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46879483] [2024-11-09 19:31:11,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:31:11,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:31:11,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:31:11,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:31:11,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:31:11,198 INFO L87 Difference]: Start difference. First operand 94757 states and 186256 transitions. Second operand has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states 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:31:15,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:31:15,377 INFO L93 Difference]: Finished difference Result 232376 states and 456706 transitions. [2024-11-09 19:31:15,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:31:15,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 770 [2024-11-09 19:31:15,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:31:15,600 INFO L225 Difference]: With dead ends: 232376 [2024-11-09 19:31:15,601 INFO L226 Difference]: Without dead ends: 138373 [2024-11-09 19:31:15,657 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:31:15,657 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 1348 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3722 mSolverCounterSat, 559 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 4281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 559 IncrementalHoareTripleChecker+Valid, 3722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:31:15,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 277 Invalid, 4281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [559 Valid, 3722 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 19:31:15,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138373 states. [2024-11-09 19:31:17,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138373 to 111301. [2024-11-09 19:31:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111301 states, 111300 states have (on average 1.9683018867924529) internal successors, (219072), 111300 states have internal predecessors, (219072), 0 states have call successors, (0), 0 states 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:31:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111301 states to 111301 states and 219072 transitions. [2024-11-09 19:31:17,536 INFO L78 Accepts]: Start accepts. Automaton has 111301 states and 219072 transitions. Word has length 770 [2024-11-09 19:31:17,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:31:17,537 INFO L471 AbstractCegarLoop]: Abstraction has 111301 states and 219072 transitions. [2024-11-09 19:31:17,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states 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:31:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 111301 states and 219072 transitions. [2024-11-09 19:31:17,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 789 [2024-11-09 19:31:17,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:31:17,563 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:17,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 19:31:17,563 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:31:17,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:31:17,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1103228119, now seen corresponding path program 1 times [2024-11-09 19:31:17,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:31:17,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014901172] [2024-11-09 19:31:17,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:17,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:31:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat