./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label47.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label47.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 9caa4030530e2e9671468e08c95e91bac3f6959ea80b1f57c09b5d22d183ce56 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:12:22,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:12:22,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:12:22,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:12:22,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:12:22,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:12:22,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:12:22,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:12:22,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:12:22,416 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:12:22,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:12:22,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:12:22,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:12:22,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:12:22,418 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:12:22,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:12:22,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:12:22,420 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:12:22,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:12:22,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:12:22,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:12:22,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:12:22,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:12:22,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:12:22,421 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:12:22,421 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:12:22,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:12:22,422 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:12:22,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:12:22,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:12:22,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:12:22,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:12:22,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:12:22,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:12:22,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:12:22,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:12:22,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:12:22,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:12:22,423 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:12:22,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:12:22,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:12:22,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:12:22,424 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 -> 9caa4030530e2e9671468e08c95e91bac3f6959ea80b1f57c09b5d22d183ce56 [2024-10-12 16:12:22,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:12:22,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:12:22,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:12:22,631 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:12:22,631 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:12:22,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label47.c [2024-10-12 16:12:23,925 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:12:24,267 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:12:24,268 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label47.c [2024-10-12 16:12:24,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0d6a9ff1/29490a3f8d4b45e8b9107cd6aa0b2eef/FLAG92c912e81 [2024-10-12 16:12:24,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0d6a9ff1/29490a3f8d4b45e8b9107cd6aa0b2eef [2024-10-12 16:12:24,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:12:24,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:12:24,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:12:24,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:12:24,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:12:24,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:12:24" (1/1) ... [2024-10-12 16:12:24,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba5708d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:24, skipping insertion in model container [2024-10-12 16:12:24,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:12:24" (1/1) ... [2024-10-12 16:12:24,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:12:24,806 WARN L248 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/Problem13_label47.c[6189,6202] [2024-10-12 16:12:25,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:12:25,395 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:12:25,414 WARN L248 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/Problem13_label47.c[6189,6202] [2024-10-12 16:12:25,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:12:25,726 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:12:25,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:25 WrapperNode [2024-10-12 16:12:25,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:12:25,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:12:25,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:12:25,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:12:25,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:25" (1/1) ... [2024-10-12 16:12:25,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:25" (1/1) ... [2024-10-12 16:12:26,264 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-12 16:12:26,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:12:26,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:12:26,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:12:26,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:12:26,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:25" (1/1) ... [2024-10-12 16:12:26,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:25" (1/1) ... [2024-10-12 16:12:26,370 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:25" (1/1) ... [2024-10-12 16:12:26,496 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-10-12 16:12:26,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:25" (1/1) ... [2024-10-12 16:12:26,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:25" (1/1) ... [2024-10-12 16:12:26,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:25" (1/1) ... [2024-10-12 16:12:26,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:25" (1/1) ... [2024-10-12 16:12:26,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:25" (1/1) ... [2024-10-12 16:12:26,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:25" (1/1) ... [2024-10-12 16:12:27,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:12:27,005 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:12:27,006 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:12:27,006 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:12:27,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:25" (1/1) ... [2024-10-12 16:12:27,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:12:27,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:12:27,032 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-10-12 16:12:27,033 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-10-12 16:12:27,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:12:27,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:12:27,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:12:27,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:12:27,125 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:12:27,127 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:12:31,458 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-12 16:12:31,459 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:12:31,523 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:12:31,523 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:12:31,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:12:31 BoogieIcfgContainer [2024-10-12 16:12:31,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:12:31,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:12:31,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:12:31,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:12:31,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:12:24" (1/3) ... [2024-10-12 16:12:31,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c99d496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:12:31, skipping insertion in model container [2024-10-12 16:12:31,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:25" (2/3) ... [2024-10-12 16:12:31,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c99d496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:12:31, skipping insertion in model container [2024-10-12 16:12:31,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:12:31" (3/3) ... [2024-10-12 16:12:31,532 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label47.c [2024-10-12 16:12:31,545 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:12:31,545 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:12:31,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:12:31,631 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;@d4a1a4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:12:31,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:12:31,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:31,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 16:12:31,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:12:31,647 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:12:31,647 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:12:31,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:12:31,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1954279942, now seen corresponding path program 1 times [2024-10-12 16:12:31,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:12:31,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522232761] [2024-10-12 16:12:31,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:31,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:12:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:31,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:12:31,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:12:31,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522232761] [2024-10-12 16:12:31,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522232761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:12:31,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:12:31,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:12:31,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434351160] [2024-10-12 16:12:31,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:12:31,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:12:31,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:12:31,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:12:31,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:12:31,839 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 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 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:31,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:12:31,913 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-12 16:12:31,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:12:31,915 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-10-12 16:12:31,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:12:31,936 INFO L225 Difference]: With dead ends: 2071 [2024-10-12 16:12:31,936 INFO L226 Difference]: Without dead ends: 1034 [2024-10-12 16:12:31,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:12:31,945 INFO L432 NwaCegarLoop]: 1876 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:12:31,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:12:31,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-12 16:12:32,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-12 16:12:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:32,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-12 16:12:32,023 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 42 [2024-10-12 16:12:32,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:12:32,024 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-12 16:12:32,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:32,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-12 16:12:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 16:12:32,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:12:32,025 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:12:32,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:12:32,025 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:12:32,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:12:32,026 INFO L85 PathProgramCache]: Analyzing trace with hash -418252424, now seen corresponding path program 1 times [2024-10-12 16:12:32,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:12:32,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339720740] [2024-10-12 16:12:32,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:32,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:12:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:12:32,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:12:32,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339720740] [2024-10-12 16:12:32,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339720740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:12:32,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:12:32,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:12:32,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570745821] [2024-10-12 16:12:32,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:12:32,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:12:32,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:12:32,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:12:32,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:12:32,345 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:37,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:12:37,151 INFO L93 Difference]: Finished difference Result 3696 states and 6823 transitions. [2024-10-12 16:12:37,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:12:37,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-10-12 16:12:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:12:37,166 INFO L225 Difference]: With dead ends: 3696 [2024-10-12 16:12:37,167 INFO L226 Difference]: Without dead ends: 2663 [2024-10-12 16:12:37,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 16:12:37,169 INFO L432 NwaCegarLoop]: 717 mSDtfsCounter, 2676 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 4127 mSolverCounterSat, 1487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2676 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 5614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1487 IncrementalHoareTripleChecker+Valid, 4127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:12:37,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2676 Valid, 1017 Invalid, 5614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1487 Valid, 4127 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-12 16:12:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2024-10-12 16:12:37,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2662. [2024-10-12 16:12:37,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2662 states, 2661 states have (on average 1.4611048478015785) internal successors, (3888), 2661 states have internal predecessors, (3888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 3888 transitions. [2024-10-12 16:12:37,210 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 3888 transitions. Word has length 42 [2024-10-12 16:12:37,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:12:37,210 INFO L471 AbstractCegarLoop]: Abstraction has 2662 states and 3888 transitions. [2024-10-12 16:12:37,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:37,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3888 transitions. [2024-10-12 16:12:37,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-12 16:12:37,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:12:37,215 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:12:37,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:12:37,215 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:12:37,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:12:37,216 INFO L85 PathProgramCache]: Analyzing trace with hash -302149792, now seen corresponding path program 1 times [2024-10-12 16:12:37,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:12:37,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212540363] [2024-10-12 16:12:37,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:37,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:12:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:37,781 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:12:37,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:12:37,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212540363] [2024-10-12 16:12:37,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212540363] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:12:37,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644339817] [2024-10-12 16:12:37,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:37,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:12:37,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:12:37,785 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-10-12 16:12:37,786 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-10-12 16:12:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:37,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:12:37,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:12:38,123 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-12 16:12:38,124 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:12:38,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644339817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:12:38,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:12:38,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-12 16:12:38,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048086103] [2024-10-12 16:12:38,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:12:38,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:12:38,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:12:38,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:12:38,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:12:38,128 INFO L87 Difference]: Start difference. First operand 2662 states and 3888 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:12:41,195 INFO L93 Difference]: Finished difference Result 6141 states and 9711 transitions. [2024-10-12 16:12:41,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:12:41,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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 167 [2024-10-12 16:12:41,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:12:41,208 INFO L225 Difference]: With dead ends: 6141 [2024-10-12 16:12:41,209 INFO L226 Difference]: Without dead ends: 4267 [2024-10-12 16:12:41,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:12:41,215 INFO L432 NwaCegarLoop]: 1037 mSDtfsCounter, 743 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 2509 mSolverCounterSat, 778 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 778 IncrementalHoareTripleChecker+Valid, 2509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:12:41,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1186 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [778 Valid, 2509 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 16:12:41,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2024-10-12 16:12:41,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 4253. [2024-10-12 16:12:41,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4253 states, 4252 states have (on average 1.351599247412982) internal successors, (5747), 4252 states have internal predecessors, (5747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4253 states to 4253 states and 5747 transitions. [2024-10-12 16:12:41,270 INFO L78 Accepts]: Start accepts. Automaton has 4253 states and 5747 transitions. Word has length 167 [2024-10-12 16:12:41,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:12:41,271 INFO L471 AbstractCegarLoop]: Abstraction has 4253 states and 5747 transitions. [2024-10-12 16:12:41,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:41,271 INFO L276 IsEmpty]: Start isEmpty. Operand 4253 states and 5747 transitions. [2024-10-12 16:12:41,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-12 16:12:41,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:12:41,278 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:12:41,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 16:12:41,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:12:41,479 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:12:41,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:12:41,479 INFO L85 PathProgramCache]: Analyzing trace with hash -922062188, now seen corresponding path program 1 times [2024-10-12 16:12:41,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:12:41,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517067193] [2024-10-12 16:12:41,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:41,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:12:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-12 16:12:41,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:12:41,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517067193] [2024-10-12 16:12:41,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517067193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:12:41,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:12:41,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:12:41,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211416198] [2024-10-12 16:12:41,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:12:41,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:12:41,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:12:41,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:12:41,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:12:41,635 INFO L87 Difference]: Start difference. First operand 4253 states and 5747 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:44,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:12:44,309 INFO L93 Difference]: Finished difference Result 10898 states and 15274 transitions. [2024-10-12 16:12:44,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:12:44,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2024-10-12 16:12:44,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:12:44,329 INFO L225 Difference]: With dead ends: 10898 [2024-10-12 16:12:44,329 INFO L226 Difference]: Without dead ends: 7433 [2024-10-12 16:12:44,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:12:44,334 INFO L432 NwaCegarLoop]: 823 mSDtfsCounter, 906 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2569 mSolverCounterSat, 754 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 3323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 754 IncrementalHoareTripleChecker+Valid, 2569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:12:44,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 955 Invalid, 3323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [754 Valid, 2569 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 16:12:44,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7433 states. [2024-10-12 16:12:44,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7433 to 7425. [2024-10-12 16:12:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7425 states, 7424 states have (on average 1.288927801724138) internal successors, (9569), 7424 states have internal predecessors, (9569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:44,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7425 states to 7425 states and 9569 transitions. [2024-10-12 16:12:44,417 INFO L78 Accepts]: Start accepts. Automaton has 7425 states and 9569 transitions. Word has length 209 [2024-10-12 16:12:44,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:12:44,417 INFO L471 AbstractCegarLoop]: Abstraction has 7425 states and 9569 transitions. [2024-10-12 16:12:44,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:44,418 INFO L276 IsEmpty]: Start isEmpty. Operand 7425 states and 9569 transitions. [2024-10-12 16:12:44,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-12 16:12:44,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:12:44,420 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:12:44,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:12:44,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:12:44,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:12:44,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1398357129, now seen corresponding path program 1 times [2024-10-12 16:12:44,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:12:44,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287843241] [2024-10-12 16:12:44,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:44,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:12:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-12 16:12:44,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:12:44,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287843241] [2024-10-12 16:12:44,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287843241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:12:44,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:12:44,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:12:44,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345789332] [2024-10-12 16:12:44,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:12:44,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:12:44,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:12:44,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:12:44,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:12:44,590 INFO L87 Difference]: Start difference. First operand 7425 states and 9569 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:12:47,569 INFO L93 Difference]: Finished difference Result 19620 states and 25904 transitions. [2024-10-12 16:12:47,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:12:47,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 223 [2024-10-12 16:12:47,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:12:47,608 INFO L225 Difference]: With dead ends: 19620 [2024-10-12 16:12:47,608 INFO L226 Difference]: Without dead ends: 12983 [2024-10-12 16:12:47,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:12:47,618 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 909 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 2891 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 3430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 2891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:12:47,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 636 Invalid, 3430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 2891 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 16:12:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12983 states. [2024-10-12 16:12:47,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12983 to 12974. [2024-10-12 16:12:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12974 states, 12973 states have (on average 1.2721035997841672) internal successors, (16503), 12973 states have internal predecessors, (16503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:47,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12974 states to 12974 states and 16503 transitions. [2024-10-12 16:12:47,819 INFO L78 Accepts]: Start accepts. Automaton has 12974 states and 16503 transitions. Word has length 223 [2024-10-12 16:12:47,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:12:47,820 INFO L471 AbstractCegarLoop]: Abstraction has 12974 states and 16503 transitions. [2024-10-12 16:12:47,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:47,820 INFO L276 IsEmpty]: Start isEmpty. Operand 12974 states and 16503 transitions. [2024-10-12 16:12:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-12 16:12:47,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:12:47,826 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:12:47,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:12:47,827 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:12:47,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:12:47,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1830598316, now seen corresponding path program 1 times [2024-10-12 16:12:47,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:12:47,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379838696] [2024-10-12 16:12:47,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:47,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:12:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:48,085 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-12 16:12:48,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:12:48,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379838696] [2024-10-12 16:12:48,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379838696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:12:48,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:12:48,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:12:48,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029037629] [2024-10-12 16:12:48,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:12:48,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:12:48,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:12:48,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:12:48,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:12:48,087 INFO L87 Difference]: Start difference. First operand 12974 states and 16503 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:12:50,846 INFO L93 Difference]: Finished difference Result 36179 states and 46597 transitions. [2024-10-12 16:12:50,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:12:50,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2024-10-12 16:12:50,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:12:50,879 INFO L225 Difference]: With dead ends: 36179 [2024-10-12 16:12:50,879 INFO L226 Difference]: Without dead ends: 23993 [2024-10-12 16:12:50,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:12:50,891 INFO L432 NwaCegarLoop]: 837 mSDtfsCounter, 857 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 869 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 3178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 869 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:12:50,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 984 Invalid, 3178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [869 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 16:12:50,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23993 states. [2024-10-12 16:12:51,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23993 to 23202. [2024-10-12 16:12:51,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23202 states, 23201 states have (on average 1.2067583293823543) internal successors, (27998), 23201 states have internal predecessors, (27998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:51,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23202 states to 23202 states and 27998 transitions. [2024-10-12 16:12:51,120 INFO L78 Accepts]: Start accepts. Automaton has 23202 states and 27998 transitions. Word has length 239 [2024-10-12 16:12:51,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:12:51,121 INFO L471 AbstractCegarLoop]: Abstraction has 23202 states and 27998 transitions. [2024-10-12 16:12:51,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 23202 states and 27998 transitions. [2024-10-12 16:12:51,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-12 16:12:51,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:12:51,124 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:12:51,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:12:51,124 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:12:51,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:12:51,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1773785116, now seen corresponding path program 1 times [2024-10-12 16:12:51,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:12:51,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345183989] [2024-10-12 16:12:51,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:51,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:12:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:51,279 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:12:51,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:12:51,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345183989] [2024-10-12 16:12:51,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345183989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:12:51,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:12:51,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:12:51,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057051719] [2024-10-12 16:12:51,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:12:51,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:12:51,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:12:51,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:12:51,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:12:51,282 INFO L87 Difference]: Start difference. First operand 23202 states and 27998 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:53,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:12:53,944 INFO L93 Difference]: Finished difference Result 57431 states and 70772 transitions. [2024-10-12 16:12:53,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:12:53,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 241 [2024-10-12 16:12:53,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:12:53,994 INFO L225 Difference]: With dead ends: 57431 [2024-10-12 16:12:53,995 INFO L226 Difference]: Without dead ends: 35017 [2024-10-12 16:12:54,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:12:54,019 INFO L432 NwaCegarLoop]: 807 mSDtfsCounter, 857 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 914 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 3296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 914 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:12:54,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 924 Invalid, 3296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [914 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 16:12:54,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35017 states. [2024-10-12 16:12:54,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35017 to 33433. [2024-10-12 16:12:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33433 states, 33432 states have (on average 1.1907154821727686) internal successors, (39808), 33432 states have internal predecessors, (39808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:54,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33433 states to 33433 states and 39808 transitions. [2024-10-12 16:12:54,441 INFO L78 Accepts]: Start accepts. Automaton has 33433 states and 39808 transitions. Word has length 241 [2024-10-12 16:12:54,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:12:54,442 INFO L471 AbstractCegarLoop]: Abstraction has 33433 states and 39808 transitions. [2024-10-12 16:12:54,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:54,442 INFO L276 IsEmpty]: Start isEmpty. Operand 33433 states and 39808 transitions. [2024-10-12 16:12:54,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-10-12 16:12:54,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:12:54,447 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:12:54,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:12:54,448 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:12:54,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:12:54,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1386051385, now seen corresponding path program 1 times [2024-10-12 16:12:54,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:12:54,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334990505] [2024-10-12 16:12:54,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:54,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:12:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-12 16:12:54,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:12:54,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334990505] [2024-10-12 16:12:54,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334990505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:12:54,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:12:54,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:12:54,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173991251] [2024-10-12 16:12:54,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:12:54,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:12:54,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:12:54,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:12:54,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:12:54,600 INFO L87 Difference]: Start difference. First operand 33433 states and 39808 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:57,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:12:57,377 INFO L93 Difference]: Finished difference Result 77892 states and 94390 transitions. [2024-10-12 16:12:57,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:12:57,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 330 [2024-10-12 16:12:57,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:12:57,423 INFO L225 Difference]: With dead ends: 77892 [2024-10-12 16:12:57,424 INFO L226 Difference]: Without dead ends: 45247 [2024-10-12 16:12:57,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:12:57,454 INFO L432 NwaCegarLoop]: 1794 mSDtfsCounter, 827 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2543 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 3266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 2543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:12:57,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1944 Invalid, 3266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 2543 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 16:12:57,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45247 states. [2024-10-12 16:12:57,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45247 to 44455. [2024-10-12 16:12:57,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44455 states, 44454 states have (on average 1.1654294326719756) internal successors, (51808), 44454 states have internal predecessors, (51808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:57,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44455 states to 44455 states and 51808 transitions. [2024-10-12 16:12:57,946 INFO L78 Accepts]: Start accepts. Automaton has 44455 states and 51808 transitions. Word has length 330 [2024-10-12 16:12:57,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:12:57,946 INFO L471 AbstractCegarLoop]: Abstraction has 44455 states and 51808 transitions. [2024-10-12 16:12:57,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:57,947 INFO L276 IsEmpty]: Start isEmpty. Operand 44455 states and 51808 transitions. [2024-10-12 16:12:57,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-10-12 16:12:57,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:12:57,952 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:12:57,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:12:57,952 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:12:57,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:12:57,952 INFO L85 PathProgramCache]: Analyzing trace with hash -113464025, now seen corresponding path program 1 times [2024-10-12 16:12:57,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:12:57,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212578030] [2024-10-12 16:12:57,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:57,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:12:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-10-12 16:12:58,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:12:58,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212578030] [2024-10-12 16:12:58,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212578030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:12:58,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:12:58,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:12:58,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677676924] [2024-10-12 16:12:58,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:12:58,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:12:58,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:12:58,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:12:58,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:12:58,126 INFO L87 Difference]: Start difference. First operand 44455 states and 51808 transitions. Second operand has 4 states, 4 states have (on average 74.75) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:03,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:13:03,255 INFO L93 Difference]: Finished difference Result 152886 states and 179149 transitions. [2024-10-12 16:13:03,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:13:03,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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 339 [2024-10-12 16:13:03,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:13:03,381 INFO L225 Difference]: With dead ends: 152886 [2024-10-12 16:13:03,381 INFO L226 Difference]: Without dead ends: 109219 [2024-10-12 16:13:03,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:13:03,423 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 1740 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 6025 mSolverCounterSat, 1212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 7237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1212 IncrementalHoareTripleChecker+Valid, 6025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:13:03,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1740 Valid, 637 Invalid, 7237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1212 Valid, 6025 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-12 16:13:03,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109219 states. [2024-10-12 16:13:04,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109219 to 106722. [2024-10-12 16:13:04,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106722 states, 106721 states have (on average 1.1518164185118205) internal successors, (122923), 106721 states have internal predecessors, (122923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:04,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106722 states to 106722 states and 122923 transitions. [2024-10-12 16:13:04,762 INFO L78 Accepts]: Start accepts. Automaton has 106722 states and 122923 transitions. Word has length 339 [2024-10-12 16:13:04,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:13:04,762 INFO L471 AbstractCegarLoop]: Abstraction has 106722 states and 122923 transitions. [2024-10-12 16:13:04,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:04,763 INFO L276 IsEmpty]: Start isEmpty. Operand 106722 states and 122923 transitions. [2024-10-12 16:13:04,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-10-12 16:13:04,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:13:04,769 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:13:04,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:13:04,769 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:13:04,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:13:04,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1716817504, now seen corresponding path program 1 times [2024-10-12 16:13:04,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:13:04,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945433193] [2024-10-12 16:13:04,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:04,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:13:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:05,213 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-12 16:13:05,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:13:05,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945433193] [2024-10-12 16:13:05,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945433193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:13:05,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:13:05,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:13:05,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997335564] [2024-10-12 16:13:05,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:13:05,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:13:05,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:13:05,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:13:05,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:05,215 INFO L87 Difference]: Start difference. First operand 106722 states and 122923 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 2 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:08,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:13:08,090 INFO L93 Difference]: Finished difference Result 199277 states and 230873 transitions. [2024-10-12 16:13:08,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:13:08,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 2 states have internal predecessors, (234), 0 states have call successors, (0), 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 368 [2024-10-12 16:13:08,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:13:08,209 INFO L225 Difference]: With dead ends: 199277 [2024-10-12 16:13:08,209 INFO L226 Difference]: Without dead ends: 106734 [2024-10-12 16:13:08,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:08,236 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 730 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 2706 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:13:08,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1197 Invalid, 2710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2706 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 16:13:08,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106734 states. [2024-10-12 16:13:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106734 to 105935. [2024-10-12 16:13:09,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105935 states, 105934 states have (on average 1.1520475012743785) internal successors, (122041), 105934 states have internal predecessors, (122041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105935 states to 105935 states and 122041 transitions. [2024-10-12 16:13:09,655 INFO L78 Accepts]: Start accepts. Automaton has 105935 states and 122041 transitions. Word has length 368 [2024-10-12 16:13:09,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:13:09,655 INFO L471 AbstractCegarLoop]: Abstraction has 105935 states and 122041 transitions. [2024-10-12 16:13:09,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 2 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:09,656 INFO L276 IsEmpty]: Start isEmpty. Operand 105935 states and 122041 transitions. [2024-10-12 16:13:09,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2024-10-12 16:13:09,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:13:09,673 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:13:09,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:13:09,674 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:13:09,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:13:09,675 INFO L85 PathProgramCache]: Analyzing trace with hash -139978806, now seen corresponding path program 1 times [2024-10-12 16:13:09,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:13:09,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429906223] [2024-10-12 16:13:09,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:09,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:13:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 304 proven. 113 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-10-12 16:13:10,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:13:10,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429906223] [2024-10-12 16:13:10,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429906223] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:13:10,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880140897] [2024-10-12 16:13:10,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:10,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:13:10,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:13:10,939 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-10-12 16:13:10,944 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-10-12 16:13:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:11,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:13:11,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:13:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-10-12 16:13:11,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:13:11,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880140897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:13:11,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:13:11,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-12 16:13:11,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767809861] [2024-10-12 16:13:11,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:13:11,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:13:11,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:13:11,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:13:11,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-12 16:13:11,168 INFO L87 Difference]: Start difference. First operand 105935 states and 122041 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:13:13,830 INFO L93 Difference]: Finished difference Result 215000 states and 248124 transitions. [2024-10-12 16:13:13,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:13:13,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 397 [2024-10-12 16:13:13,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:13:13,965 INFO L225 Difference]: With dead ends: 215000 [2024-10-12 16:13:13,966 INFO L226 Difference]: Without dead ends: 122457 [2024-10-12 16:13:14,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-12 16:13:14,008 INFO L432 NwaCegarLoop]: 1752 mSDtfsCounter, 863 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 2866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:13:14,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 1881 Invalid, 2866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 16:13:14,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122457 states. [2024-10-12 16:13:15,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122457 to 114583. [2024-10-12 16:13:15,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114583 states, 114582 states have (on average 1.142378384039378) internal successors, (130896), 114582 states have internal predecessors, (130896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:15,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114583 states to 114583 states and 130896 transitions. [2024-10-12 16:13:15,273 INFO L78 Accepts]: Start accepts. Automaton has 114583 states and 130896 transitions. Word has length 397 [2024-10-12 16:13:15,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:13:15,274 INFO L471 AbstractCegarLoop]: Abstraction has 114583 states and 130896 transitions. [2024-10-12 16:13:15,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:15,274 INFO L276 IsEmpty]: Start isEmpty. Operand 114583 states and 130896 transitions. [2024-10-12 16:13:15,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2024-10-12 16:13:15,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:13:15,284 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:13:15,297 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-10-12 16:13:15,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-12 16:13:15,486 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:13:15,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:13:15,486 INFO L85 PathProgramCache]: Analyzing trace with hash -999805575, now seen corresponding path program 1 times [2024-10-12 16:13:15,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:13:15,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240429965] [2024-10-12 16:13:15,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:15,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:13:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 322 proven. 110 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-10-12 16:13:16,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:13:16,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240429965] [2024-10-12 16:13:16,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240429965] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:13:16,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523287144] [2024-10-12 16:13:16,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:16,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:13:16,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:13:16,855 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-10-12 16:13:16,856 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-10-12 16:13:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:16,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:13:16,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:13:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-12 16:13:17,142 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:13:17,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523287144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:13:17,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:13:17,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-12 16:13:17,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115060660] [2024-10-12 16:13:17,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:13:17,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:13:17,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:13:17,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:13:17,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:13:17,144 INFO L87 Difference]: Start difference. First operand 114583 states and 130896 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:20,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:13:20,154 INFO L93 Difference]: Finished difference Result 225999 states and 261421 transitions. [2024-10-12 16:13:20,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:13:20,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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 472 [2024-10-12 16:13:20,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:13:20,296 INFO L225 Difference]: With dead ends: 225999 [2024-10-12 16:13:20,296 INFO L226 Difference]: Without dead ends: 124808 [2024-10-12 16:13:20,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:13:20,354 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 1139 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 1181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 3450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1181 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:13:20,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 420 Invalid, 3450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1181 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 16:13:20,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124808 states. [2024-10-12 16:13:21,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124808 to 124808. [2024-10-12 16:13:21,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124808 states, 124807 states have (on average 1.1485092983566627) internal successors, (143342), 124807 states have internal predecessors, (143342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124808 states to 124808 states and 143342 transitions. [2024-10-12 16:13:21,658 INFO L78 Accepts]: Start accepts. Automaton has 124808 states and 143342 transitions. Word has length 472 [2024-10-12 16:13:21,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:13:21,659 INFO L471 AbstractCegarLoop]: Abstraction has 124808 states and 143342 transitions. [2024-10-12 16:13:21,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 124808 states and 143342 transitions. [2024-10-12 16:13:21,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2024-10-12 16:13:21,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:13:21,906 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:13:21,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 16:13:22,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:13:22,107 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:13:22,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:13:22,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1400239995, now seen corresponding path program 1 times [2024-10-12 16:13:22,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:13:22,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846011574] [2024-10-12 16:13:22,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:22,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:13:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:22,400 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 492 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-10-12 16:13:22,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:13:22,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846011574] [2024-10-12 16:13:22,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846011574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:13:22,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:13:22,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:13:22,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529555989] [2024-10-12 16:13:22,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:13:22,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:13:22,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:13:22,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:13:22,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:22,404 INFO L87 Difference]: Start difference. First operand 124808 states and 143342 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:25,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:13:25,825 INFO L93 Difference]: Finished difference Result 275588 states and 320316 transitions. [2024-10-12 16:13:25,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:13:25,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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 486 [2024-10-12 16:13:25,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:13:26,004 INFO L225 Difference]: With dead ends: 275588 [2024-10-12 16:13:26,004 INFO L226 Difference]: Without dead ends: 151568 [2024-10-12 16:13:26,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:26,035 INFO L432 NwaCegarLoop]: 822 mSDtfsCounter, 812 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2428 mSolverCounterSat, 925 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 3353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 925 IncrementalHoareTripleChecker+Valid, 2428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:13:26,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 905 Invalid, 3353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [925 Valid, 2428 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 16:13:26,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151568 states. [2024-10-12 16:13:27,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151568 to 149972. [2024-10-12 16:13:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149972 states, 149971 states have (on average 1.1513692647245135) internal successors, (172672), 149971 states have internal predecessors, (172672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:27,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149972 states to 149972 states and 172672 transitions. [2024-10-12 16:13:27,695 INFO L78 Accepts]: Start accepts. Automaton has 149972 states and 172672 transitions. Word has length 486 [2024-10-12 16:13:27,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:13:27,695 INFO L471 AbstractCegarLoop]: Abstraction has 149972 states and 172672 transitions. [2024-10-12 16:13:27,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:27,696 INFO L276 IsEmpty]: Start isEmpty. Operand 149972 states and 172672 transitions. [2024-10-12 16:13:27,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-10-12 16:13:27,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:13:27,707 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:13:27,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 16:13:27,708 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:13:27,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:13:27,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1385646280, now seen corresponding path program 1 times [2024-10-12 16:13:27,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:13:27,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632644344] [2024-10-12 16:13:27,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:27,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:13:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:28,333 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 476 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-12 16:13:28,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:13:28,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632644344] [2024-10-12 16:13:28,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632644344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:13:28,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:13:28,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:13:28,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141042706] [2024-10-12 16:13:28,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:13:28,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:13:28,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:13:28,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:13:28,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:28,336 INFO L87 Difference]: Start difference. First operand 149972 states and 172672 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-10-12 16:13:31,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:13:31,469 INFO L93 Difference]: Finished difference Result 299943 states and 345290 transitions. [2024-10-12 16:13:31,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:13:31,469 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 490 [2024-10-12 16:13:31,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:13:31,635 INFO L225 Difference]: With dead ends: 299943 [2024-10-12 16:13:31,635 INFO L226 Difference]: Without dead ends: 149183 [2024-10-12 16:13:31,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:31,707 INFO L432 NwaCegarLoop]: 1696 mSDtfsCounter, 736 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 667 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 3161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 667 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:13:31,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1837 Invalid, 3161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [667 Valid, 2494 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 16:13:31,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149183 states. [2024-10-12 16:13:33,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149183 to 149162. [2024-10-12 16:13:33,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149162 states, 149161 states have (on average 1.109841044240787) internal successors, (165545), 149161 states have internal predecessors, (165545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:33,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149162 states to 149162 states and 165545 transitions. [2024-10-12 16:13:33,585 INFO L78 Accepts]: Start accepts. Automaton has 149162 states and 165545 transitions. Word has length 490 [2024-10-12 16:13:33,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:13:33,585 INFO L471 AbstractCegarLoop]: Abstraction has 149162 states and 165545 transitions. [2024-10-12 16:13:33,585 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-10-12 16:13:33,585 INFO L276 IsEmpty]: Start isEmpty. Operand 149162 states and 165545 transitions. [2024-10-12 16:13:33,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-10-12 16:13:33,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:13:33,597 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:13:33,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 16:13:33,597 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:13:33,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:13:33,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1354864871, now seen corresponding path program 1 times [2024-10-12 16:13:33,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:13:33,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879059023] [2024-10-12 16:13:33,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:33,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:13:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-12 16:13:34,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:13:34,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879059023] [2024-10-12 16:13:34,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879059023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:13:34,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:13:34,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:13:34,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429438920] [2024-10-12 16:13:34,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:13:34,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:13:34,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:13:34,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:13:34,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:13:34,777 INFO L87 Difference]: Start difference. First operand 149162 states and 165545 transitions. Second operand has 4 states, 4 states have (on average 99.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:39,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:13:39,312 INFO L93 Difference]: Finished difference Result 333002 states and 372452 transitions. [2024-10-12 16:13:39,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:13:39,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 99.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 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 490 [2024-10-12 16:13:39,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:13:39,566 INFO L225 Difference]: With dead ends: 333002 [2024-10-12 16:13:39,567 INFO L226 Difference]: Without dead ends: 199589 [2024-10-12 16:13:39,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:13:39,626 INFO L432 NwaCegarLoop]: 662 mSDtfsCounter, 1380 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 5611 mSolverCounterSat, 572 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 6183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 572 IncrementalHoareTripleChecker+Valid, 5611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:13:39,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 981 Invalid, 6183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [572 Valid, 5611 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-12 16:13:39,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199589 states. [2024-10-12 16:13:41,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199589 to 180669. [2024-10-12 16:13:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180669 states, 180668 states have (on average 1.1079604578563995) internal successors, (200173), 180668 states have internal predecessors, (200173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:42,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180669 states to 180669 states and 200173 transitions. [2024-10-12 16:13:42,013 INFO L78 Accepts]: Start accepts. Automaton has 180669 states and 200173 transitions. Word has length 490 [2024-10-12 16:13:42,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:13:42,014 INFO L471 AbstractCegarLoop]: Abstraction has 180669 states and 200173 transitions. [2024-10-12 16:13:42,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:42,014 INFO L276 IsEmpty]: Start isEmpty. Operand 180669 states and 200173 transitions. [2024-10-12 16:13:42,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2024-10-12 16:13:42,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:13:42,044 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:13:42,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 16:13:42,044 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:13:42,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:13:42,045 INFO L85 PathProgramCache]: Analyzing trace with hash -983157209, now seen corresponding path program 1 times [2024-10-12 16:13:42,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:13:42,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35584028] [2024-10-12 16:13:42,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:42,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:13:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:42,931 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 687 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-10-12 16:13:42,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:13:42,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35584028] [2024-10-12 16:13:42,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35584028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:13:42,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:13:42,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:13:42,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726713867] [2024-10-12 16:13:42,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:13:42,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:13:42,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:13:42,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:13:42,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:42,933 INFO L87 Difference]: Start difference. First operand 180669 states and 200173 transitions. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)