./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/pals_floodmax.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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/pals_floodmax.3.ufo.BOUNDED-6.pals.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 3f728e04159b75fd4f86d9e171d07387390897d2fdfdd24db8ac526a2f9d83e1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:20:12,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:20:12,696 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:20:12,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:20:12,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:20:12,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:20:12,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:20:12,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:20:12,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:20:12,728 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:20:12,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:20:12,729 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:20:12,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:20:12,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:20:12,731 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:20:12,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:20:12,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:20:12,732 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:20:12,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:20:12,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:20:12,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:20:12,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:20:12,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:20:12,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:20:12,733 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:20:12,733 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:20:12,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:20:12,734 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:20:12,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:20:12,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:20:12,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:20:12,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:20:12,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:20:12,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:20:12,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:20:12,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:20:12,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:20:12,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:20:12,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:20:12,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:20:12,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:20:12,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:20:12,737 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 -> 3f728e04159b75fd4f86d9e171d07387390897d2fdfdd24db8ac526a2f9d83e1 [2024-10-24 01:20:12,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:20:13,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:20:13,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:20:13,007 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:20:13,008 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:20:13,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.BOUNDED-6.pals.c [2024-10-24 01:20:14,225 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:20:14,427 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:20:14,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.BOUNDED-6.pals.c [2024-10-24 01:20:14,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf6bf7e8/e6fb91da84e94e62b1497351f3b1ab89/FLAG71f5ebd95 [2024-10-24 01:20:14,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf6bf7e8/e6fb91da84e94e62b1497351f3b1ab89 [2024-10-24 01:20:14,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:20:14,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:20:14,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:20:14,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:20:14,816 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:20:14,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:20:14" (1/1) ... [2024-10-24 01:20:14,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dca12fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:14, skipping insertion in model container [2024-10-24 01:20:14,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:20:14" (1/1) ... [2024-10-24 01:20:14,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:20:15,054 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/pals_floodmax.3.ufo.BOUNDED-6.pals.c[12762,12775] [2024-10-24 01:20:15,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:20:15,073 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:20:15,113 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/pals_floodmax.3.ufo.BOUNDED-6.pals.c[12762,12775] [2024-10-24 01:20:15,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:20:15,136 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:20:15,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:15 WrapperNode [2024-10-24 01:20:15,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:20:15,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:20:15,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:20:15,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:20:15,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:15" (1/1) ... [2024-10-24 01:20:15,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:15" (1/1) ... [2024-10-24 01:20:15,183 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 452 [2024-10-24 01:20:15,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:20:15,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:20:15,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:20:15,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:20:15,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:15" (1/1) ... [2024-10-24 01:20:15,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:15" (1/1) ... [2024-10-24 01:20:15,198 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:15" (1/1) ... [2024-10-24 01:20:15,217 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-24 01:20:15,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:15" (1/1) ... [2024-10-24 01:20:15,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:15" (1/1) ... [2024-10-24 01:20:15,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:15" (1/1) ... [2024-10-24 01:20:15,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:15" (1/1) ... [2024-10-24 01:20:15,231 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:15" (1/1) ... [2024-10-24 01:20:15,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:15" (1/1) ... [2024-10-24 01:20:15,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:20:15,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:20:15,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:20:15,237 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:20:15,237 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:15" (1/1) ... [2024-10-24 01:20:15,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:20:15,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:20:15,276 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-24 01:20:15,278 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-24 01:20:15,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:20:15,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:20:15,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:20:15,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:20:15,408 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:20:15,410 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:20:15,867 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-10-24 01:20:15,868 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:20:15,912 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:20:15,913 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 01:20:15,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:20:15 BoogieIcfgContainer [2024-10-24 01:20:15,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:20:15,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:20:15,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:20:15,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:20:15,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:20:14" (1/3) ... [2024-10-24 01:20:15,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c3384d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:20:15, skipping insertion in model container [2024-10-24 01:20:15,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:15" (2/3) ... [2024-10-24 01:20:15,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c3384d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:20:15, skipping insertion in model container [2024-10-24 01:20:15,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:20:15" (3/3) ... [2024-10-24 01:20:15,920 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c [2024-10-24 01:20:15,940 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:20:15,940 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:20:15,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:20:16,003 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;@a5c8e26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:20:16,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:20:16,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 112 states have (on average 1.8214285714285714) internal successors, (204), 113 states have internal predecessors, (204), 0 states have call successors, (0), 0 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-24 01:20:16,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 01:20:16,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:16,021 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] [2024-10-24 01:20:16,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:16,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:16,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1477667755, now seen corresponding path program 1 times [2024-10-24 01:20:16,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:16,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237851798] [2024-10-24 01:20:16,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:16,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:16,283 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-24 01:20:16,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:16,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237851798] [2024-10-24 01:20:16,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237851798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:16,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:16,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 01:20:16,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043996322] [2024-10-24 01:20:16,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:16,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 01:20:16,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:16,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 01:20:16,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 01:20:16,307 INFO L87 Difference]: Start difference. First operand has 114 states, 112 states have (on average 1.8214285714285714) internal successors, (204), 113 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:16,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:16,338 INFO L93 Difference]: Finished difference Result 174 states and 308 transitions. [2024-10-24 01:20:16,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 01:20:16,347 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-24 01:20:16,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:16,355 INFO L225 Difference]: With dead ends: 174 [2024-10-24 01:20:16,356 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 01:20:16,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 01:20:16,362 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:16,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:16,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 01:20:16,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-24 01:20:16,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.7927927927927927) internal successors, (199), 111 states have internal predecessors, (199), 0 states have call successors, (0), 0 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-24 01:20:16,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 199 transitions. [2024-10-24 01:20:16,392 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 199 transitions. Word has length 34 [2024-10-24 01:20:16,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:16,392 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 199 transitions. [2024-10-24 01:20:16,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:16,393 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 199 transitions. [2024-10-24 01:20:16,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 01:20:16,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:16,394 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] [2024-10-24 01:20:16,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:20:16,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:16,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:16,395 INFO L85 PathProgramCache]: Analyzing trace with hash -211275987, now seen corresponding path program 1 times [2024-10-24 01:20:16,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:16,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315586030] [2024-10-24 01:20:16,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:16,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:16,606 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-24 01:20:16,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:16,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315586030] [2024-10-24 01:20:16,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315586030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:16,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:16,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:20:16,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944743988] [2024-10-24 01:20:16,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:16,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:20:16,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:16,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:20:16,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:20:16,610 INFO L87 Difference]: Start difference. First operand 112 states and 199 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:16,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:16,695 INFO L93 Difference]: Finished difference Result 229 states and 400 transitions. [2024-10-24 01:20:16,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:20:16,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-24 01:20:16,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:16,699 INFO L225 Difference]: With dead ends: 229 [2024-10-24 01:20:16,699 INFO L226 Difference]: Without dead ends: 169 [2024-10-24 01:20:16,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:20:16,700 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 98 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:16,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 552 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:20:16,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-24 01:20:16,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 112. [2024-10-24 01:20:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.5495495495495495) internal successors, (172), 111 states have internal predecessors, (172), 0 states have call successors, (0), 0 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-24 01:20:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 172 transitions. [2024-10-24 01:20:16,711 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 172 transitions. Word has length 34 [2024-10-24 01:20:16,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:16,711 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 172 transitions. [2024-10-24 01:20:16,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 172 transitions. [2024-10-24 01:20:16,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 01:20:16,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:16,713 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] [2024-10-24 01:20:16,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:20:16,713 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:16,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:16,715 INFO L85 PathProgramCache]: Analyzing trace with hash -985754314, now seen corresponding path program 1 times [2024-10-24 01:20:16,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:16,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122772594] [2024-10-24 01:20:16,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:16,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:16,810 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-24 01:20:16,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:16,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122772594] [2024-10-24 01:20:16,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122772594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:16,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:16,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:16,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657922899] [2024-10-24 01:20:16,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:16,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:16,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:16,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:16,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:16,813 INFO L87 Difference]: Start difference. First operand 112 states and 172 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-24 01:20:16,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:16,853 INFO L93 Difference]: Finished difference Result 217 states and 353 transitions. [2024-10-24 01:20:16,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:16,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-24 01:20:16,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:16,856 INFO L225 Difference]: With dead ends: 217 [2024-10-24 01:20:16,856 INFO L226 Difference]: Without dead ends: 160 [2024-10-24 01:20:16,857 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-24 01:20:16,858 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 74 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 363 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-24 01:20:16,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 363 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:16,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-24 01:20:16,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2024-10-24 01:20:16,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.5796178343949046) internal successors, (248), 157 states have internal predecessors, (248), 0 states have call successors, (0), 0 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-24 01:20:16,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 248 transitions. [2024-10-24 01:20:16,872 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 248 transitions. Word has length 60 [2024-10-24 01:20:16,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:16,872 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 248 transitions. [2024-10-24 01:20:16,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-24 01:20:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 248 transitions. [2024-10-24 01:20:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-24 01:20:16,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:16,873 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] [2024-10-24 01:20:16,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:20:16,874 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:16,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:16,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1305875761, now seen corresponding path program 1 times [2024-10-24 01:20:16,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:16,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7944198] [2024-10-24 01:20:16,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:16,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:16,952 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-24 01:20:16,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:16,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7944198] [2024-10-24 01:20:16,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7944198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:16,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:16,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:16,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689089768] [2024-10-24 01:20:16,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:16,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:16,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:16,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:16,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:16,954 INFO L87 Difference]: Start difference. First operand 158 states and 248 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-24 01:20:16,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:16,979 INFO L93 Difference]: Finished difference Result 263 states and 429 transitions. [2024-10-24 01:20:16,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:16,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-24 01:20:16,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:16,980 INFO L225 Difference]: With dead ends: 263 [2024-10-24 01:20:16,980 INFO L226 Difference]: Without dead ends: 206 [2024-10-24 01:20:16,981 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-24 01:20:16,982 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 83 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:16,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 389 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:16,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-24 01:20:16,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2024-10-24 01:20:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.6108374384236452) internal successors, (327), 203 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 327 transitions. [2024-10-24 01:20:16,993 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 327 transitions. Word has length 62 [2024-10-24 01:20:16,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:16,993 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 327 transitions. [2024-10-24 01:20:16,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-24 01:20:16,994 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 327 transitions. [2024-10-24 01:20:16,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-24 01:20:16,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:16,995 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] [2024-10-24 01:20:16,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:20:16,995 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:16,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:16,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1944934066, now seen corresponding path program 1 times [2024-10-24 01:20:16,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:16,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056726602] [2024-10-24 01:20:16,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:16,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:17,108 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-24 01:20:17,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:17,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056726602] [2024-10-24 01:20:17,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056726602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:17,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:17,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:17,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149965307] [2024-10-24 01:20:17,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:17,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:17,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:17,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:17,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:17,110 INFO L87 Difference]: Start difference. First operand 204 states and 327 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-24 01:20:17,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:17,140 INFO L93 Difference]: Finished difference Result 477 states and 792 transitions. [2024-10-24 01:20:17,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:17,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-24 01:20:17,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:17,141 INFO L225 Difference]: With dead ends: 477 [2024-10-24 01:20:17,141 INFO L226 Difference]: Without dead ends: 330 [2024-10-24 01:20:17,142 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-24 01:20:17,143 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 76 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:17,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 376 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:17,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-10-24 01:20:17,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2024-10-24 01:20:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.6391437308868502) internal successors, (536), 327 states have internal predecessors, (536), 0 states have call successors, (0), 0 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-24 01:20:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 536 transitions. [2024-10-24 01:20:17,162 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 536 transitions. Word has length 62 [2024-10-24 01:20:17,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:17,162 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 536 transitions. [2024-10-24 01:20:17,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-24 01:20:17,163 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 536 transitions. [2024-10-24 01:20:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 01:20:17,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:17,164 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] [2024-10-24 01:20:17,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:20:17,164 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:17,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:17,165 INFO L85 PathProgramCache]: Analyzing trace with hash -386894903, now seen corresponding path program 1 times [2024-10-24 01:20:17,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:17,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063458391] [2024-10-24 01:20:17,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:17,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:17,262 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-24 01:20:17,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:17,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063458391] [2024-10-24 01:20:17,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063458391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:17,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:17,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:17,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784524574] [2024-10-24 01:20:17,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:17,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:17,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:17,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:17,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:17,264 INFO L87 Difference]: Start difference. First operand 328 states and 536 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-24 01:20:17,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:17,292 INFO L93 Difference]: Finished difference Result 595 states and 989 transitions. [2024-10-24 01:20:17,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:17,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-24 01:20:17,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:17,294 INFO L225 Difference]: With dead ends: 595 [2024-10-24 01:20:17,294 INFO L226 Difference]: Without dead ends: 448 [2024-10-24 01:20:17,294 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-24 01:20:17,298 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 77 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:17,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 381 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:17,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-24 01:20:17,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 446. [2024-10-24 01:20:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.644943820224719) internal successors, (732), 445 states have internal predecessors, (732), 0 states have call successors, (0), 0 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-24 01:20:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 732 transitions. [2024-10-24 01:20:17,317 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 732 transitions. Word has length 64 [2024-10-24 01:20:17,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:17,319 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 732 transitions. [2024-10-24 01:20:17,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-24 01:20:17,319 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 732 transitions. [2024-10-24 01:20:17,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 01:20:17,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:17,320 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] [2024-10-24 01:20:17,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:20:17,320 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:17,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:17,321 INFO L85 PathProgramCache]: Analyzing trace with hash 892182118, now seen corresponding path program 1 times [2024-10-24 01:20:17,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:17,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565350262] [2024-10-24 01:20:17,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:17,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:17,407 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-24 01:20:17,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:17,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565350262] [2024-10-24 01:20:17,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565350262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:17,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:17,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:17,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193308387] [2024-10-24 01:20:17,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:17,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:17,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:17,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:17,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:17,410 INFO L87 Difference]: Start difference. First operand 446 states and 732 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-24 01:20:17,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:17,434 INFO L93 Difference]: Finished difference Result 1149 states and 1913 transitions. [2024-10-24 01:20:17,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:17,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-24 01:20:17,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:17,438 INFO L225 Difference]: With dead ends: 1149 [2024-10-24 01:20:17,438 INFO L226 Difference]: Without dead ends: 766 [2024-10-24 01:20:17,440 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-24 01:20:17,441 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 70 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:17,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 369 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:17,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-10-24 01:20:17,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 764. [2024-10-24 01:20:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 763 states have (on average 1.6435124508519003) internal successors, (1254), 763 states have internal predecessors, (1254), 0 states have call successors, (0), 0 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-24 01:20:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1254 transitions. [2024-10-24 01:20:17,459 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1254 transitions. Word has length 64 [2024-10-24 01:20:17,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:17,460 INFO L471 AbstractCegarLoop]: Abstraction has 764 states and 1254 transitions. [2024-10-24 01:20:17,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-24 01:20:17,461 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1254 transitions. [2024-10-24 01:20:17,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 01:20:17,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:17,465 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] [2024-10-24 01:20:17,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:20:17,465 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:17,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:17,465 INFO L85 PathProgramCache]: Analyzing trace with hash 539603809, now seen corresponding path program 1 times [2024-10-24 01:20:17,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:17,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66336804] [2024-10-24 01:20:17,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:17,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:17,551 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-24 01:20:17,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:17,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66336804] [2024-10-24 01:20:17,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66336804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:17,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:17,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:17,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275445693] [2024-10-24 01:20:17,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:17,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:17,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:17,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:17,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:17,553 INFO L87 Difference]: Start difference. First operand 764 states and 1254 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-24 01:20:17,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:17,582 INFO L93 Difference]: Finished difference Result 1437 states and 2381 transitions. [2024-10-24 01:20:17,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:17,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-10-24 01:20:17,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:17,586 INFO L225 Difference]: With dead ends: 1437 [2024-10-24 01:20:17,586 INFO L226 Difference]: Without dead ends: 1054 [2024-10-24 01:20:17,587 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-24 01:20:17,588 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 71 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:17,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 373 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:17,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2024-10-24 01:20:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1052. [2024-10-24 01:20:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.637488106565176) internal successors, (1721), 1051 states have internal predecessors, (1721), 0 states have call successors, (0), 0 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-24 01:20:17,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1721 transitions. [2024-10-24 01:20:17,610 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1721 transitions. Word has length 66 [2024-10-24 01:20:17,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:17,611 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1721 transitions. [2024-10-24 01:20:17,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-24 01:20:17,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1721 transitions. [2024-10-24 01:20:17,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 01:20:17,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:17,613 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] [2024-10-24 01:20:17,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:20:17,613 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:17,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:17,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1422478210, now seen corresponding path program 1 times [2024-10-24 01:20:17,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:17,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855492638] [2024-10-24 01:20:17,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:17,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:17,715 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-24 01:20:17,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:17,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855492638] [2024-10-24 01:20:17,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855492638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:17,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:17,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:20:17,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136244920] [2024-10-24 01:20:17,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:17,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:20:17,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:17,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:20:17,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:20:17,717 INFO L87 Difference]: Start difference. First operand 1052 states and 1721 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-24 01:20:17,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:17,893 INFO L93 Difference]: Finished difference Result 5336 states and 8927 transitions. [2024-10-24 01:20:17,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:20:17,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-10-24 01:20:17,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:17,910 INFO L225 Difference]: With dead ends: 5336 [2024-10-24 01:20:17,910 INFO L226 Difference]: Without dead ends: 4353 [2024-10-24 01:20:17,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:20:17,915 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 576 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:17,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1062 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:20:17,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4353 states. [2024-10-24 01:20:17,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4353 to 1969. [2024-10-24 01:20:17,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.6346544715447155) internal successors, (3217), 1968 states have internal predecessors, (3217), 0 states have call successors, (0), 0 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-24 01:20:17,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 3217 transitions. [2024-10-24 01:20:17,997 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 3217 transitions. Word has length 66 [2024-10-24 01:20:17,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:17,998 INFO L471 AbstractCegarLoop]: Abstraction has 1969 states and 3217 transitions. [2024-10-24 01:20:17,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-24 01:20:17,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 3217 transitions. [2024-10-24 01:20:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-24 01:20:18,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:18,001 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] [2024-10-24 01:20:18,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:20:18,002 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:18,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:18,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1209872637, now seen corresponding path program 1 times [2024-10-24 01:20:18,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:18,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497240886] [2024-10-24 01:20:18,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:18,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:18,089 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-24 01:20:18,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:18,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497240886] [2024-10-24 01:20:18,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497240886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:18,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:18,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:20:18,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743375188] [2024-10-24 01:20:18,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:18,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:20:18,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:18,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:20:18,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:20:18,090 INFO L87 Difference]: Start difference. First operand 1969 states and 3217 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 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-24 01:20:18,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:18,188 INFO L93 Difference]: Finished difference Result 6431 states and 10655 transitions. [2024-10-24 01:20:18,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:20:18,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-10-24 01:20:18,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:18,203 INFO L225 Difference]: With dead ends: 6431 [2024-10-24 01:20:18,203 INFO L226 Difference]: Without dead ends: 4531 [2024-10-24 01:20:18,207 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-24 01:20:18,207 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 280 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:18,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 542 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:18,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2024-10-24 01:20:18,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 3231. [2024-10-24 01:20:18,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3231 states, 3230 states have (on average 1.6368421052631579) internal successors, (5287), 3230 states have internal predecessors, (5287), 0 states have call successors, (0), 0 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-24 01:20:18,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3231 states to 3231 states and 5287 transitions. [2024-10-24 01:20:18,316 INFO L78 Accepts]: Start accepts. Automaton has 3231 states and 5287 transitions. Word has length 67 [2024-10-24 01:20:18,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:18,316 INFO L471 AbstractCegarLoop]: Abstraction has 3231 states and 5287 transitions. [2024-10-24 01:20:18,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 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-24 01:20:18,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3231 states and 5287 transitions. [2024-10-24 01:20:18,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 01:20:18,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:18,317 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] [2024-10-24 01:20:18,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:20:18,317 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:18,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:18,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1091384583, now seen corresponding path program 1 times [2024-10-24 01:20:18,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:18,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537635940] [2024-10-24 01:20:18,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:18,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:18,394 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-24 01:20:18,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:18,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537635940] [2024-10-24 01:20:18,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537635940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:18,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:18,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:20:18,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32268741] [2024-10-24 01:20:18,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:18,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:20:18,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:18,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:20:18,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:20:18,397 INFO L87 Difference]: Start difference. First operand 3231 states and 5287 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-24 01:20:18,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:18,525 INFO L93 Difference]: Finished difference Result 10391 states and 17091 transitions. [2024-10-24 01:20:18,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:20:18,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-10-24 01:20:18,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:18,545 INFO L225 Difference]: With dead ends: 10391 [2024-10-24 01:20:18,545 INFO L226 Difference]: Without dead ends: 7229 [2024-10-24 01:20:18,551 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-24 01:20:18,552 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 278 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:18,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 539 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:18,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7229 states. [2024-10-24 01:20:18,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7229 to 5201. [2024-10-24 01:20:18,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5201 states, 5200 states have (on average 1.6259615384615385) internal successors, (8455), 5200 states have internal predecessors, (8455), 0 states have call successors, (0), 0 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-24 01:20:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5201 states to 5201 states and 8455 transitions. [2024-10-24 01:20:18,742 INFO L78 Accepts]: Start accepts. Automaton has 5201 states and 8455 transitions. Word has length 68 [2024-10-24 01:20:18,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:18,743 INFO L471 AbstractCegarLoop]: Abstraction has 5201 states and 8455 transitions. [2024-10-24 01:20:18,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-24 01:20:18,743 INFO L276 IsEmpty]: Start isEmpty. Operand 5201 states and 8455 transitions. [2024-10-24 01:20:18,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 01:20:18,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:18,744 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] [2024-10-24 01:20:18,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:20:18,744 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:18,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:18,744 INFO L85 PathProgramCache]: Analyzing trace with hash -578633876, now seen corresponding path program 1 times [2024-10-24 01:20:18,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:18,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224513742] [2024-10-24 01:20:18,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:18,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:18,835 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-24 01:20:18,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:18,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224513742] [2024-10-24 01:20:18,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224513742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:18,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:18,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:20:18,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995584299] [2024-10-24 01:20:18,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:18,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:20:18,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:18,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:20:18,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:20:18,837 INFO L87 Difference]: Start difference. First operand 5201 states and 8455 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-24 01:20:19,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:19,054 INFO L93 Difference]: Finished difference Result 16423 states and 26807 transitions. [2024-10-24 01:20:19,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:20:19,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-10-24 01:20:19,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:19,092 INFO L225 Difference]: With dead ends: 16423 [2024-10-24 01:20:19,092 INFO L226 Difference]: Without dead ends: 11291 [2024-10-24 01:20:19,098 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-24 01:20:19,098 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 276 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:19,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 541 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:20:19,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11291 states. [2024-10-24 01:20:19,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11291 to 8203. [2024-10-24 01:20:19,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8203 states, 8202 states have (on average 1.6146061936113143) internal successors, (13243), 8202 states have internal predecessors, (13243), 0 states have call successors, (0), 0 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-24 01:20:19,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8203 states to 8203 states and 13243 transitions. [2024-10-24 01:20:19,324 INFO L78 Accepts]: Start accepts. Automaton has 8203 states and 13243 transitions. Word has length 69 [2024-10-24 01:20:19,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:19,325 INFO L471 AbstractCegarLoop]: Abstraction has 8203 states and 13243 transitions. [2024-10-24 01:20:19,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-24 01:20:19,325 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 13243 transitions. [2024-10-24 01:20:19,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-24 01:20:19,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:19,326 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] [2024-10-24 01:20:19,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:20:19,326 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:19,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:19,326 INFO L85 PathProgramCache]: Analyzing trace with hash 802275316, now seen corresponding path program 1 times [2024-10-24 01:20:19,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:19,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095601241] [2024-10-24 01:20:19,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:19,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:19,487 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-24 01:20:19,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:19,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095601241] [2024-10-24 01:20:19,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095601241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:19,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:19,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:20:19,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554170182] [2024-10-24 01:20:19,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:19,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:20:19,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:19,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:20:19,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:20:19,489 INFO L87 Difference]: Start difference. First operand 8203 states and 13243 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-24 01:20:19,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:19,677 INFO L93 Difference]: Finished difference Result 16339 states and 26396 transitions. [2024-10-24 01:20:19,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:20:19,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-10-24 01:20:19,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:19,690 INFO L225 Difference]: With dead ends: 16339 [2024-10-24 01:20:19,691 INFO L226 Difference]: Without dead ends: 8205 [2024-10-24 01:20:19,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:20:19,697 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 70 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:19,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 593 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:20:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8205 states. [2024-10-24 01:20:19,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8205 to 8203. [2024-10-24 01:20:19,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8203 states, 8202 states have (on average 1.599366008290661) internal successors, (13118), 8202 states have internal predecessors, (13118), 0 states have call successors, (0), 0 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-24 01:20:19,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8203 states to 8203 states and 13118 transitions. [2024-10-24 01:20:19,921 INFO L78 Accepts]: Start accepts. Automaton has 8203 states and 13118 transitions. Word has length 71 [2024-10-24 01:20:19,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:19,921 INFO L471 AbstractCegarLoop]: Abstraction has 8203 states and 13118 transitions. [2024-10-24 01:20:19,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-24 01:20:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 13118 transitions. [2024-10-24 01:20:19,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 01:20:19,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:19,922 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] [2024-10-24 01:20:19,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:20:19,922 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:19,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:19,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1920185732, now seen corresponding path program 1 times [2024-10-24 01:20:19,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:19,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264766306] [2024-10-24 01:20:19,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:19,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:20,099 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-24 01:20:20,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:20,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264766306] [2024-10-24 01:20:20,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264766306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:20,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:20,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:20:20,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036707585] [2024-10-24 01:20:20,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:20,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:20:20,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:20,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:20:20,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:20:20,101 INFO L87 Difference]: Start difference. First operand 8203 states and 13118 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-24 01:20:20,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:20,386 INFO L93 Difference]: Finished difference Result 23501 states and 37734 transitions. [2024-10-24 01:20:20,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:20:20,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-24 01:20:20,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:20,411 INFO L225 Difference]: With dead ends: 23501 [2024-10-24 01:20:20,411 INFO L226 Difference]: Without dead ends: 15367 [2024-10-24 01:20:20,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:20:20,419 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 135 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:20,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 455 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:20,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15367 states. [2024-10-24 01:20:20,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15367 to 15365. [2024-10-24 01:20:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15365 states, 15364 states have (on average 1.582725852642541) internal successors, (24317), 15364 states have internal predecessors, (24317), 0 states have call successors, (0), 0 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-24 01:20:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15365 states to 15365 states and 24317 transitions. [2024-10-24 01:20:20,801 INFO L78 Accepts]: Start accepts. Automaton has 15365 states and 24317 transitions. Word has length 74 [2024-10-24 01:20:20,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:20,801 INFO L471 AbstractCegarLoop]: Abstraction has 15365 states and 24317 transitions. [2024-10-24 01:20:20,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-24 01:20:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 15365 states and 24317 transitions. [2024-10-24 01:20:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 01:20:20,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:20,803 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] [2024-10-24 01:20:20,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:20:20,803 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:20,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:20,804 INFO L85 PathProgramCache]: Analyzing trace with hash -618303701, now seen corresponding path program 1 times [2024-10-24 01:20:20,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:20,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750410746] [2024-10-24 01:20:20,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:20,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:20,960 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-24 01:20:20,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:20,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750410746] [2024-10-24 01:20:20,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750410746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:20,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:20,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:20:20,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872218043] [2024-10-24 01:20:20,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:20,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:20:20,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:20,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:20:20,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:20:20,962 INFO L87 Difference]: Start difference. First operand 15365 states and 24317 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-24 01:20:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:21,161 INFO L93 Difference]: Finished difference Result 16091 states and 25404 transitions. [2024-10-24 01:20:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:20:21,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-10-24 01:20:21,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:21,187 INFO L225 Difference]: With dead ends: 16091 [2024-10-24 01:20:21,187 INFO L226 Difference]: Without dead ends: 16089 [2024-10-24 01:20:21,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:20:21,193 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:21,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:21,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16089 states. [2024-10-24 01:20:21,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16089 to 16089. [2024-10-24 01:20:21,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16089 states, 16088 states have (on average 1.555942317255097) internal successors, (25032), 16088 states have internal predecessors, (25032), 0 states have call successors, (0), 0 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-24 01:20:21,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16089 states to 16089 states and 25032 transitions. [2024-10-24 01:20:21,576 INFO L78 Accepts]: Start accepts. Automaton has 16089 states and 25032 transitions. Word has length 75 [2024-10-24 01:20:21,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:21,577 INFO L471 AbstractCegarLoop]: Abstraction has 16089 states and 25032 transitions. [2024-10-24 01:20:21,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-24 01:20:21,577 INFO L276 IsEmpty]: Start isEmpty. Operand 16089 states and 25032 transitions. [2024-10-24 01:20:21,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:20:21,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:21,579 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:20:21,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:20:21,579 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:21,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:21,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2029578417, now seen corresponding path program 1 times [2024-10-24 01:20:21,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:21,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410351009] [2024-10-24 01:20:21,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:21,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:20:21,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:21,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410351009] [2024-10-24 01:20:21,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410351009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:21,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:21,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:21,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489426106] [2024-10-24 01:20:21,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:21,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:21,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:21,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:21,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:21,652 INFO L87 Difference]: Start difference. First operand 16089 states and 25032 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:22,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:22,116 INFO L93 Difference]: Finished difference Result 48009 states and 74629 transitions. [2024-10-24 01:20:22,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:22,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-24 01:20:22,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:22,185 INFO L225 Difference]: With dead ends: 48009 [2024-10-24 01:20:22,185 INFO L226 Difference]: Without dead ends: 31985 [2024-10-24 01:20:22,205 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-24 01:20:22,205 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 110 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:22,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 399 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:22,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31985 states. [2024-10-24 01:20:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31985 to 31983. [2024-10-24 01:20:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31983 states, 31982 states have (on average 1.5403039209555376) internal successors, (49262), 31982 states have internal predecessors, (49262), 0 states have call successors, (0), 0 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-24 01:20:22,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31983 states to 31983 states and 49262 transitions. [2024-10-24 01:20:22,785 INFO L78 Accepts]: Start accepts. Automaton has 31983 states and 49262 transitions. Word has length 99 [2024-10-24 01:20:22,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:22,785 INFO L471 AbstractCegarLoop]: Abstraction has 31983 states and 49262 transitions. [2024-10-24 01:20:22,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:22,786 INFO L276 IsEmpty]: Start isEmpty. Operand 31983 states and 49262 transitions. [2024-10-24 01:20:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:20:22,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:22,789 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 01:20:22,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:20:22,789 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:22,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:22,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1881455852, now seen corresponding path program 1 times [2024-10-24 01:20:22,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:22,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883270348] [2024-10-24 01:20:22,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:22,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:20:22,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:22,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883270348] [2024-10-24 01:20:22,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883270348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:22,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:22,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:22,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674812472] [2024-10-24 01:20:22,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:22,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:22,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:22,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:22,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:22,860 INFO L87 Difference]: Start difference. First operand 31983 states and 49262 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-24 01:20:23,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:23,687 INFO L93 Difference]: Finished difference Result 95477 states and 146924 transitions. [2024-10-24 01:20:23,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:23,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-24 01:20:23,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:23,834 INFO L225 Difference]: With dead ends: 95477 [2024-10-24 01:20:23,834 INFO L226 Difference]: Without dead ends: 63592 [2024-10-24 01:20:23,871 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-24 01:20:23,871 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 95 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:23,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 374 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:23,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63592 states. [2024-10-24 01:20:24,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63592 to 63590. [2024-10-24 01:20:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63590 states, 63589 states have (on average 1.524508955951501) internal successors, (96942), 63589 states have internal predecessors, (96942), 0 states have call successors, (0), 0 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-24 01:20:25,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63590 states to 63590 states and 96942 transitions. [2024-10-24 01:20:25,351 INFO L78 Accepts]: Start accepts. Automaton has 63590 states and 96942 transitions. Word has length 99 [2024-10-24 01:20:25,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:25,354 INFO L471 AbstractCegarLoop]: Abstraction has 63590 states and 96942 transitions. [2024-10-24 01:20:25,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-24 01:20:25,355 INFO L276 IsEmpty]: Start isEmpty. Operand 63590 states and 96942 transitions. [2024-10-24 01:20:25,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:20:25,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:25,359 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] [2024-10-24 01:20:25,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:20:25,360 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:25,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:25,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1491540327, now seen corresponding path program 1 times [2024-10-24 01:20:25,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:25,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990001030] [2024-10-24 01:20:25,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:25,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:25,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 01:20:25,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:25,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990001030] [2024-10-24 01:20:25,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990001030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:25,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:25,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:25,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179553106] [2024-10-24 01:20:25,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:25,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:25,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:25,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:25,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:25,435 INFO L87 Difference]: Start difference. First operand 63590 states and 96942 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 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-24 01:20:27,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:27,045 INFO L93 Difference]: Finished difference Result 189890 states and 289215 transitions. [2024-10-24 01:20:27,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:27,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-24 01:20:27,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:27,404 INFO L225 Difference]: With dead ends: 189890 [2024-10-24 01:20:27,405 INFO L226 Difference]: Without dead ends: 126472 [2024-10-24 01:20:27,458 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-24 01:20:27,459 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 109 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:27,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 389 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:27,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126472 states. [2024-10-24 01:20:29,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126472 to 126470. [2024-10-24 01:20:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126470 states, 126469 states have (on average 1.508598945196056) internal successors, (190791), 126469 states have internal predecessors, (190791), 0 states have call successors, (0), 0 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-24 01:20:30,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126470 states to 126470 states and 190791 transitions. [2024-10-24 01:20:30,300 INFO L78 Accepts]: Start accepts. Automaton has 126470 states and 190791 transitions. Word has length 99 [2024-10-24 01:20:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:30,301 INFO L471 AbstractCegarLoop]: Abstraction has 126470 states and 190791 transitions. [2024-10-24 01:20:30,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 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-24 01:20:30,301 INFO L276 IsEmpty]: Start isEmpty. Operand 126470 states and 190791 transitions. [2024-10-24 01:20:30,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:20:30,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:30,310 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 01:20:30,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:20:30,310 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:30,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:30,310 INFO L85 PathProgramCache]: Analyzing trace with hash 782589003, now seen corresponding path program 1 times [2024-10-24 01:20:30,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:30,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457125119] [2024-10-24 01:20:30,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:30,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:20:30,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:30,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457125119] [2024-10-24 01:20:30,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457125119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:30,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:30,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:30,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420391967] [2024-10-24 01:20:30,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:30,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:30,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:30,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:30,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:30,368 INFO L87 Difference]: Start difference. First operand 126470 states and 190791 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:33,288 INFO L93 Difference]: Finished difference Result 377614 states and 569134 transitions. [2024-10-24 01:20:33,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:33,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-24 01:20:33,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:33,806 INFO L225 Difference]: With dead ends: 377614 [2024-10-24 01:20:33,807 INFO L226 Difference]: Without dead ends: 251544 [2024-10-24 01:20:34,165 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-24 01:20:34,166 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 129 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:34,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 405 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:34,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251544 states. [2024-10-24 01:20:38,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251544 to 251542. [2024-10-24 01:20:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251542 states, 251541 states have (on average 1.492559861016693) internal successors, (375440), 251541 states have internal predecessors, (375440), 0 states have call successors, (0), 0 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-24 01:20:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251542 states to 251542 states and 375440 transitions. [2024-10-24 01:20:39,752 INFO L78 Accepts]: Start accepts. Automaton has 251542 states and 375440 transitions. Word has length 99 [2024-10-24 01:20:39,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:39,752 INFO L471 AbstractCegarLoop]: Abstraction has 251542 states and 375440 transitions. [2024-10-24 01:20:39,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:39,753 INFO L276 IsEmpty]: Start isEmpty. Operand 251542 states and 375440 transitions. [2024-10-24 01:20:39,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:20:39,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:39,771 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 01:20:39,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:20:39,771 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:39,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:39,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1206235725, now seen corresponding path program 1 times [2024-10-24 01:20:39,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:39,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839411084] [2024-10-24 01:20:39,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:39,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:39,840 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:20:39,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:39,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839411084] [2024-10-24 01:20:39,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839411084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:39,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:39,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:39,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434670610] [2024-10-24 01:20:39,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:39,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:39,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:39,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:39,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:39,842 INFO L87 Difference]: Start difference. First operand 251542 states and 375440 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:42,913 INFO L93 Difference]: Finished difference Result 377990 states and 562842 transitions. [2024-10-24 01:20:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:42,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-24 01:20:42,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:43,448 INFO L225 Difference]: With dead ends: 377990 [2024-10-24 01:20:43,448 INFO L226 Difference]: Without dead ends: 251888 [2024-10-24 01:20:43,542 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-24 01:20:43,542 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 100 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:43,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 434 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:43,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251888 states. [2024-10-24 01:20:48,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251888 to 251886. [2024-10-24 01:20:48,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251886 states, 251885 states have (on average 1.4786589118049904) internal successors, (372452), 251885 states have internal predecessors, (372452), 0 states have call successors, (0), 0 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-24 01:20:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251886 states to 251886 states and 372452 transitions. [2024-10-24 01:20:49,193 INFO L78 Accepts]: Start accepts. Automaton has 251886 states and 372452 transitions. Word has length 99 [2024-10-24 01:20:49,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:49,193 INFO L471 AbstractCegarLoop]: Abstraction has 251886 states and 372452 transitions. [2024-10-24 01:20:49,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 251886 states and 372452 transitions. [2024-10-24 01:20:49,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:20:49,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:49,206 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 01:20:49,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 01:20:49,206 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:49,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:49,207 INFO L85 PathProgramCache]: Analyzing trace with hash 195118475, now seen corresponding path program 1 times [2024-10-24 01:20:49,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:49,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333240599] [2024-10-24 01:20:49,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:49,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:20:49,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:49,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333240599] [2024-10-24 01:20:49,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333240599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:49,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:49,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:49,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700281650] [2024-10-24 01:20:49,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:49,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:49,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:49,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:49,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:49,275 INFO L87 Difference]: Start difference. First operand 251886 states and 372452 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:52,348 INFO L93 Difference]: Finished difference Result 378534 states and 558401 transitions. [2024-10-24 01:20:52,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:52,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-24 01:20:52,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:52,942 INFO L225 Difference]: With dead ends: 378534 [2024-10-24 01:20:52,942 INFO L226 Difference]: Without dead ends: 252464 [2024-10-24 01:20:53,036 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-24 01:20:53,037 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 114 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:53,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 452 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:53,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252464 states.