./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.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/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.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 2b4e579e156345915e1fde26fcd53bce80a36e2067cd5c9341971cdf8691491e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:16:19,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:16:19,482 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:16:19,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:16:19,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:16:19,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:16:19,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:16:19,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:16:19,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:16:19,531 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:16:19,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:16:19,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:16:19,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:16:19,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:16:19,533 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:16:19,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:16:19,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:16:19,535 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:16:19,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:16:19,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:16:19,539 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:16:19,539 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:16:19,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:16:19,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:16:19,540 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:16:19,540 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:16:19,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:16:19,540 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:16:19,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:16:19,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:16:19,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:16:19,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:16:19,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:16:19,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:16:19,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:16:19,542 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:16:19,542 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:16:19,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:16:19,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:16:19,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:16:19,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:16:19,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:16:19,546 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 -> 2b4e579e156345915e1fde26fcd53bce80a36e2067cd5c9341971cdf8691491e [2024-10-12 20:16:19,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:16:19,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:16:19,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:16:19,822 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:16:19,822 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:16:19,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2024-10-12 20:16:21,109 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:16:21,331 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:16:21,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2024-10-12 20:16:21,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e25d9f33/eead862998a144f5a28d351a72d18fd3/FLAG22a8718e3 [2024-10-12 20:16:21,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e25d9f33/eead862998a144f5a28d351a72d18fd3 [2024-10-12 20:16:21,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:16:21,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:16:21,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:16:21,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:16:21,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:16:21,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:16:21" (1/1) ... [2024-10-12 20:16:21,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3959f818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:21, skipping insertion in model container [2024-10-12 20:16:21,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:16:21" (1/1) ... [2024-10-12 20:16:21,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:16:22,001 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/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[12498,12511] [2024-10-12 20:16:22,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:16:22,065 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:16:22,141 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/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[12498,12511] [2024-10-12 20:16:22,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:16:22,181 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:16:22,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:22 WrapperNode [2024-10-12 20:16:22,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:16:22,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:16:22,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:16:22,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:16:22,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:22" (1/1) ... [2024-10-12 20:16:22,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:22" (1/1) ... [2024-10-12 20:16:22,257 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1327 [2024-10-12 20:16:22,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:16:22,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:16:22,263 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:16:22,263 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:16:22,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:22" (1/1) ... [2024-10-12 20:16:22,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:22" (1/1) ... [2024-10-12 20:16:22,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:22" (1/1) ... [2024-10-12 20:16:22,296 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 20:16:22,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:22" (1/1) ... [2024-10-12 20:16:22,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:22" (1/1) ... [2024-10-12 20:16:22,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:22" (1/1) ... [2024-10-12 20:16:22,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:22" (1/1) ... [2024-10-12 20:16:22,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:22" (1/1) ... [2024-10-12 20:16:22,322 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:22" (1/1) ... [2024-10-12 20:16:22,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:16:22,328 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:16:22,328 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:16:22,328 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:16:22,328 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:22" (1/1) ... [2024-10-12 20:16:22,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:16:22,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:16:22,383 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 20:16:22,394 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 20:16:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:16:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:16:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:16:22,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:16:22,612 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:16:22,618 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:16:23,569 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-10-12 20:16:23,569 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:16:23,611 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:16:23,611 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:16:23,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:16:23 BoogieIcfgContainer [2024-10-12 20:16:23,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:16:23,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:16:23,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:16:23,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:16:23,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:16:21" (1/3) ... [2024-10-12 20:16:23,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b8f9fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:16:23, skipping insertion in model container [2024-10-12 20:16:23,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:22" (2/3) ... [2024-10-12 20:16:23,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b8f9fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:16:23, skipping insertion in model container [2024-10-12 20:16:23,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:16:23" (3/3) ... [2024-10-12 20:16:23,618 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2024-10-12 20:16:23,631 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:16:23,631 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:16:23,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:16:23,686 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;@c6e1e9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:16:23,686 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:16:23,691 INFO L276 IsEmpty]: Start isEmpty. Operand has 305 states, 303 states have (on average 1.801980198019802) internal successors, (546), 304 states have internal predecessors, (546), 0 states have call successors, (0), 0 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 20:16:23,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-12 20:16:23,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:23,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:23,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:23,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:23,707 INFO L85 PathProgramCache]: Analyzing trace with hash 692383995, now seen corresponding path program 1 times [2024-10-12 20:16:23,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:23,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697136733] [2024-10-12 20:16:23,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:23,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:24,206 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 20:16:24,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:24,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697136733] [2024-10-12 20:16:24,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697136733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:24,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:24,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:24,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059352415] [2024-10-12 20:16:24,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:24,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:16:24,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:24,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:16:24,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:24,243 INFO L87 Difference]: Start difference. First operand has 305 states, 303 states have (on average 1.801980198019802) internal successors, (546), 304 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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 20:16:24,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:24,330 INFO L93 Difference]: Finished difference Result 552 states and 963 transitions. [2024-10-12 20:16:24,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:16:24,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-10-12 20:16:24,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:24,343 INFO L225 Difference]: With dead ends: 552 [2024-10-12 20:16:24,343 INFO L226 Difference]: Without dead ends: 419 [2024-10-12 20:16:24,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:24,347 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 209 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:24,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1030 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-12 20:16:24,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2024-10-12 20:16:24,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 1.6850961538461537) internal successors, (701), 416 states have internal predecessors, (701), 0 states have call successors, (0), 0 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 20:16:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 701 transitions. [2024-10-12 20:16:24,404 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 701 transitions. Word has length 98 [2024-10-12 20:16:24,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:24,404 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 701 transitions. [2024-10-12 20:16:24,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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 20:16:24,405 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 701 transitions. [2024-10-12 20:16:24,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:16:24,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:24,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:24,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:16:24,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:24,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:24,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1152779503, now seen corresponding path program 1 times [2024-10-12 20:16:24,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:24,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130580573] [2024-10-12 20:16:24,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:24,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:24,682 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 20:16:24,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:24,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130580573] [2024-10-12 20:16:24,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130580573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:24,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:24,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:24,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754636374] [2024-10-12 20:16:24,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:24,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:16:24,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:24,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:16:24,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:24,687 INFO L87 Difference]: Start difference. First operand 417 states and 701 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:24,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:24,748 INFO L93 Difference]: Finished difference Result 881 states and 1477 transitions. [2024-10-12 20:16:24,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:16:24,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-12 20:16:24,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:24,752 INFO L225 Difference]: With dead ends: 881 [2024-10-12 20:16:24,753 INFO L226 Difference]: Without dead ends: 640 [2024-10-12 20:16:24,755 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 20:16:24,756 INFO L432 NwaCegarLoop]: 509 mSDtfsCounter, 189 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:24,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 995 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:24,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-10-12 20:16:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 638. [2024-10-12 20:16:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 637 states have (on average 1.6781789638932496) internal successors, (1069), 637 states have internal predecessors, (1069), 0 states have call successors, (0), 0 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 20:16:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1069 transitions. [2024-10-12 20:16:24,798 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1069 transitions. Word has length 101 [2024-10-12 20:16:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:24,799 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 1069 transitions. [2024-10-12 20:16:24,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:24,799 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1069 transitions. [2024-10-12 20:16:24,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-12 20:16:24,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:24,807 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:24,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:16:24,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:24,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:24,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1401790303, now seen corresponding path program 1 times [2024-10-12 20:16:24,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:24,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190330968] [2024-10-12 20:16:24,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:24,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:24,980 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 20:16:24,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:24,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190330968] [2024-10-12 20:16:24,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190330968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:24,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:24,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:24,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612565367] [2024-10-12 20:16:24,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:24,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:16:24,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:24,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:16:24,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:24,982 INFO L87 Difference]: Start difference. First operand 638 states and 1069 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:25,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:25,019 INFO L93 Difference]: Finished difference Result 1526 states and 2547 transitions. [2024-10-12 20:16:25,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:16:25,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-10-12 20:16:25,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:25,024 INFO L225 Difference]: With dead ends: 1526 [2024-10-12 20:16:25,024 INFO L226 Difference]: Without dead ends: 1064 [2024-10-12 20:16:25,027 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 20:16:25,028 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 183 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:25,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1075 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:25,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2024-10-12 20:16:25,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1062. [2024-10-12 20:16:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 1061 states have (on average 1.6672950047125354) internal successors, (1769), 1061 states have internal predecessors, (1769), 0 states have call successors, (0), 0 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 20:16:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1769 transitions. [2024-10-12 20:16:25,071 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1769 transitions. Word has length 104 [2024-10-12 20:16:25,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:25,072 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1769 transitions. [2024-10-12 20:16:25,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:25,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1769 transitions. [2024-10-12 20:16:25,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 20:16:25,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:25,076 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:25,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:16:25,076 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:25,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:25,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1412156261, now seen corresponding path program 1 times [2024-10-12 20:16:25,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:25,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077224929] [2024-10-12 20:16:25,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:25,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:25,220 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 20:16:25,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:25,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077224929] [2024-10-12 20:16:25,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077224929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:25,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:25,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:25,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145395692] [2024-10-12 20:16:25,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:25,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:16:25,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:25,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:16:25,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:25,226 INFO L87 Difference]: Start difference. First operand 1062 states and 1769 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 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 20:16:25,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:25,256 INFO L93 Difference]: Finished difference Result 1968 states and 3283 transitions. [2024-10-12 20:16:25,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:16:25,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-10-12 20:16:25,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:25,261 INFO L225 Difference]: With dead ends: 1968 [2024-10-12 20:16:25,261 INFO L226 Difference]: Without dead ends: 1506 [2024-10-12 20:16:25,264 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 20:16:25,265 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 184 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:25,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1067 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:25,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-10-12 20:16:25,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1504. [2024-10-12 20:16:25,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1503 states have (on average 1.6640053226879574) internal successors, (2501), 1503 states have internal predecessors, (2501), 0 states have call successors, (0), 0 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 20:16:25,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 2501 transitions. [2024-10-12 20:16:25,322 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 2501 transitions. Word has length 107 [2024-10-12 20:16:25,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:25,323 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 2501 transitions. [2024-10-12 20:16:25,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 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 20:16:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2501 transitions. [2024-10-12 20:16:25,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 20:16:25,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:25,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:25,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:16:25,329 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:25,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:25,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2099416393, now seen corresponding path program 1 times [2024-10-12 20:16:25,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:25,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850036089] [2024-10-12 20:16:25,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:25,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:25,447 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 20:16:25,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:25,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850036089] [2024-10-12 20:16:25,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850036089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:25,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:25,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:25,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890890320] [2024-10-12 20:16:25,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:25,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:16:25,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:25,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:16:25,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:25,452 INFO L87 Difference]: Start difference. First operand 1504 states and 2501 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 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 20:16:25,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:25,495 INFO L93 Difference]: Finished difference Result 3880 states and 6427 transitions. [2024-10-12 20:16:25,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:16:25,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-10-12 20:16:25,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:25,504 INFO L225 Difference]: With dead ends: 3880 [2024-10-12 20:16:25,504 INFO L226 Difference]: Without dead ends: 2638 [2024-10-12 20:16:25,506 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 20:16:25,508 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 177 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:25,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1049 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:25,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2024-10-12 20:16:25,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2636. [2024-10-12 20:16:25,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 1.6504743833017077) internal successors, (4349), 2635 states have internal predecessors, (4349), 0 states have call successors, (0), 0 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 20:16:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 4349 transitions. [2024-10-12 20:16:25,557 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 4349 transitions. Word has length 107 [2024-10-12 20:16:25,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:25,558 INFO L471 AbstractCegarLoop]: Abstraction has 2636 states and 4349 transitions. [2024-10-12 20:16:25,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 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 20:16:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 4349 transitions. [2024-10-12 20:16:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-12 20:16:25,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:25,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:25,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:16:25,560 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:25,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:25,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1560073493, now seen corresponding path program 1 times [2024-10-12 20:16:25,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:25,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452984709] [2024-10-12 20:16:25,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:25,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:25,645 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 20:16:25,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:25,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452984709] [2024-10-12 20:16:25,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452984709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:25,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:25,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:25,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747071995] [2024-10-12 20:16:25,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:25,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:16:25,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:25,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:16:25,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:25,647 INFO L87 Difference]: Start difference. First operand 2636 states and 4349 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 20:16:25,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:25,680 INFO L93 Difference]: Finished difference Result 4880 states and 8063 transitions. [2024-10-12 20:16:25,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:16:25,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-10-12 20:16:25,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:25,690 INFO L225 Difference]: With dead ends: 4880 [2024-10-12 20:16:25,691 INFO L226 Difference]: Without dead ends: 3638 [2024-10-12 20:16:25,693 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 20:16:25,694 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 178 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:25,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1040 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:25,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3638 states. [2024-10-12 20:16:25,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3638 to 3636. [2024-10-12 20:16:25,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3636 states, 3635 states have (on average 1.6453920220082532) internal successors, (5981), 3635 states have internal predecessors, (5981), 0 states have call successors, (0), 0 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 20:16:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 5981 transitions. [2024-10-12 20:16:25,745 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 5981 transitions. Word has length 110 [2024-10-12 20:16:25,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:25,745 INFO L471 AbstractCegarLoop]: Abstraction has 3636 states and 5981 transitions. [2024-10-12 20:16:25,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 20:16:25,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 5981 transitions. [2024-10-12 20:16:25,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-12 20:16:25,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:25,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:25,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:16:25,747 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:25,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:25,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2001352775, now seen corresponding path program 1 times [2024-10-12 20:16:25,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:25,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256445598] [2024-10-12 20:16:25,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:25,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:25,922 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 20:16:25,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:25,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256445598] [2024-10-12 20:16:25,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256445598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:25,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:25,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:16:25,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262153565] [2024-10-12 20:16:25,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:25,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:16:25,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:25,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:16:25,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:16:25,925 INFO L87 Difference]: Start difference. First operand 3636 states and 5981 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 20:16:26,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:26,241 INFO L93 Difference]: Finished difference Result 20390 states and 33848 transitions. [2024-10-12 20:16:26,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:16:26,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-10-12 20:16:26,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:26,300 INFO L225 Difference]: With dead ends: 20390 [2024-10-12 20:16:26,301 INFO L226 Difference]: Without dead ends: 17088 [2024-10-12 20:16:26,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:16:26,316 INFO L432 NwaCegarLoop]: 577 mSDtfsCounter, 1812 mSDsluCounter, 3856 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1812 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:26,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1812 Valid, 4433 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:16:26,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17088 states. [2024-10-12 20:16:26,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17088 to 6867. [2024-10-12 20:16:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6867 states, 6866 states have (on average 1.6420040780658316) internal successors, (11274), 6866 states have internal predecessors, (11274), 0 states have call successors, (0), 0 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 20:16:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6867 states to 6867 states and 11274 transitions. [2024-10-12 20:16:26,524 INFO L78 Accepts]: Start accepts. Automaton has 6867 states and 11274 transitions. Word has length 110 [2024-10-12 20:16:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:26,525 INFO L471 AbstractCegarLoop]: Abstraction has 6867 states and 11274 transitions. [2024-10-12 20:16:26,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 20:16:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 6867 states and 11274 transitions. [2024-10-12 20:16:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:16:26,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:26,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:26,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:16:26,528 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:26,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:26,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1845331814, now seen corresponding path program 1 times [2024-10-12 20:16:26,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:26,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218216970] [2024-10-12 20:16:26,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:26,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:26,643 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 20:16:26,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:26,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218216970] [2024-10-12 20:16:26,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218216970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:26,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:26,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:16:26,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809697407] [2024-10-12 20:16:26,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:26,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:16:26,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:26,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:16:26,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:16:26,645 INFO L87 Difference]: Start difference. First operand 6867 states and 11274 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 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 20:16:26,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:26,764 INFO L93 Difference]: Finished difference Result 20224 states and 33449 transitions. [2024-10-12 20:16:26,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:16:26,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-10-12 20:16:26,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:26,841 INFO L225 Difference]: With dead ends: 20224 [2024-10-12 20:16:26,842 INFO L226 Difference]: Without dead ends: 13777 [2024-10-12 20:16:26,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:16:26,852 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 624 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:26,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 1719 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:26,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13777 states. [2024-10-12 20:16:27,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13777 to 10318. [2024-10-12 20:16:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10318 states, 10317 states have (on average 1.6450518561597363) internal successors, (16972), 10317 states have internal predecessors, (16972), 0 states have call successors, (0), 0 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 20:16:27,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10318 states to 10318 states and 16972 transitions. [2024-10-12 20:16:27,045 INFO L78 Accepts]: Start accepts. Automaton has 10318 states and 16972 transitions. Word has length 111 [2024-10-12 20:16:27,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:27,046 INFO L471 AbstractCegarLoop]: Abstraction has 10318 states and 16972 transitions. [2024-10-12 20:16:27,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 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 20:16:27,046 INFO L276 IsEmpty]: Start isEmpty. Operand 10318 states and 16972 transitions. [2024-10-12 20:16:27,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:16:27,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:27,048 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:27,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:16:27,048 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:27,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:27,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1599790197, now seen corresponding path program 1 times [2024-10-12 20:16:27,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:27,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014635821] [2024-10-12 20:16:27,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:27,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:27,132 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 20:16:27,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:27,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014635821] [2024-10-12 20:16:27,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014635821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:27,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:27,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:27,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133077263] [2024-10-12 20:16:27,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:27,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:16:27,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:27,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:16:27,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:27,135 INFO L87 Difference]: Start difference. First operand 10318 states and 16972 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 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 20:16:27,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:27,248 INFO L93 Difference]: Finished difference Result 19394 states and 32022 transitions. [2024-10-12 20:16:27,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:16:27,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-10-12 20:16:27,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:27,269 INFO L225 Difference]: With dead ends: 19394 [2024-10-12 20:16:27,270 INFO L226 Difference]: Without dead ends: 14002 [2024-10-12 20:16:27,275 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 20:16:27,275 INFO L432 NwaCegarLoop]: 634 mSDtfsCounter, 190 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:27,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1111 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:27,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14002 states. [2024-10-12 20:16:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14002 to 14000. [2024-10-12 20:16:27,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14000 states, 13999 states have (on average 1.6438317022644475) internal successors, (23012), 13999 states have internal predecessors, (23012), 0 states have call successors, (0), 0 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 20:16:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14000 states to 14000 states and 23012 transitions. [2024-10-12 20:16:27,445 INFO L78 Accepts]: Start accepts. Automaton has 14000 states and 23012 transitions. Word has length 111 [2024-10-12 20:16:27,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:27,445 INFO L471 AbstractCegarLoop]: Abstraction has 14000 states and 23012 transitions. [2024-10-12 20:16:27,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 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 20:16:27,446 INFO L276 IsEmpty]: Start isEmpty. Operand 14000 states and 23012 transitions. [2024-10-12 20:16:27,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:16:27,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:27,447 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:27,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:16:27,447 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:27,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:27,447 INFO L85 PathProgramCache]: Analyzing trace with hash -157389061, now seen corresponding path program 1 times [2024-10-12 20:16:27,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:27,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134753361] [2024-10-12 20:16:27,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:27,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:27,573 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 20:16:27,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:27,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134753361] [2024-10-12 20:16:27,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134753361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:27,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:27,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:27,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363127452] [2024-10-12 20:16:27,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:27,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:16:27,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:27,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:16:27,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:27,575 INFO L87 Difference]: Start difference. First operand 14000 states and 23012 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 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 20:16:27,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:27,648 INFO L93 Difference]: Finished difference Result 30413 states and 50388 transitions. [2024-10-12 20:16:27,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:16:27,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-10-12 20:16:27,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:27,679 INFO L225 Difference]: With dead ends: 30413 [2024-10-12 20:16:27,679 INFO L226 Difference]: Without dead ends: 20720 [2024-10-12 20:16:27,694 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 20:16:27,695 INFO L432 NwaCegarLoop]: 670 mSDtfsCounter, 196 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:27,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1146 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:27,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20720 states. [2024-10-12 20:16:27,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20720 to 20718. [2024-10-12 20:16:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20718 states, 20717 states have (on average 1.6462808321668194) internal successors, (34106), 20717 states have internal predecessors, (34106), 0 states have call successors, (0), 0 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 20:16:27,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20718 states to 20718 states and 34106 transitions. [2024-10-12 20:16:27,981 INFO L78 Accepts]: Start accepts. Automaton has 20718 states and 34106 transitions. Word has length 111 [2024-10-12 20:16:27,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:27,981 INFO L471 AbstractCegarLoop]: Abstraction has 20718 states and 34106 transitions. [2024-10-12 20:16:27,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 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 20:16:27,981 INFO L276 IsEmpty]: Start isEmpty. Operand 20718 states and 34106 transitions. [2024-10-12 20:16:27,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 20:16:27,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:27,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:27,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:16:27,983 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:27,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:27,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1308207342, now seen corresponding path program 1 times [2024-10-12 20:16:27,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:27,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118335032] [2024-10-12 20:16:27,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:27,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:28,270 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 20:16:28,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:28,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118335032] [2024-10-12 20:16:28,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118335032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:28,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:28,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:16:28,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14299921] [2024-10-12 20:16:28,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:28,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:16:28,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:28,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:16:28,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:16:28,272 INFO L87 Difference]: Start difference. First operand 20718 states and 34106 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 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 20:16:28,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:28,517 INFO L93 Difference]: Finished difference Result 67416 states and 111245 transitions. [2024-10-12 20:16:28,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:16:28,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-10-12 20:16:28,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:28,631 INFO L225 Difference]: With dead ends: 67416 [2024-10-12 20:16:28,632 INFO L226 Difference]: Without dead ends: 46930 [2024-10-12 20:16:28,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:16:28,672 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 622 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:28,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1573 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:16:28,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46930 states. [2024-10-12 20:16:29,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46930 to 33735. [2024-10-12 20:16:29,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33735 states, 33734 states have (on average 1.6415485859963241) internal successors, (55376), 33734 states have internal predecessors, (55376), 0 states have call successors, (0), 0 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 20:16:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33735 states to 33735 states and 55376 transitions. [2024-10-12 20:16:29,532 INFO L78 Accepts]: Start accepts. Automaton has 33735 states and 55376 transitions. Word has length 112 [2024-10-12 20:16:29,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:29,533 INFO L471 AbstractCegarLoop]: Abstraction has 33735 states and 55376 transitions. [2024-10-12 20:16:29,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 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 20:16:29,533 INFO L276 IsEmpty]: Start isEmpty. Operand 33735 states and 55376 transitions. [2024-10-12 20:16:29,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 20:16:29,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:29,534 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:29,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:16:29,534 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:29,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:29,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1841775917, now seen corresponding path program 1 times [2024-10-12 20:16:29,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:29,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988875271] [2024-10-12 20:16:29,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:29,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:29,636 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 20:16:29,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:29,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988875271] [2024-10-12 20:16:29,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988875271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:29,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:29,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:16:29,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350529240] [2024-10-12 20:16:29,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:29,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:16:29,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:29,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:16:29,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:16:29,638 INFO L87 Difference]: Start difference. First operand 33735 states and 55376 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 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 20:16:30,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:30,104 INFO L93 Difference]: Finished difference Result 109310 states and 179861 transitions. [2024-10-12 20:16:30,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:16:30,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-10-12 20:16:30,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:30,248 INFO L225 Difference]: With dead ends: 109310 [2024-10-12 20:16:30,249 INFO L226 Difference]: Without dead ends: 75807 [2024-10-12 20:16:30,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:16:30,295 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 620 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:30,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 1620 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75807 states. [2024-10-12 20:16:31,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75807 to 54628. [2024-10-12 20:16:31,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54628 states, 54627 states have (on average 1.6368096362604574) internal successors, (89414), 54627 states have internal predecessors, (89414), 0 states have call successors, (0), 0 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 20:16:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54628 states to 54628 states and 89414 transitions. [2024-10-12 20:16:31,587 INFO L78 Accepts]: Start accepts. Automaton has 54628 states and 89414 transitions. Word has length 113 [2024-10-12 20:16:31,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:31,588 INFO L471 AbstractCegarLoop]: Abstraction has 54628 states and 89414 transitions. [2024-10-12 20:16:31,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 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 20:16:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 54628 states and 89414 transitions. [2024-10-12 20:16:31,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-12 20:16:31,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:31,589 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:31,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:16:31,589 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:31,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:31,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1207090581, now seen corresponding path program 1 times [2024-10-12 20:16:31,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:31,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711599856] [2024-10-12 20:16:31,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:31,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:31,827 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 20:16:31,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:31,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711599856] [2024-10-12 20:16:31,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711599856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:31,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:31,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:16:31,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492596140] [2024-10-12 20:16:31,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:31,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:16:31,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:31,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:16:31,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:16:31,830 INFO L87 Difference]: Start difference. First operand 54628 states and 89414 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 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 20:16:32,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:32,530 INFO L93 Difference]: Finished difference Result 175036 states and 287173 transitions. [2024-10-12 20:16:32,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:16:32,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-10-12 20:16:32,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:32,778 INFO L225 Difference]: With dead ends: 175036 [2024-10-12 20:16:32,778 INFO L226 Difference]: Without dead ends: 120640 [2024-10-12 20:16:32,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:16:32,855 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 618 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:32,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1685 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:32,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120640 states. [2024-10-12 20:16:34,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120640 to 87409. [2024-10-12 20:16:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87409 states, 87408 states have (on average 1.632116053450485) internal successors, (142660), 87408 states have internal predecessors, (142660), 0 states have call successors, (0), 0 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 20:16:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87409 states to 87409 states and 142660 transitions. [2024-10-12 20:16:34,642 INFO L78 Accepts]: Start accepts. Automaton has 87409 states and 142660 transitions. Word has length 114 [2024-10-12 20:16:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:34,642 INFO L471 AbstractCegarLoop]: Abstraction has 87409 states and 142660 transitions. [2024-10-12 20:16:34,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 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 20:16:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand 87409 states and 142660 transitions. [2024-10-12 20:16:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-12 20:16:34,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:34,644 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:34,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:16:34,644 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:34,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:34,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1144428250, now seen corresponding path program 1 times [2024-10-12 20:16:34,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:34,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747202715] [2024-10-12 20:16:34,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:34,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:35,009 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 20:16:35,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:35,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747202715] [2024-10-12 20:16:35,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747202715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:35,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:35,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:16:35,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116859140] [2024-10-12 20:16:35,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:35,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:16:35,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:35,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:16:35,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:16:35,011 INFO L87 Difference]: Start difference. First operand 87409 states and 142660 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 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 20:16:36,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:36,062 INFO L93 Difference]: Finished difference Result 174588 states and 284942 transitions. [2024-10-12 20:16:36,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:16:36,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-10-12 20:16:36,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:36,219 INFO L225 Difference]: With dead ends: 174588 [2024-10-12 20:16:36,220 INFO L226 Difference]: Without dead ends: 87411 [2024-10-12 20:16:36,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:16:36,282 INFO L432 NwaCegarLoop]: 503 mSDtfsCounter, 534 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:36,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1943 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:16:36,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87411 states. [2024-10-12 20:16:37,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87411 to 87409. [2024-10-12 20:16:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87409 states, 87408 states have (on average 1.6249656781987918) internal successors, (142035), 87408 states have internal predecessors, (142035), 0 states have call successors, (0), 0 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 20:16:37,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87409 states to 87409 states and 142035 transitions. [2024-10-12 20:16:37,640 INFO L78 Accepts]: Start accepts. Automaton has 87409 states and 142035 transitions. Word has length 116 [2024-10-12 20:16:37,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:37,641 INFO L471 AbstractCegarLoop]: Abstraction has 87409 states and 142035 transitions. [2024-10-12 20:16:37,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 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 20:16:37,641 INFO L276 IsEmpty]: Start isEmpty. Operand 87409 states and 142035 transitions. [2024-10-12 20:16:37,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-12 20:16:37,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:37,644 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:37,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:16:37,644 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:37,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:37,645 INFO L85 PathProgramCache]: Analyzing trace with hash 2034961951, now seen corresponding path program 1 times [2024-10-12 20:16:37,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:37,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238516172] [2024-10-12 20:16:37,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:37,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:38,409 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 20:16:38,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:38,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238516172] [2024-10-12 20:16:38,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238516172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:38,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:38,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:16:38,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778060277] [2024-10-12 20:16:38,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:38,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:16:38,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:38,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:16:38,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:16:38,414 INFO L87 Difference]: Start difference. First operand 87409 states and 142035 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 20:16:39,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:39,099 INFO L93 Difference]: Finished difference Result 255482 states and 415610 transitions. [2024-10-12 20:16:39,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:16:39,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-10-12 20:16:39,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:39,365 INFO L225 Difference]: With dead ends: 255482 [2024-10-12 20:16:39,366 INFO L226 Difference]: Without dead ends: 168305 [2024-10-12 20:16:39,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:16:39,468 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 528 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:39,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 1958 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:16:39,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168305 states. [2024-10-12 20:16:41,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168305 to 168303. [2024-10-12 20:16:42,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168303 states, 168302 states have (on average 1.6157621418640302) internal successors, (271936), 168302 states have internal predecessors, (271936), 0 states have call successors, (0), 0 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 20:16:42,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168303 states to 168303 states and 271936 transitions. [2024-10-12 20:16:42,789 INFO L78 Accepts]: Start accepts. Automaton has 168303 states and 271936 transitions. Word has length 119 [2024-10-12 20:16:42,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:42,789 INFO L471 AbstractCegarLoop]: Abstraction has 168303 states and 271936 transitions. [2024-10-12 20:16:42,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 20:16:42,789 INFO L276 IsEmpty]: Start isEmpty. Operand 168303 states and 271936 transitions. [2024-10-12 20:16:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-12 20:16:42,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:42,790 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:16:42,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:16:42,790 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:42,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:42,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1342598109, now seen corresponding path program 1 times [2024-10-12 20:16:42,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:42,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143651755] [2024-10-12 20:16:42,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:42,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:43,308 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 20:16:43,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:43,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143651755] [2024-10-12 20:16:43,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143651755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:43,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:43,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:16:43,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026576248] [2024-10-12 20:16:43,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:43,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:16:43,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:43,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:16:43,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:16:43,312 INFO L87 Difference]: Start difference. First operand 168303 states and 271936 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 20:16:44,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:44,215 INFO L93 Difference]: Finished difference Result 172177 states and 277745 transitions. [2024-10-12 20:16:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:16:44,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2024-10-12 20:16:44,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:44,486 INFO L225 Difference]: With dead ends: 172177 [2024-10-12 20:16:44,486 INFO L226 Difference]: Without dead ends: 172175 [2024-10-12 20:16:44,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:16:44,514 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 0 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:44,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2017 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:44,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172175 states. [2024-10-12 20:16:46,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172175 to 172175. [2024-10-12 20:16:46,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172175 states, 172174 states have (on average 1.6017575243648867) internal successors, (275781), 172174 states have internal predecessors, (275781), 0 states have call successors, (0), 0 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 20:16:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172175 states to 172175 states and 275781 transitions. [2024-10-12 20:16:47,431 INFO L78 Accepts]: Start accepts. Automaton has 172175 states and 275781 transitions. Word has length 120 [2024-10-12 20:16:47,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:47,431 INFO L471 AbstractCegarLoop]: Abstraction has 172175 states and 275781 transitions. [2024-10-12 20:16:47,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 20:16:47,432 INFO L276 IsEmpty]: Start isEmpty. Operand 172175 states and 275781 transitions. [2024-10-12 20:16:47,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-12 20:16:47,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:47,439 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:16:47,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:16:47,439 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:47,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:47,440 INFO L85 PathProgramCache]: Analyzing trace with hash -893941710, now seen corresponding path program 1 times [2024-10-12 20:16:47,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:47,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492408886] [2024-10-12 20:16:47,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:47,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 20:16:47,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:47,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492408886] [2024-10-12 20:16:47,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492408886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:47,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:47,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:16:47,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937983935] [2024-10-12 20:16:47,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:47,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:16:47,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:47,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:16:47,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:16:47,668 INFO L87 Difference]: Start difference. First operand 172175 states and 275781 transitions. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 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 20:16:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:49,779 INFO L93 Difference]: Finished difference Result 469201 states and 754034 transitions. [2024-10-12 20:16:49,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:16:49,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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 150 [2024-10-12 20:16:49,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:50,653 INFO L225 Difference]: With dead ends: 469201 [2024-10-12 20:16:50,653 INFO L226 Difference]: Without dead ends: 393549 [2024-10-12 20:16:50,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:16:50,788 INFO L432 NwaCegarLoop]: 715 mSDtfsCounter, 1405 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1405 SdHoareTripleChecker+Valid, 2548 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:50,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1405 Valid, 2548 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:16:51,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393549 states. [2024-10-12 20:16:55,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393549 to 276607. [2024-10-12 20:16:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276607 states, 276606 states have (on average 1.6001207493691387) internal successors, (442603), 276606 states have internal predecessors, (442603), 0 states have call successors, (0), 0 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 20:16:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276607 states to 276607 states and 442603 transitions. [2024-10-12 20:16:56,725 INFO L78 Accepts]: Start accepts. Automaton has 276607 states and 442603 transitions. Word has length 150 [2024-10-12 20:16:56,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:56,725 INFO L471 AbstractCegarLoop]: Abstraction has 276607 states and 442603 transitions. [2024-10-12 20:16:56,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 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 20:16:56,725 INFO L276 IsEmpty]: Start isEmpty. Operand 276607 states and 442603 transitions. [2024-10-12 20:16:56,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-12 20:16:56,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:56,734 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:16:56,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:16:56,734 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:56,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:56,735 INFO L85 PathProgramCache]: Analyzing trace with hash -652269282, now seen corresponding path program 1 times [2024-10-12 20:16:56,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:56,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767571039] [2024-10-12 20:16:56,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:56,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 20:16:56,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:56,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767571039] [2024-10-12 20:16:56,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767571039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:56,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:56,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:16:56,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660049312] [2024-10-12 20:16:56,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:56,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:16:56,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:56,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:16:56,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:16:56,899 INFO L87 Difference]: Start difference. First operand 276607 states and 442603 transitions. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 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 20:16:58,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:58,894 INFO L93 Difference]: Finished difference Result 499221 states and 802374 transitions. [2024-10-12 20:16:58,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:16:58,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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 150 [2024-10-12 20:16:58,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:59,703 INFO L225 Difference]: With dead ends: 499221 [2024-10-12 20:16:59,704 INFO L226 Difference]: Without dead ends: 423569 [2024-10-12 20:16:59,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:16:59,837 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 1277 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 2671 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:59,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 2671 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:17:00,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423569 states. [2024-10-12 20:17:04,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423569 to 373873. [2024-10-12 20:17:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373873 states, 373872 states have (on average 1.6012458809432104) internal successors, (598661), 373872 states have internal predecessors, (598661), 0 states have call successors, (0), 0 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 20:17:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373873 states to 373873 states and 598661 transitions. [2024-10-12 20:17:06,520 INFO L78 Accepts]: Start accepts. Automaton has 373873 states and 598661 transitions. Word has length 150 [2024-10-12 20:17:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:17:06,521 INFO L471 AbstractCegarLoop]: Abstraction has 373873 states and 598661 transitions. [2024-10-12 20:17:06,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 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 20:17:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 373873 states and 598661 transitions. [2024-10-12 20:17:06,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-12 20:17:06,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:17:06,535 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:17:06,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:17:06,535 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:17:06,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:17:06,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1693206396, now seen corresponding path program 1 times [2024-10-12 20:17:06,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:17:06,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784416184] [2024-10-12 20:17:06,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:17:06,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:17:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:17:06,960 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 20:17:06,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:17:06,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784416184] [2024-10-12 20:17:06,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784416184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:17:06,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:17:06,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:17:06,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855794305] [2024-10-12 20:17:06,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:17:06,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:17:06,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:17:06,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:17:06,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:17:06,962 INFO L87 Difference]: Start difference. First operand 373873 states and 598661 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)