./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/Problem15_label10.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 7f151a13e47989a65c4ec5b5333c24fda53f0a15e0e3e933f79a23263bfef839 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 17:06:34,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 17:06:34,911 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 17:06:34,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 17:06:34,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 17:06:34,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 17:06:34,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 17:06:34,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 17:06:34,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 17:06:34,944 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 17:06:34,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 17:06:34,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 17:06:34,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 17:06:34,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 17:06:34,948 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 17:06:34,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 17:06:34,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 17:06:34,949 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 17:06:34,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 17:06:34,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 17:06:34,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 17:06:34,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 17:06:34,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 17:06:34,951 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 17:06:34,951 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 17:06:34,952 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 17:06:34,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 17:06:34,952 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 17:06:34,953 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 17:06:34,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 17:06:34,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 17:06:34,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 17:06:34,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:06:34,954 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 17:06:34,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 17:06:34,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 17:06:34,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 17:06:34,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 17:06:34,955 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 17:06:34,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 17:06:34,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 17:06:34,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 17:06:34,956 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 -> 7f151a13e47989a65c4ec5b5333c24fda53f0a15e0e3e933f79a23263bfef839 [2024-11-11 17:06:35,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 17:06:35,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 17:06:35,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 17:06:35,236 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 17:06:35,237 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 17:06:35,238 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label10.c [2024-11-11 17:06:36,681 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 17:06:36,998 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 17:06:36,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label10.c [2024-11-11 17:06:37,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a30acd4f/496546e36b104628af0025303fa14b4d/FLAG287d8ef53 [2024-11-11 17:06:37,042 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a30acd4f/496546e36b104628af0025303fa14b4d [2024-11-11 17:06:37,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 17:06:37,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 17:06:37,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 17:06:37,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 17:06:37,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 17:06:37,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:06:37" (1/1) ... [2024-11-11 17:06:37,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237afa37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:06:37, skipping insertion in model container [2024-11-11 17:06:37,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:06:37" (1/1) ... [2024-11-11 17:06:37,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 17:06:37,356 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/Problem15_label10.c[4275,4288] [2024-11-11 17:06:37,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:06:37,812 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 17:06:37,839 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/Problem15_label10.c[4275,4288] [2024-11-11 17:06:38,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:06:38,037 INFO L204 MainTranslator]: Completed translation [2024-11-11 17:06:38,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:06:38 WrapperNode [2024-11-11 17:06:38,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 17:06:38,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 17:06:38,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 17:06:38,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 17:06:38,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:06:38" (1/1) ... [2024-11-11 17:06:38,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:06:38" (1/1) ... [2024-11-11 17:06:38,251 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-11-11 17:06:38,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 17:06:38,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 17:06:38,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 17:06:38,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 17:06:38,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:06:38" (1/1) ... [2024-11-11 17:06:38,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:06:38" (1/1) ... [2024-11-11 17:06:38,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:06:38" (1/1) ... [2024-11-11 17:06:38,409 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-11 17:06:38,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:06:38" (1/1) ... [2024-11-11 17:06:38,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:06:38" (1/1) ... [2024-11-11 17:06:38,466 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:06:38" (1/1) ... [2024-11-11 17:06:38,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:06:38" (1/1) ... [2024-11-11 17:06:38,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:06:38" (1/1) ... [2024-11-11 17:06:38,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:06:38" (1/1) ... [2024-11-11 17:06:38,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 17:06:38,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 17:06:38,544 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 17:06:38,545 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 17:06:38,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:06:38" (1/1) ... [2024-11-11 17:06:38,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:06:38,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:06:38,576 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-11 17:06:38,579 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-11 17:06:38,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 17:06:38,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 17:06:38,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 17:06:38,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 17:06:38,727 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 17:06:38,729 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 17:06:41,053 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-11-11 17:06:41,053 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 17:06:41,075 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 17:06:41,076 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 17:06:41,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:06:41 BoogieIcfgContainer [2024-11-11 17:06:41,077 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 17:06:41,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 17:06:41,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 17:06:41,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 17:06:41,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 05:06:37" (1/3) ... [2024-11-11 17:06:41,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b28cab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:06:41, skipping insertion in model container [2024-11-11 17:06:41,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:06:38" (2/3) ... [2024-11-11 17:06:41,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b28cab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:06:41, skipping insertion in model container [2024-11-11 17:06:41,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:06:41" (3/3) ... [2024-11-11 17:06:41,084 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label10.c [2024-11-11 17:06:41,100 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 17:06:41,101 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 17:06:41,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 17:06:41,178 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;@7820bfd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 17:06:41,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 17:06:41,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:41,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-11 17:06:41,192 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:06:41,193 INFO L218 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] [2024-11-11 17:06:41,194 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:06:41,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:06:41,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1089129850, now seen corresponding path program 1 times [2024-11-11 17:06:41,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:06:41,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752252447] [2024-11-11 17:06:41,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:06:41,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:06:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:06:41,536 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-11 17:06:41,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:06:41,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752252447] [2024-11-11 17:06:41,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752252447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:06:41,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:06:41,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:06:41,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347798563] [2024-11-11 17:06:41,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:06:41,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:06:41,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:06:41,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:06:41,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:06:41,569 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 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 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:43,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:06:43,827 INFO L93 Difference]: Finished difference Result 1154 states and 2106 transitions. [2024-11-11 17:06:43,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:06:43,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-11 17:06:43,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:06:43,855 INFO L225 Difference]: With dead ends: 1154 [2024-11-11 17:06:43,856 INFO L226 Difference]: Without dead ends: 665 [2024-11-11 17:06:43,860 INFO L434 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-11 17:06:43,864 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 287 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-11 17:06:43,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 383 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-11 17:06:43,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-11 17:06:43,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2024-11-11 17:06:43,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:43,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions. [2024-11-11 17:06:43,962 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 34 [2024-11-11 17:06:43,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:06:43,962 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 981 transitions. [2024-11-11 17:06:43,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:43,963 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions. [2024-11-11 17:06:43,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 17:06:43,968 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:06:43,969 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:06:43,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 17:06:43,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:06:43,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:06:43,971 INFO L85 PathProgramCache]: Analyzing trace with hash 513841653, now seen corresponding path program 1 times [2024-11-11 17:06:43,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:06:43,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219768671] [2024-11-11 17:06:43,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:06:43,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:06:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:06:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:06:44,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:06:44,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219768671] [2024-11-11 17:06:44,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219768671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:06:44,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:06:44,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:06:44,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794716397] [2024-11-11 17:06:44,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:06:44,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:06:44,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:06:44,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:06:44,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:06:44,334 INFO L87 Difference]: Start difference. First operand 663 states and 981 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:45,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:06:45,457 INFO L93 Difference]: Finished difference Result 1624 states and 2315 transitions. [2024-11-11 17:06:45,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:06:45,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-11-11 17:06:45,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:06:45,462 INFO L225 Difference]: With dead ends: 1624 [2024-11-11 17:06:45,462 INFO L226 Difference]: Without dead ends: 963 [2024-11-11 17:06:45,465 INFO L434 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-11 17:06:45,466 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 17:06:45,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 337 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 17:06:45,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-11 17:06:45,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2024-11-11 17:06:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions. [2024-11-11 17:06:45,504 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 99 [2024-11-11 17:06:45,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:06:45,505 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions. [2024-11-11 17:06:45,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:45,505 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions. [2024-11-11 17:06:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 17:06:45,507 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:06:45,507 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:06:45,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 17:06:45,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:06:45,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:06:45,508 INFO L85 PathProgramCache]: Analyzing trace with hash 226015812, now seen corresponding path program 1 times [2024-11-11 17:06:45,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:06:45,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538668689] [2024-11-11 17:06:45,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:06:45,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:06:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:06:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:06:45,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:06:45,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538668689] [2024-11-11 17:06:45,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538668689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:06:45,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:06:45,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:06:45,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372662995] [2024-11-11 17:06:45,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:06:45,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:06:45,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:06:45,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:06:45,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:06:45,667 INFO L87 Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:47,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:06:47,228 INFO L93 Difference]: Finished difference Result 2229 states and 3186 transitions. [2024-11-11 17:06:47,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:06:47,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2024-11-11 17:06:47,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:06:47,236 INFO L225 Difference]: With dead ends: 2229 [2024-11-11 17:06:47,236 INFO L226 Difference]: Without dead ends: 1567 [2024-11-11 17:06:47,238 INFO L434 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-11 17:06:47,239 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 256 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:06:47,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 318 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 17:06:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2024-11-11 17:06:47,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1266. [2024-11-11 17:06:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3043478260869565) internal successors, (1650), 1265 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1650 transitions. [2024-11-11 17:06:47,265 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1650 transitions. Word has length 104 [2024-11-11 17:06:47,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:06:47,267 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1650 transitions. [2024-11-11 17:06:47,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:47,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1650 transitions. [2024-11-11 17:06:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-11 17:06:47,274 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:06:47,274 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:06:47,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 17:06:47,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:06:47,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:06:47,276 INFO L85 PathProgramCache]: Analyzing trace with hash 527806185, now seen corresponding path program 1 times [2024-11-11 17:06:47,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:06:47,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916037311] [2024-11-11 17:06:47,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:06:47,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:06:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:06:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:06:47,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:06:47,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916037311] [2024-11-11 17:06:47,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916037311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:06:47,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:06:47,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:06:47,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624026158] [2024-11-11 17:06:47,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:06:47,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:06:47,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:06:47,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:06:47,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:06:47,558 INFO L87 Difference]: Start difference. First operand 1266 states and 1650 transitions. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:50,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:06:50,214 INFO L93 Difference]: Finished difference Result 4668 states and 6169 transitions. [2024-11-11 17:06:50,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:06:50,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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-11 17:06:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:06:50,228 INFO L225 Difference]: With dead ends: 4668 [2024-11-11 17:06:50,228 INFO L226 Difference]: Without dead ends: 3404 [2024-11-11 17:06:50,233 INFO L434 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-11 17:06:50,237 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 484 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:06:50,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 377 Invalid, 2546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-11 17:06:50,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2024-11-11 17:06:50,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3381. [2024-11-11 17:06:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.2363905325443787) internal successors, (4179), 3380 states have internal predecessors, (4179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:50,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4179 transitions. [2024-11-11 17:06:50,295 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4179 transitions. Word has length 200 [2024-11-11 17:06:50,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:06:50,297 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4179 transitions. [2024-11-11 17:06:50,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:50,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4179 transitions. [2024-11-11 17:06:50,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-11 17:06:50,304 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:06:50,304 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:06:50,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 17:06:50,304 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:06:50,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:06:50,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1817183713, now seen corresponding path program 1 times [2024-11-11 17:06:50,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:06:50,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283755299] [2024-11-11 17:06:50,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:06:50,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:06:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:06:50,504 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-11 17:06:50,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:06:50,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283755299] [2024-11-11 17:06:50,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283755299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:06:50,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:06:50,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:06:50,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885266064] [2024-11-11 17:06:50,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:06:50,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:06:50,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:06:50,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:06:50,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:06:50,507 INFO L87 Difference]: Start difference. First operand 3381 states and 4179 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:51,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:06:51,735 INFO L93 Difference]: Finished difference Result 8563 states and 10751 transitions. [2024-11-11 17:06:51,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:06:51,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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 204 [2024-11-11 17:06:51,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:06:51,754 INFO L225 Difference]: With dead ends: 8563 [2024-11-11 17:06:51,755 INFO L226 Difference]: Without dead ends: 5483 [2024-11-11 17:06:51,760 INFO L434 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-11 17:06:51,761 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 17:06:51,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 339 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 17:06:51,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2024-11-11 17:06:51,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2024-11-11 17:06:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1683403322987036) internal successors, (6399), 5477 states have internal predecessors, (6399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6399 transitions. [2024-11-11 17:06:51,853 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6399 transitions. Word has length 204 [2024-11-11 17:06:51,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:06:51,853 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6399 transitions. [2024-11-11 17:06:51,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:51,854 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6399 transitions. [2024-11-11 17:06:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-11 17:06:51,858 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:06:51,858 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:06:51,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 17:06:51,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:06:51,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:06:51,859 INFO L85 PathProgramCache]: Analyzing trace with hash 224343269, now seen corresponding path program 1 times [2024-11-11 17:06:51,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:06:51,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080935882] [2024-11-11 17:06:51,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:06:51,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:06:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:06:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-11 17:06:52,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:06:52,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080935882] [2024-11-11 17:06:52,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080935882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:06:52,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:06:52,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:06:52,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311960380] [2024-11-11 17:06:52,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:06:52,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:06:52,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:06:52,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:06:52,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:06:52,539 INFO L87 Difference]: Start difference. First operand 5478 states and 6399 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:53,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:06:53,776 INFO L93 Difference]: Finished difference Result 10655 states and 12485 transitions. [2024-11-11 17:06:53,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:06:53,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 306 [2024-11-11 17:06:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:06:53,796 INFO L225 Difference]: With dead ends: 10655 [2024-11-11 17:06:53,796 INFO L226 Difference]: Without dead ends: 5478 [2024-11-11 17:06:53,803 INFO L434 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-11 17:06:53,804 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 17:06:53,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 17:06:53,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2024-11-11 17:06:53,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2024-11-11 17:06:53,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1672448420668249) internal successors, (6393), 5477 states have internal predecessors, (6393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:53,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6393 transitions. [2024-11-11 17:06:53,922 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6393 transitions. Word has length 306 [2024-11-11 17:06:53,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:06:53,924 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6393 transitions. [2024-11-11 17:06:53,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:53,925 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6393 transitions. [2024-11-11 17:06:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-11-11 17:06:53,929 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:06:53,930 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:06:53,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 17:06:53,930 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:06:53,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:06:53,931 INFO L85 PathProgramCache]: Analyzing trace with hash 559264950, now seen corresponding path program 1 times [2024-11-11 17:06:53,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:06:53,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741981046] [2024-11-11 17:06:53,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:06:53,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:06:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:06:54,172 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-11 17:06:54,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:06:54,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741981046] [2024-11-11 17:06:54,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741981046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:06:54,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:06:54,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:06:54,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335593595] [2024-11-11 17:06:54,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:06:54,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:06:54,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:06:54,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:06:54,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:06:54,175 INFO L87 Difference]: Start difference. First operand 5478 states and 6393 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:55,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:06:55,567 INFO L93 Difference]: Finished difference Result 11851 states and 14145 transitions. [2024-11-11 17:06:55,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:06:55,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 321 [2024-11-11 17:06:55,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:06:55,586 INFO L225 Difference]: With dead ends: 11851 [2024-11-11 17:06:55,587 INFO L226 Difference]: Without dead ends: 6674 [2024-11-11 17:06:55,592 INFO L434 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-11 17:06:55,593 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 281 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:06:55,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 322 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 17:06:55,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2024-11-11 17:06:55,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 4577. [2024-11-11 17:06:55,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4577 states, 4576 states have (on average 1.1840034965034965) internal successors, (5418), 4576 states have internal predecessors, (5418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:55,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 5418 transitions. [2024-11-11 17:06:55,666 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 5418 transitions. Word has length 321 [2024-11-11 17:06:55,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:06:55,669 INFO L471 AbstractCegarLoop]: Abstraction has 4577 states and 5418 transitions. [2024-11-11 17:06:55,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:55,669 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 5418 transitions. [2024-11-11 17:06:55,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2024-11-11 17:06:55,674 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:06:55,676 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:06:55,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 17:06:55,676 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:06:55,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:06:55,677 INFO L85 PathProgramCache]: Analyzing trace with hash 11227575, now seen corresponding path program 1 times [2024-11-11 17:06:55,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:06:55,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649208890] [2024-11-11 17:06:55,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:06:55,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:06:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:06:55,969 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-11 17:06:55,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:06:55,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649208890] [2024-11-11 17:06:55,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649208890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:06:55,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:06:55,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:06:55,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095340984] [2024-11-11 17:06:55,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:06:55,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:06:55,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:06:55,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:06:55,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:06:55,973 INFO L87 Difference]: Start difference. First operand 4577 states and 5418 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:57,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:06:57,292 INFO L93 Difference]: Finished difference Result 10955 states and 13233 transitions. [2024-11-11 17:06:57,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:06:57,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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 380 [2024-11-11 17:06:57,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:06:57,310 INFO L225 Difference]: With dead ends: 10955 [2024-11-11 17:06:57,311 INFO L226 Difference]: Without dead ends: 6679 [2024-11-11 17:06:57,316 INFO L434 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-11 17:06:57,317 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 294 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:06:57,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 637 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 17:06:57,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6679 states. [2024-11-11 17:06:57,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6679 to 6081. [2024-11-11 17:06:57,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6081 states, 6080 states have (on average 1.1572368421052632) internal successors, (7036), 6080 states have internal predecessors, (7036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6081 states to 6081 states and 7036 transitions. [2024-11-11 17:06:57,418 INFO L78 Accepts]: Start accepts. Automaton has 6081 states and 7036 transitions. Word has length 380 [2024-11-11 17:06:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:06:57,419 INFO L471 AbstractCegarLoop]: Abstraction has 6081 states and 7036 transitions. [2024-11-11 17:06:57,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:57,423 INFO L276 IsEmpty]: Start isEmpty. Operand 6081 states and 7036 transitions. [2024-11-11 17:06:57,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2024-11-11 17:06:57,431 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:06:57,431 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:06:57,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 17:06:57,432 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:06:57,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:06:57,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1017767819, now seen corresponding path program 1 times [2024-11-11 17:06:57,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:06:57,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717659655] [2024-11-11 17:06:57,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:06:57,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:06:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:06:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:06:57,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:06:57,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717659655] [2024-11-11 17:06:57,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717659655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:06:57,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:06:57,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:06:57,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986160300] [2024-11-11 17:06:57,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:06:57,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:06:57,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:06:57,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:06:57,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:06:57,799 INFO L87 Difference]: Start difference. First operand 6081 states and 7036 transitions. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:59,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:06:59,016 INFO L93 Difference]: Finished difference Result 13965 states and 16476 transitions. [2024-11-11 17:06:59,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:06:59,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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 386 [2024-11-11 17:06:59,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:06:59,030 INFO L225 Difference]: With dead ends: 13965 [2024-11-11 17:06:59,031 INFO L226 Difference]: Without dead ends: 8185 [2024-11-11 17:06:59,037 INFO L434 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-11 17:06:59,038 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 248 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 17:06:59,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 603 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 17:06:59,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8185 states. [2024-11-11 17:06:59,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8185 to 7584. [2024-11-11 17:06:59,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7584 states, 7583 states have (on average 1.1422919688777529) internal successors, (8662), 7583 states have internal predecessors, (8662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7584 states to 7584 states and 8662 transitions. [2024-11-11 17:06:59,125 INFO L78 Accepts]: Start accepts. Automaton has 7584 states and 8662 transitions. Word has length 386 [2024-11-11 17:06:59,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:06:59,126 INFO L471 AbstractCegarLoop]: Abstraction has 7584 states and 8662 transitions. [2024-11-11 17:06:59,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:06:59,127 INFO L276 IsEmpty]: Start isEmpty. Operand 7584 states and 8662 transitions. [2024-11-11 17:06:59,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2024-11-11 17:06:59,133 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:06:59,133 INFO L218 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:06:59,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 17:06:59,133 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:06:59,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:06:59,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2099056187, now seen corresponding path program 1 times [2024-11-11 17:06:59,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:06:59,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193649763] [2024-11-11 17:06:59,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:06:59,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:06:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:06:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-11 17:06:59,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:06:59,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193649763] [2024-11-11 17:06:59,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193649763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:06:59,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:06:59,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:06:59,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814813206] [2024-11-11 17:06:59,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:06:59,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:06:59,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:06:59,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:06:59,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:06:59,602 INFO L87 Difference]: Start difference. First operand 7584 states and 8662 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:07:00,833 INFO L93 Difference]: Finished difference Result 16661 states and 19392 transitions. [2024-11-11 17:07:00,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:07:00,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 403 [2024-11-11 17:07:00,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:07:00,849 INFO L225 Difference]: With dead ends: 16661 [2024-11-11 17:07:00,849 INFO L226 Difference]: Without dead ends: 9378 [2024-11-11 17:07:00,858 INFO L434 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-11 17:07:00,859 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 248 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 17:07:00,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 617 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 17:07:00,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9378 states. [2024-11-11 17:07:00,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9378 to 9374. [2024-11-11 17:07:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9374 states, 9373 states have (on average 1.1297343433265763) internal successors, (10589), 9373 states have internal predecessors, (10589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9374 states to 9374 states and 10589 transitions. [2024-11-11 17:07:00,972 INFO L78 Accepts]: Start accepts. Automaton has 9374 states and 10589 transitions. Word has length 403 [2024-11-11 17:07:00,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:07:00,973 INFO L471 AbstractCegarLoop]: Abstraction has 9374 states and 10589 transitions. [2024-11-11 17:07:00,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:00,974 INFO L276 IsEmpty]: Start isEmpty. Operand 9374 states and 10589 transitions. [2024-11-11 17:07:00,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2024-11-11 17:07:00,979 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:07:00,980 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:07:00,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 17:07:00,980 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:07:00,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:07:00,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1857017877, now seen corresponding path program 1 times [2024-11-11 17:07:00,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:07:00,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127160147] [2024-11-11 17:07:00,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:07:00,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:07:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:07:01,408 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-11 17:07:01,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:07:01,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127160147] [2024-11-11 17:07:01,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127160147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:07:01,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:07:01,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:07:01,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404295166] [2024-11-11 17:07:01,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:07:01,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:07:01,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:07:01,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:07:01,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:07:01,411 INFO L87 Difference]: Start difference. First operand 9374 states and 10589 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:02,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:07:02,851 INFO L93 Difference]: Finished difference Result 24127 states and 27329 transitions. [2024-11-11 17:07:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:07:02,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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 411 [2024-11-11 17:07:02,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:07:02,877 INFO L225 Difference]: With dead ends: 24127 [2024-11-11 17:07:02,877 INFO L226 Difference]: Without dead ends: 15054 [2024-11-11 17:07:02,887 INFO L434 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-11 17:07:02,888 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 346 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:07:02,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 171 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 17:07:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15054 states. [2024-11-11 17:07:03,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15054 to 12064. [2024-11-11 17:07:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12064 states, 12063 states have (on average 1.1369476912874077) internal successors, (13715), 12063 states have internal predecessors, (13715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12064 states to 12064 states and 13715 transitions. [2024-11-11 17:07:03,087 INFO L78 Accepts]: Start accepts. Automaton has 12064 states and 13715 transitions. Word has length 411 [2024-11-11 17:07:03,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:07:03,088 INFO L471 AbstractCegarLoop]: Abstraction has 12064 states and 13715 transitions. [2024-11-11 17:07:03,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:03,089 INFO L276 IsEmpty]: Start isEmpty. Operand 12064 states and 13715 transitions. [2024-11-11 17:07:03,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2024-11-11 17:07:03,094 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:07:03,094 INFO L218 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:07:03,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 17:07:03,094 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:07:03,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:07:03,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1063330375, now seen corresponding path program 1 times [2024-11-11 17:07:03,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:07:03,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655748376] [2024-11-11 17:07:03,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:07:03,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:07:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:07:03,588 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 363 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-11 17:07:03,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:07:03,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655748376] [2024-11-11 17:07:03,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655748376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:07:03,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:07:03,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:07:03,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545087797] [2024-11-11 17:07:03,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:07:03,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:07:03,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:07:03,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:07:03,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:07:03,628 INFO L87 Difference]: Start difference. First operand 12064 states and 13715 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:05,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:07:05,008 INFO L93 Difference]: Finished difference Result 29223 states and 33555 transitions. [2024-11-11 17:07:05,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:07:05,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 522 [2024-11-11 17:07:05,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:07:05,036 INFO L225 Difference]: With dead ends: 29223 [2024-11-11 17:07:05,036 INFO L226 Difference]: Without dead ends: 17460 [2024-11-11 17:07:05,050 INFO L434 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-11 17:07:05,051 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 247 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:07:05,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 619 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 17:07:05,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17460 states. [2024-11-11 17:07:05,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17460 to 17150. [2024-11-11 17:07:05,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17150 states, 17149 states have (on average 1.1294536124555368) internal successors, (19369), 17149 states have internal predecessors, (19369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:05,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17150 states to 17150 states and 19369 transitions. [2024-11-11 17:07:05,241 INFO L78 Accepts]: Start accepts. Automaton has 17150 states and 19369 transitions. Word has length 522 [2024-11-11 17:07:05,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:07:05,242 INFO L471 AbstractCegarLoop]: Abstraction has 17150 states and 19369 transitions. [2024-11-11 17:07:05,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:05,243 INFO L276 IsEmpty]: Start isEmpty. Operand 17150 states and 19369 transitions. [2024-11-11 17:07:05,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2024-11-11 17:07:05,249 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:07:05,250 INFO L218 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:07:05,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 17:07:05,250 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:07:05,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:07:05,251 INFO L85 PathProgramCache]: Analyzing trace with hash 504938941, now seen corresponding path program 1 times [2024-11-11 17:07:05,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:07:05,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114438332] [2024-11-11 17:07:05,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:07:05,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:07:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:07:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-11 17:07:05,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:07:05,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114438332] [2024-11-11 17:07:05,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114438332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:07:05,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:07:05,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:07:05,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731782762] [2024-11-11 17:07:05,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:07:05,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:07:05,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:07:05,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:07:05,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:07:05,701 INFO L87 Difference]: Start difference. First operand 17150 states and 19369 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:07:06,752 INFO L93 Difference]: Finished difference Result 34296 states and 38770 transitions. [2024-11-11 17:07:06,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:07:06,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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 535 [2024-11-11 17:07:06,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:07:06,774 INFO L225 Difference]: With dead ends: 34296 [2024-11-11 17:07:06,775 INFO L226 Difference]: Without dead ends: 17447 [2024-11-11 17:07:06,791 INFO L434 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-11 17:07:06,792 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 465 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 17:07:06,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 71 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 17:07:06,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17447 states. [2024-11-11 17:07:06,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17447 to 17148. [2024-11-11 17:07:06,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17148 states, 17147 states have (on average 1.1293520732489648) internal successors, (19365), 17147 states have internal predecessors, (19365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17148 states to 17148 states and 19365 transitions. [2024-11-11 17:07:06,979 INFO L78 Accepts]: Start accepts. Automaton has 17148 states and 19365 transitions. Word has length 535 [2024-11-11 17:07:06,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:07:06,980 INFO L471 AbstractCegarLoop]: Abstraction has 17148 states and 19365 transitions. [2024-11-11 17:07:06,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:06,980 INFO L276 IsEmpty]: Start isEmpty. Operand 17148 states and 19365 transitions. [2024-11-11 17:07:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2024-11-11 17:07:06,987 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:07:06,990 INFO L218 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:07:06,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 17:07:06,990 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:07:06,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:07:06,991 INFO L85 PathProgramCache]: Analyzing trace with hash -218177301, now seen corresponding path program 1 times [2024-11-11 17:07:06,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:07:06,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069995162] [2024-11-11 17:07:06,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:07:06,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:07:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:07:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-11 17:07:07,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:07:07,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069995162] [2024-11-11 17:07:07,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069995162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:07:07,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:07:07,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:07:07,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201850976] [2024-11-11 17:07:07,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:07:07,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:07:07,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:07:07,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:07:07,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:07:07,288 INFO L87 Difference]: Start difference. First operand 17148 states and 19365 transitions. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:08,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:07:08,380 INFO L93 Difference]: Finished difference Result 35488 states and 40127 transitions. [2024-11-11 17:07:08,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:07:08,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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 555 [2024-11-11 17:07:08,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:07:08,404 INFO L225 Difference]: With dead ends: 35488 [2024-11-11 17:07:08,404 INFO L226 Difference]: Without dead ends: 18641 [2024-11-11 17:07:08,419 INFO L434 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-11 17:07:08,420 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 266 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 17:07:08,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 331 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 17:07:08,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18641 states. [2024-11-11 17:07:08,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18641 to 14452. [2024-11-11 17:07:08,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14452 states, 14451 states have (on average 1.1376375337346896) internal successors, (16440), 14451 states have internal predecessors, (16440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14452 states to 14452 states and 16440 transitions. [2024-11-11 17:07:08,600 INFO L78 Accepts]: Start accepts. Automaton has 14452 states and 16440 transitions. Word has length 555 [2024-11-11 17:07:08,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:07:08,601 INFO L471 AbstractCegarLoop]: Abstraction has 14452 states and 16440 transitions. [2024-11-11 17:07:08,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:08,601 INFO L276 IsEmpty]: Start isEmpty. Operand 14452 states and 16440 transitions. [2024-11-11 17:07:08,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2024-11-11 17:07:08,609 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:07:08,609 INFO L218 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:07:08,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 17:07:08,610 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:07:08,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:07:08,611 INFO L85 PathProgramCache]: Analyzing trace with hash 613571707, now seen corresponding path program 1 times [2024-11-11 17:07:08,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:07:08,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23891801] [2024-11-11 17:07:08,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:07:08,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:07:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:07:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-11-11 17:07:09,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:07:09,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23891801] [2024-11-11 17:07:09,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23891801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:07:09,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:07:09,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:07:09,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957401122] [2024-11-11 17:07:09,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:07:09,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:07:09,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:07:09,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:07:09,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:07:09,081 INFO L87 Difference]: Start difference. First operand 14452 states and 16440 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:07:10,524 INFO L93 Difference]: Finished difference Result 32800 states and 37436 transitions. [2024-11-11 17:07:10,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:07:10,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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 575 [2024-11-11 17:07:10,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:07:10,541 INFO L225 Difference]: With dead ends: 32800 [2024-11-11 17:07:10,541 INFO L226 Difference]: Without dead ends: 18649 [2024-11-11 17:07:10,547 INFO L434 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-11 17:07:10,548 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 322 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:07:10,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 179 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 17:07:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18649 states. [2024-11-11 17:07:10,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18649 to 16842. [2024-11-11 17:07:10,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16842 states, 16841 states have (on average 1.1436375512142984) internal successors, (19260), 16841 states have internal predecessors, (19260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:10,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16842 states to 16842 states and 19260 transitions. [2024-11-11 17:07:10,733 INFO L78 Accepts]: Start accepts. Automaton has 16842 states and 19260 transitions. Word has length 575 [2024-11-11 17:07:10,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:07:10,733 INFO L471 AbstractCegarLoop]: Abstraction has 16842 states and 19260 transitions. [2024-11-11 17:07:10,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:10,734 INFO L276 IsEmpty]: Start isEmpty. Operand 16842 states and 19260 transitions. [2024-11-11 17:07:10,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2024-11-11 17:07:10,742 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:07:10,743 INFO L218 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:07:10,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 17:07:10,743 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:07:10,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:07:10,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1339152220, now seen corresponding path program 1 times [2024-11-11 17:07:10,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:07:10,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483232883] [2024-11-11 17:07:10,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:07:10,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:07:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:07:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 557 proven. 39 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-11-11 17:07:11,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:07:11,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483232883] [2024-11-11 17:07:11,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483232883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:07:11,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217139008] [2024-11-11 17:07:11,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:07:11,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:07:11,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:07:11,462 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-11 17:07:11,464 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-11 17:07:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:07:11,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:07:11,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:07:11,853 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-11 17:07:11,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:07:11,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217139008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:07:11,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:07:11,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-11 17:07:11,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811407925] [2024-11-11 17:07:11,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:07:11,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:07:11,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:07:11,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:07:11,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 17:07:11,856 INFO L87 Difference]: Start difference. First operand 16842 states and 19260 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:13,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:07:13,099 INFO L93 Difference]: Finished difference Result 33080 states and 37885 transitions. [2024-11-11 17:07:13,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:07:13,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 598 [2024-11-11 17:07:13,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:07:13,115 INFO L225 Difference]: With dead ends: 33080 [2024-11-11 17:07:13,115 INFO L226 Difference]: Without dead ends: 16539 [2024-11-11 17:07:13,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 597 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 17:07:13,127 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 296 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 17:07:13,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 600 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 17:07:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16539 states. [2024-11-11 17:07:13,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16539 to 15940. [2024-11-11 17:07:13,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15940 states, 15939 states have (on average 1.092979484283832) internal successors, (17421), 15939 states have internal predecessors, (17421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15940 states to 15940 states and 17421 transitions. [2024-11-11 17:07:13,310 INFO L78 Accepts]: Start accepts. Automaton has 15940 states and 17421 transitions. Word has length 598 [2024-11-11 17:07:13,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:07:13,311 INFO L471 AbstractCegarLoop]: Abstraction has 15940 states and 17421 transitions. [2024-11-11 17:07:13,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:13,311 INFO L276 IsEmpty]: Start isEmpty. Operand 15940 states and 17421 transitions. [2024-11-11 17:07:13,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2024-11-11 17:07:13,320 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:07:13,321 INFO L218 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:07:13,339 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-11 17:07:13,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-11 17:07:13,522 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:07:13,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:07:13,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2133654841, now seen corresponding path program 1 times [2024-11-11 17:07:13,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:07:13,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810788528] [2024-11-11 17:07:13,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:07:13,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:07:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:07:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 598 proven. 39 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-11 17:07:14,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:07:14,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810788528] [2024-11-11 17:07:14,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810788528] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:07:14,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500970959] [2024-11-11 17:07:14,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:07:14,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:07:14,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:07:14,058 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 17:07:14,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 17:07:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:07:14,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 17:07:14,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:07:15,025 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 598 proven. 39 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-11 17:07:15,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 17:07:15,745 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 598 proven. 39 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-11 17:07:15,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500970959] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 17:07:15,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 17:07:15,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-11 17:07:15,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118931795] [2024-11-11 17:07:15,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 17:07:15,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 17:07:15,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:07:15,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 17:07:15,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 17:07:15,749 INFO L87 Difference]: Start difference. First operand 15940 states and 17421 transitions. Second operand has 9 states, 9 states have (on average 82.55555555555556) internal successors, (743), 8 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:07:20,249 INFO L93 Difference]: Finished difference Result 39808 states and 43258 transitions. [2024-11-11 17:07:20,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 17:07:20,250 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 82.55555555555556) internal successors, (743), 8 states have internal predecessors, (743), 0 states have call successors, (0), 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 625 [2024-11-11 17:07:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:07:20,266 INFO L225 Difference]: With dead ends: 39808 [2024-11-11 17:07:20,267 INFO L226 Difference]: Without dead ends: 16538 [2024-11-11 17:07:20,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1259 GetRequests, 1245 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2024-11-11 17:07:20,276 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 2898 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 5562 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2898 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 6093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 5562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-11 17:07:20,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2898 Valid, 235 Invalid, 6093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 5562 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-11 17:07:20,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16538 states. [2024-11-11 17:07:20,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16538 to 14144. [2024-11-11 17:07:20,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14144 states, 14143 states have (on average 1.0367673053807538) internal successors, (14663), 14143 states have internal predecessors, (14663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:20,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14144 states to 14144 states and 14663 transitions. [2024-11-11 17:07:20,390 INFO L78 Accepts]: Start accepts. Automaton has 14144 states and 14663 transitions. Word has length 625 [2024-11-11 17:07:20,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:07:20,391 INFO L471 AbstractCegarLoop]: Abstraction has 14144 states and 14663 transitions. [2024-11-11 17:07:20,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.55555555555556) internal successors, (743), 8 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:20,391 INFO L276 IsEmpty]: Start isEmpty. Operand 14144 states and 14663 transitions. [2024-11-11 17:07:20,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2024-11-11 17:07:20,397 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:07:20,397 INFO L218 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:07:20,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 17:07:20,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 17:07:20,598 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:07:20,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:07:20,599 INFO L85 PathProgramCache]: Analyzing trace with hash -772095114, now seen corresponding path program 1 times [2024-11-11 17:07:20,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:07:20,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698971869] [2024-11-11 17:07:20,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:07:20,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:07:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:07:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 342 proven. 188 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-11 17:07:21,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:07:21,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698971869] [2024-11-11 17:07:21,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698971869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:07:21,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059502952] [2024-11-11 17:07:21,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:07:21,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:07:21,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:07:21,797 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 17:07:21,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 17:07:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:07:21,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:07:21,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:07:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2024-11-11 17:07:22,295 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:07:22,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059502952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:07:22,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:07:22,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-11 17:07:22,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035215] [2024-11-11 17:07:22,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:07:22,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:07:22,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:07:22,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:07:22,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 17:07:22,298 INFO L87 Difference]: Start difference. First operand 14144 states and 14663 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:23,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:07:23,210 INFO L93 Difference]: Finished difference Result 37024 states and 38451 transitions. [2024-11-11 17:07:23,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:07:23,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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 633 [2024-11-11 17:07:23,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:07:23,230 INFO L225 Difference]: With dead ends: 37024 [2024-11-11 17:07:23,230 INFO L226 Difference]: Without dead ends: 23181 [2024-11-11 17:07:23,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 632 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 17:07:23,240 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 376 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:07:23,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 593 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 17:07:23,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23181 states. [2024-11-11 17:07:23,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23181 to 23173. [2024-11-11 17:07:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23173 states, 23172 states have (on average 1.0389694458829621) internal successors, (24075), 23172 states have internal predecessors, (24075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23173 states to 23173 states and 24075 transitions. [2024-11-11 17:07:23,423 INFO L78 Accepts]: Start accepts. Automaton has 23173 states and 24075 transitions. Word has length 633 [2024-11-11 17:07:23,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:07:23,424 INFO L471 AbstractCegarLoop]: Abstraction has 23173 states and 24075 transitions. [2024-11-11 17:07:23,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:23,424 INFO L276 IsEmpty]: Start isEmpty. Operand 23173 states and 24075 transitions. [2024-11-11 17:07:23,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2024-11-11 17:07:23,430 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:07:23,430 INFO L218 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:07:23,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 17:07:23,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-11 17:07:23,631 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:07:23,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:07:23,632 INFO L85 PathProgramCache]: Analyzing trace with hash -253950539, now seen corresponding path program 1 times [2024-11-11 17:07:23,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:07:23,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282977126] [2024-11-11 17:07:23,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:07:23,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:07:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:07:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 202 proven. 375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:07:24,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:07:24,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282977126] [2024-11-11 17:07:24,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282977126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:07:24,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218608649] [2024-11-11 17:07:24,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:07:24,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:07:24,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:07:24,978 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 17:07:24,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 17:07:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:07:25,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:07:25,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:07:28,456 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-11 17:07:28,456 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:07:28,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218608649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:07:28,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:07:28,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-11 17:07:28,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899900535] [2024-11-11 17:07:28,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:07:28,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:07:28,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:07:28,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:07:28,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-11 17:07:28,459 INFO L87 Difference]: Start difference. First operand 23173 states and 24075 transitions. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:07:29,272 INFO L93 Difference]: Finished difference Result 54421 states and 56558 transitions. [2024-11-11 17:07:29,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:07:29,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 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 703 [2024-11-11 17:07:29,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:07:29,307 INFO L225 Difference]: With dead ends: 54421 [2024-11-11 17:07:29,307 INFO L226 Difference]: Without dead ends: 31549 [2024-11-11 17:07:29,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 702 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-11 17:07:29,323 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 51 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 17:07:29,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 457 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 17:07:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31549 states. [2024-11-11 17:07:29,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31549 to 29753. [2024-11-11 17:07:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29753 states, 29752 states have (on average 1.0322667383705297) internal successors, (30712), 29752 states have internal predecessors, (30712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:29,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29753 states to 29753 states and 30712 transitions. [2024-11-11 17:07:29,553 INFO L78 Accepts]: Start accepts. Automaton has 29753 states and 30712 transitions. Word has length 703 [2024-11-11 17:07:29,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:07:29,554 INFO L471 AbstractCegarLoop]: Abstraction has 29753 states and 30712 transitions. [2024-11-11 17:07:29,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand 29753 states and 30712 transitions. [2024-11-11 17:07:29,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2024-11-11 17:07:29,561 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:07:29,561 INFO L218 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:07:29,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 17:07:29,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:07:29,762 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:07:29,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:07:29,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1982756111, now seen corresponding path program 1 times [2024-11-11 17:07:29,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:07:29,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903607096] [2024-11-11 17:07:29,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:07:29,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:07:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:07:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 32 proven. 545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:07:30,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:07:30,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903607096] [2024-11-11 17:07:30,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903607096] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:07:30,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988603707] [2024-11-11 17:07:30,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:07:30,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:07:30,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:07:30,833 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 17:07:30,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 17:07:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:07:31,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-11 17:07:31,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:07:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 439 proven. 32 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-11 17:07:33,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 17:07:36,304 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 439 proven. 32 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-11 17:07:36,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988603707] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 17:07:36,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 17:07:36,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2024-11-11 17:07:36,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13694495] [2024-11-11 17:07:36,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 17:07:36,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 17:07:36,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:07:36,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 17:07:36,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-11 17:07:36,309 INFO L87 Difference]: Start difference. First operand 29753 states and 30712 transitions. Second operand has 13 states, 13 states have (on average 119.76923076923077) internal successors, (1557), 13 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:46,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:07:46,270 INFO L93 Difference]: Finished difference Result 108767 states and 112168 transitions. [2024-11-11 17:07:46,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-11 17:07:46,271 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 119.76923076923077) internal successors, (1557), 13 states have internal predecessors, (1557), 0 states have call successors, (0), 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 706 [2024-11-11 17:07:46,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:07:46,347 INFO L225 Difference]: With dead ends: 108767 [2024-11-11 17:07:46,347 INFO L226 Difference]: Without dead ends: 78717 [2024-11-11 17:07:46,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1498 GetRequests, 1438 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=855, Invalid=2927, Unknown=0, NotChecked=0, Total=3782 [2024-11-11 17:07:46,375 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 7192 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 11127 mSolverCounterSat, 2231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7192 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 13358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2231 IncrementalHoareTripleChecker+Valid, 11127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:07:46,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7192 Valid, 362 Invalid, 13358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2231 Valid, 11127 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2024-11-11 17:07:46,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78717 states. [2024-11-11 17:07:46,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78717 to 39336. [2024-11-11 17:07:46,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39336 states, 39335 states have (on average 1.0311681708402187) internal successors, (40561), 39335 states have internal predecessors, (40561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:46,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39336 states to 39336 states and 40561 transitions. [2024-11-11 17:07:46,883 INFO L78 Accepts]: Start accepts. Automaton has 39336 states and 40561 transitions. Word has length 706 [2024-11-11 17:07:46,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:07:46,883 INFO L471 AbstractCegarLoop]: Abstraction has 39336 states and 40561 transitions. [2024-11-11 17:07:46,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 119.76923076923077) internal successors, (1557), 13 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:46,884 INFO L276 IsEmpty]: Start isEmpty. Operand 39336 states and 40561 transitions. [2024-11-11 17:07:46,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 879 [2024-11-11 17:07:46,896 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:07:46,897 INFO L218 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 17:07:46,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 17:07:47,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:07:47,098 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:07:47,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:07:47,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1373985937, now seen corresponding path program 1 times [2024-11-11 17:07:47,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:07:47,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841837908] [2024-11-11 17:07:47,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:07:47,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:07:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:07:47,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1222 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2024-11-11 17:07:47,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:07:47,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841837908] [2024-11-11 17:07:47,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841837908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:07:47,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:07:47,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:07:47,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776106447] [2024-11-11 17:07:47,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:07:47,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:07:47,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:07:47,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:07:47,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:07:47,859 INFO L87 Difference]: Start difference. First operand 39336 states and 40561 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:49,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:07:49,062 INFO L93 Difference]: Finished difference Result 93397 states and 96337 transitions. [2024-11-11 17:07:49,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:07:49,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 878 [2024-11-11 17:07:49,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:07:49,117 INFO L225 Difference]: With dead ends: 93397 [2024-11-11 17:07:49,117 INFO L226 Difference]: Without dead ends: 54362 [2024-11-11 17:07:49,152 INFO L434 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-11 17:07:49,153 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 376 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 17:07:49,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 581 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 17:07:49,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54362 states. [2024-11-11 17:07:49,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54362 to 39037. [2024-11-11 17:07:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39037 states, 39036 states have (on average 1.0312019674146942) internal successors, (40254), 39036 states have internal predecessors, (40254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39037 states to 39037 states and 40254 transitions. [2024-11-11 17:07:49,942 INFO L78 Accepts]: Start accepts. Automaton has 39037 states and 40254 transitions. Word has length 878 [2024-11-11 17:07:49,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:07:49,943 INFO L471 AbstractCegarLoop]: Abstraction has 39037 states and 40254 transitions. [2024-11-11 17:07:49,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:07:49,943 INFO L276 IsEmpty]: Start isEmpty. Operand 39037 states and 40254 transitions. [2024-11-11 17:07:49,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 884 [2024-11-11 17:07:49,959 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:07:49,959 INFO L218 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:07:49,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 17:07:49,960 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:07:49,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:07:49,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1165612065, now seen corresponding path program 1 times [2024-11-11 17:07:49,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:07:49,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301485852] [2024-11-11 17:07:49,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:07:49,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:07:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:07:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-11-11 17:07:50,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:07:50,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301485852] [2024-11-11 17:07:50,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301485852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:07:50,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:07:50,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:07:50,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334414664] [2024-11-11 17:07:50,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:07:50,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:07:50,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:07:50,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:07:50,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:07:50,688 INFO L87 Difference]: Start difference. First operand 39037 states and 40254 transitions. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)