./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf9b303f0455860ff73b360d674f9b56750c61e03c2589dbf0115b0e5bdacb76 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:44:19,066 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:44:19,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:44:19,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:44:19,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:44:19,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:44:19,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:44:19,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:44:19,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:44:19,172 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:44:19,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:44:19,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:44:19,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:44:19,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:44:19,176 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:44:19,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:44:19,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:44:19,177 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:44:19,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:44:19,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:44:19,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:44:19,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:44:19,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:44:19,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:44:19,183 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:44:19,183 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:44:19,183 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:44:19,183 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:44:19,184 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:44:19,184 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:44:19,184 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:44:19,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:44:19,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:44:19,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:44:19,185 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:44:19,185 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:44:19,185 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:44:19,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:44:19,186 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:44:19,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:44:19,186 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:44:19,188 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:44:19,188 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 -> bf9b303f0455860ff73b360d674f9b56750c61e03c2589dbf0115b0e5bdacb76 [2024-11-11 21:44:19,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:44:19,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:44:19,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:44:19,482 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:44:19,482 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:44:19,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2024-11-11 21:44:20,936 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:44:21,191 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:44:21,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2024-11-11 21:44:21,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c460f24/e834c927368d4e8fa3e122aada88c23a/FLAGb26e9c077 [2024-11-11 21:44:21,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c460f24/e834c927368d4e8fa3e122aada88c23a [2024-11-11 21:44:21,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:44:21,230 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:44:21,232 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:44:21,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:44:21,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:44:21,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:44:21" (1/1) ... [2024-11-11 21:44:21,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5566b4a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:44:21, skipping insertion in model container [2024-11-11 21:44:21,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:44:21" (1/1) ... [2024-11-11 21:44:21,298 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:44:21,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c[11904,11917] [2024-11-11 21:44:21,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:44:21,719 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:44:21,782 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c[11904,11917] [2024-11-11 21:44:21,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:44:21,841 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:44:21,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:44:21 WrapperNode [2024-11-11 21:44:21,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:44:21,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:44:21,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:44:21,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:44:21,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:44:21" (1/1) ... [2024-11-11 21:44:21,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:44:21" (1/1) ... [2024-11-11 21:44:21,912 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1047 [2024-11-11 21:44:21,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:44:21,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:44:21,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:44:21,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:44:21,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:44:21" (1/1) ... [2024-11-11 21:44:21,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:44:21" (1/1) ... [2024-11-11 21:44:21,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:44:21" (1/1) ... [2024-11-11 21:44:21,963 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 21:44:21,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:44:21" (1/1) ... [2024-11-11 21:44:21,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:44:21" (1/1) ... [2024-11-11 21:44:21,981 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:44:21" (1/1) ... [2024-11-11 21:44:21,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:44:21" (1/1) ... [2024-11-11 21:44:22,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:44:21" (1/1) ... [2024-11-11 21:44:22,008 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:44:21" (1/1) ... [2024-11-11 21:44:22,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:44:22,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:44:22,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:44:22,021 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:44:22,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:44:21" (1/1) ... [2024-11-11 21:44:22,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:44:22,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:44:22,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 21:44:22,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 21:44:22,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:44:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:44:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:44:22,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:44:22,249 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:44:22,250 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:44:23,122 INFO L? ?]: Removed 135 outVars from TransFormulas that were not future-live. [2024-11-11 21:44:23,123 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:44:23,147 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:44:23,150 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 21:44:23,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:44:23 BoogieIcfgContainer [2024-11-11 21:44:23,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:44:23,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:44:23,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:44:23,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:44:23,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:44:21" (1/3) ... [2024-11-11 21:44:23,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e7cc0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:44:23, skipping insertion in model container [2024-11-11 21:44:23,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:44:21" (2/3) ... [2024-11-11 21:44:23,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e7cc0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:44:23, skipping insertion in model container [2024-11-11 21:44:23,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:44:23" (3/3) ... [2024-11-11 21:44:23,157 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2024-11-11 21:44:23,171 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:44:23,171 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:44:23,243 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:44:23,251 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;@58022249, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:44:23,252 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:44:23,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 254 states, 252 states have (on average 1.6785714285714286) internal successors, (423), 253 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:23,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-11 21:44:23,272 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:23,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:44:23,274 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:44:23,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:23,281 INFO L85 PathProgramCache]: Analyzing trace with hash 526717400, now seen corresponding path program 1 times [2024-11-11 21:44:23,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:23,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458943688] [2024-11-11 21:44:23,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:23,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:23,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:23,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:23,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458943688] [2024-11-11 21:44:23,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458943688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:23,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:23,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:44:23,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355465057] [2024-11-11 21:44:23,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:23,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:44:23,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:23,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:44:23,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:44:23,902 INFO L87 Difference]: Start difference. First operand has 254 states, 252 states have (on average 1.6785714285714286) internal successors, (423), 253 states have internal predecessors, (423), 0 states have call successors, (0), 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 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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-11-11 21:44:24,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:24,053 INFO L93 Difference]: Finished difference Result 467 states and 765 transitions. [2024-11-11 21:44:24,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:44:24,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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 91 [2024-11-11 21:44:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:24,065 INFO L225 Difference]: With dead ends: 467 [2024-11-11 21:44:24,066 INFO L226 Difference]: Without dead ends: 251 [2024-11-11 21:44:24,069 INFO L434 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-11-11 21:44:24,072 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 109 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:24,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1092 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:44:24,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-11 21:44:24,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-11-11 21:44:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.496) internal successors, (374), 250 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:24,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 374 transitions. [2024-11-11 21:44:24,119 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 374 transitions. Word has length 91 [2024-11-11 21:44:24,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:24,119 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 374 transitions. [2024-11-11 21:44:24,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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-11-11 21:44:24,119 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 374 transitions. [2024-11-11 21:44:24,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-11 21:44:24,124 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:24,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:44:24,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:44:24,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:44:24,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:24,126 INFO L85 PathProgramCache]: Analyzing trace with hash 2028572103, now seen corresponding path program 1 times [2024-11-11 21:44:24,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:24,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263128969] [2024-11-11 21:44:24,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:24,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:24,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:24,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263128969] [2024-11-11 21:44:24,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263128969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:24,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:24,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:44:24,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354760684] [2024-11-11 21:44:24,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:24,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:44:24,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:24,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:44:24,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:24,386 INFO L87 Difference]: Start difference. First operand 251 states and 374 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:24,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:24,440 INFO L93 Difference]: Finished difference Result 569 states and 880 transitions. [2024-11-11 21:44:24,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:44:24,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-11-11 21:44:24,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:24,444 INFO L225 Difference]: With dead ends: 569 [2024-11-11 21:44:24,447 INFO L226 Difference]: Without dead ends: 368 [2024-11-11 21:44:24,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:24,449 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 207 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:24,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 759 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:44:24,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-11 21:44:24,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 366. [2024-11-11 21:44:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 1.5232876712328767) internal successors, (556), 365 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 556 transitions. [2024-11-11 21:44:24,486 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 556 transitions. Word has length 130 [2024-11-11 21:44:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:24,488 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 556 transitions. [2024-11-11 21:44:24,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:24,489 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 556 transitions. [2024-11-11 21:44:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-11 21:44:24,495 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:24,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:44:24,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:44:24,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:44:24,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:24,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1858506137, now seen corresponding path program 1 times [2024-11-11 21:44:24,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:24,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578526530] [2024-11-11 21:44:24,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:24,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:24,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:24,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:24,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578526530] [2024-11-11 21:44:24,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578526530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:24,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:24,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:44:24,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163395936] [2024-11-11 21:44:24,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:24,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:44:24,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:24,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:44:24,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:24,671 INFO L87 Difference]: Start difference. First operand 366 states and 556 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:24,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:24,710 INFO L93 Difference]: Finished difference Result 884 states and 1381 transitions. [2024-11-11 21:44:24,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:44:24,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2024-11-11 21:44:24,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:24,714 INFO L225 Difference]: With dead ends: 884 [2024-11-11 21:44:24,714 INFO L226 Difference]: Without dead ends: 574 [2024-11-11 21:44:24,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:24,716 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 194 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:24,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 644 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:44:24,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-11 21:44:24,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 572. [2024-11-11 21:44:24,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 571 states have (on average 1.5446584938704029) internal successors, (882), 571 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:24,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 882 transitions. [2024-11-11 21:44:24,750 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 882 transitions. Word has length 132 [2024-11-11 21:44:24,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:24,751 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 882 transitions. [2024-11-11 21:44:24,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:24,752 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 882 transitions. [2024-11-11 21:44:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-11 21:44:24,755 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:24,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:44:24,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:44:24,755 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:44:24,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:24,756 INFO L85 PathProgramCache]: Analyzing trace with hash -84400586, now seen corresponding path program 1 times [2024-11-11 21:44:24,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:24,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133721947] [2024-11-11 21:44:24,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:24,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:24,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:24,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133721947] [2024-11-11 21:44:24,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133721947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:24,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:24,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:44:24,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557518937] [2024-11-11 21:44:24,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:24,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:44:24,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:24,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:44:24,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:24,866 INFO L87 Difference]: Start difference. First operand 572 states and 882 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:24,922 INFO L93 Difference]: Finished difference Result 1444 states and 2269 transitions. [2024-11-11 21:44:24,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:44:24,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2024-11-11 21:44:24,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:24,930 INFO L225 Difference]: With dead ends: 1444 [2024-11-11 21:44:24,930 INFO L226 Difference]: Without dead ends: 934 [2024-11-11 21:44:24,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:24,934 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 181 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:24,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 687 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:44:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-11-11 21:44:24,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 932. [2024-11-11 21:44:24,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 931 states have (on average 1.5574650912996777) internal successors, (1450), 931 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1450 transitions. [2024-11-11 21:44:24,963 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1450 transitions. Word has length 134 [2024-11-11 21:44:24,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:24,963 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1450 transitions. [2024-11-11 21:44:24,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1450 transitions. [2024-11-11 21:44:24,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-11 21:44:24,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:24,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:44:24,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:44:24,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:44:24,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:24,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2009321658, now seen corresponding path program 1 times [2024-11-11 21:44:24,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:24,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933884924] [2024-11-11 21:44:24,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:24,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:25,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:25,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933884924] [2024-11-11 21:44:25,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933884924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:25,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:25,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:44:25,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017356048] [2024-11-11 21:44:25,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:25,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:44:25,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:25,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:44:25,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:25,095 INFO L87 Difference]: Start difference. First operand 932 states and 1450 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:25,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:25,140 INFO L93 Difference]: Finished difference Result 2410 states and 3793 transitions. [2024-11-11 21:44:25,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:44:25,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2024-11-11 21:44:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:25,148 INFO L225 Difference]: With dead ends: 2410 [2024-11-11 21:44:25,148 INFO L226 Difference]: Without dead ends: 1546 [2024-11-11 21:44:25,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:25,151 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 168 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:25,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 651 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:44:25,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2024-11-11 21:44:25,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2024-11-11 21:44:25,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1543 states have (on average 1.561892417368762) internal successors, (2410), 1543 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:25,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2410 transitions. [2024-11-11 21:44:25,192 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2410 transitions. Word has length 136 [2024-11-11 21:44:25,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:25,192 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2410 transitions. [2024-11-11 21:44:25,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2410 transitions. [2024-11-11 21:44:25,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-11 21:44:25,198 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:25,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:44:25,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:44:25,198 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:44:25,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:25,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1215616482, now seen corresponding path program 1 times [2024-11-11 21:44:25,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:25,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564647689] [2024-11-11 21:44:25,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:25,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:25,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:25,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:25,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564647689] [2024-11-11 21:44:25,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564647689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:25,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:25,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:44:25,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190736358] [2024-11-11 21:44:25,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:25,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:44:25,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:25,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:44:25,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:25,317 INFO L87 Difference]: Start difference. First operand 1544 states and 2410 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:25,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:25,360 INFO L93 Difference]: Finished difference Result 4020 states and 6313 transitions. [2024-11-11 21:44:25,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:44:25,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-11-11 21:44:25,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:25,371 INFO L225 Difference]: With dead ends: 4020 [2024-11-11 21:44:25,372 INFO L226 Difference]: Without dead ends: 2550 [2024-11-11 21:44:25,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:25,376 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 155 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:25,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 584 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:44:25,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2024-11-11 21:44:25,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2548. [2024-11-11 21:44:25,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 2547 states have (on average 1.558696505692972) internal successors, (3970), 2547 states have internal predecessors, (3970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 3970 transitions. [2024-11-11 21:44:25,469 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 3970 transitions. Word has length 138 [2024-11-11 21:44:25,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:25,469 INFO L471 AbstractCegarLoop]: Abstraction has 2548 states and 3970 transitions. [2024-11-11 21:44:25,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:25,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 3970 transitions. [2024-11-11 21:44:25,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-11 21:44:25,477 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:25,477 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:44:25,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:44:25,477 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:44:25,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:25,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2020324179, now seen corresponding path program 1 times [2024-11-11 21:44:25,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:25,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576181043] [2024-11-11 21:44:25,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:25,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:25,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:25,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:25,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576181043] [2024-11-11 21:44:25,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576181043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:25,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:25,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:44:25,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224682065] [2024-11-11 21:44:25,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:25,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:44:25,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:25,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:44:25,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:25,598 INFO L87 Difference]: Start difference. First operand 2548 states and 3970 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:25,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:25,648 INFO L93 Difference]: Finished difference Result 6582 states and 10273 transitions. [2024-11-11 21:44:25,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:44:25,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2024-11-11 21:44:25,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:25,664 INFO L225 Difference]: With dead ends: 6582 [2024-11-11 21:44:25,665 INFO L226 Difference]: Without dead ends: 4114 [2024-11-11 21:44:25,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:25,670 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 142 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:25,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 579 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:44:25,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4114 states. [2024-11-11 21:44:25,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4114 to 4112. [2024-11-11 21:44:25,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4112 states, 4111 states have (on average 1.5475553393334955) internal successors, (6362), 4111 states have internal predecessors, (6362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:25,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4112 states to 4112 states and 6362 transitions. [2024-11-11 21:44:25,765 INFO L78 Accepts]: Start accepts. Automaton has 4112 states and 6362 transitions. Word has length 140 [2024-11-11 21:44:25,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:25,766 INFO L471 AbstractCegarLoop]: Abstraction has 4112 states and 6362 transitions. [2024-11-11 21:44:25,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:25,766 INFO L276 IsEmpty]: Start isEmpty. Operand 4112 states and 6362 transitions. [2024-11-11 21:44:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-11 21:44:25,776 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:25,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:44:25,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:44:25,776 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:44:25,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:25,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1664881719, now seen corresponding path program 1 times [2024-11-11 21:44:25,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:25,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923258189] [2024-11-11 21:44:25,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:25,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:26,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:26,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:26,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923258189] [2024-11-11 21:44:26,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923258189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:26,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:26,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:44:26,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574566657] [2024-11-11 21:44:26,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:26,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:44:26,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:26,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:44:26,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:44:26,047 INFO L87 Difference]: Start difference. First operand 4112 states and 6362 transitions. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:26,752 INFO L93 Difference]: Finished difference Result 43369 states and 66791 transitions. [2024-11-11 21:44:26,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:44:26,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2024-11-11 21:44:26,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:26,866 INFO L225 Difference]: With dead ends: 43369 [2024-11-11 21:44:26,867 INFO L226 Difference]: Without dead ends: 39343 [2024-11-11 21:44:26,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:44:26,883 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 2680 mSDsluCounter, 3081 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2680 SdHoareTripleChecker+Valid, 3620 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:26,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2680 Valid, 3620 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:44:26,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39343 states. [2024-11-11 21:44:27,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39343 to 8072. [2024-11-11 21:44:27,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8072 states, 8071 states have (on average 1.5186470078057241) internal successors, (12257), 8071 states have internal predecessors, (12257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 12257 transitions. [2024-11-11 21:44:27,438 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 12257 transitions. Word has length 142 [2024-11-11 21:44:27,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:27,439 INFO L471 AbstractCegarLoop]: Abstraction has 8072 states and 12257 transitions. [2024-11-11 21:44:27,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:27,439 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 12257 transitions. [2024-11-11 21:44:27,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 21:44:27,460 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:27,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:44:27,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:44:27,460 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:44:27,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:27,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1887106134, now seen corresponding path program 1 times [2024-11-11 21:44:27,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:27,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403569519] [2024-11-11 21:44:27,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:27,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:27,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:27,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403569519] [2024-11-11 21:44:27,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403569519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:27,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:27,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:44:27,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637564271] [2024-11-11 21:44:27,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:27,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:44:27,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:27,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:44:27,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:44:27,976 INFO L87 Difference]: Start difference. First operand 8072 states and 12257 transitions. Second operand has 8 states, 8 states have (on average 18.25) internal successors, (146), 8 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:28,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:28,372 INFO L93 Difference]: Finished difference Result 16060 states and 24414 transitions. [2024-11-11 21:44:28,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:44:28,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 8 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2024-11-11 21:44:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:28,388 INFO L225 Difference]: With dead ends: 16060 [2024-11-11 21:44:28,389 INFO L226 Difference]: Without dead ends: 8074 [2024-11-11 21:44:28,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:44:28,401 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 1402 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:28,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1402 Valid, 1378 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:44:28,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2024-11-11 21:44:28,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2024-11-11 21:44:28,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8072 states, 8071 states have (on average 1.5026638582579606) internal successors, (12128), 8071 states have internal predecessors, (12128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:28,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 12128 transitions. [2024-11-11 21:44:28,599 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 12128 transitions. Word has length 146 [2024-11-11 21:44:28,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:28,599 INFO L471 AbstractCegarLoop]: Abstraction has 8072 states and 12128 transitions. [2024-11-11 21:44:28,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 8 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:28,603 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 12128 transitions. [2024-11-11 21:44:28,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 21:44:28,622 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:28,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:44:28,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:44:28,623 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:44:28,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:28,623 INFO L85 PathProgramCache]: Analyzing trace with hash -104991063, now seen corresponding path program 1 times [2024-11-11 21:44:28,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:28,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784979273] [2024-11-11 21:44:28,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:28,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:28,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:28,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784979273] [2024-11-11 21:44:28,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784979273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:28,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:28,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:44:28,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319470671] [2024-11-11 21:44:28,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:28,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:44:28,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:28,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:44:28,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:28,739 INFO L87 Difference]: Start difference. First operand 8072 states and 12128 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:28,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:28,813 INFO L93 Difference]: Finished difference Result 18751 states and 28163 transitions. [2024-11-11 21:44:28,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:44:28,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2024-11-11 21:44:28,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:28,833 INFO L225 Difference]: With dead ends: 18751 [2024-11-11 21:44:28,833 INFO L226 Difference]: Without dead ends: 10763 [2024-11-11 21:44:28,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:28,845 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 220 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:28,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 704 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:44:28,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10763 states. [2024-11-11 21:44:29,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10763 to 10761. [2024-11-11 21:44:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10761 states, 10760 states have (on average 1.4812267657992566) internal successors, (15938), 10760 states have internal predecessors, (15938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10761 states to 10761 states and 15938 transitions. [2024-11-11 21:44:29,092 INFO L78 Accepts]: Start accepts. Automaton has 10761 states and 15938 transitions. Word has length 146 [2024-11-11 21:44:29,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:29,092 INFO L471 AbstractCegarLoop]: Abstraction has 10761 states and 15938 transitions. [2024-11-11 21:44:29,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:29,093 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 15938 transitions. [2024-11-11 21:44:29,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 21:44:29,117 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:29,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:44:29,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:44:29,117 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:44:29,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:29,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1280692474, now seen corresponding path program 1 times [2024-11-11 21:44:29,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:29,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980816813] [2024-11-11 21:44:29,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:29,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:29,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:29,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980816813] [2024-11-11 21:44:29,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980816813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:29,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:29,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:44:29,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821104081] [2024-11-11 21:44:29,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:29,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:44:29,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:29,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:44:29,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:29,237 INFO L87 Difference]: Start difference. First operand 10761 states and 15938 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:29,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:29,562 INFO L93 Difference]: Finished difference Result 30946 states and 45837 transitions. [2024-11-11 21:44:29,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:44:29,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2024-11-11 21:44:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:29,604 INFO L225 Difference]: With dead ends: 30946 [2024-11-11 21:44:29,604 INFO L226 Difference]: Without dead ends: 21369 [2024-11-11 21:44:29,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:29,622 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 219 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:29,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 392 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:44:29,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21369 states. [2024-11-11 21:44:30,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21369 to 21367. [2024-11-11 21:44:30,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21367 states, 21366 states have (on average 1.4752410371618458) internal successors, (31520), 21366 states have internal predecessors, (31520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:30,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21367 states to 21367 states and 31520 transitions. [2024-11-11 21:44:30,074 INFO L78 Accepts]: Start accepts. Automaton has 21367 states and 31520 transitions. Word has length 147 [2024-11-11 21:44:30,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:30,074 INFO L471 AbstractCegarLoop]: Abstraction has 21367 states and 31520 transitions. [2024-11-11 21:44:30,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:30,074 INFO L276 IsEmpty]: Start isEmpty. Operand 21367 states and 31520 transitions. [2024-11-11 21:44:30,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 21:44:30,116 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:30,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:44:30,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:44:30,117 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:44:30,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:30,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1511438497, now seen corresponding path program 1 times [2024-11-11 21:44:30,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:30,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464362955] [2024-11-11 21:44:30,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:30,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:30,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:30,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:30,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464362955] [2024-11-11 21:44:30,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464362955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:30,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:30,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:44:30,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072023837] [2024-11-11 21:44:30,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:30,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:44:30,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:30,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:44:30,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:30,215 INFO L87 Difference]: Start difference. First operand 21367 states and 31520 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:30,712 INFO L93 Difference]: Finished difference Result 61046 states and 89865 transitions. [2024-11-11 21:44:30,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:44:30,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2024-11-11 21:44:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:30,918 INFO L225 Difference]: With dead ends: 61046 [2024-11-11 21:44:30,922 INFO L226 Difference]: Without dead ends: 42390 [2024-11-11 21:44:30,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:30,978 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 201 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:30,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 404 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:44:31,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42390 states. [2024-11-11 21:44:31,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42390 to 42388. [2024-11-11 21:44:31,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42388 states, 42387 states have (on average 1.4667468799396042) internal successors, (62171), 42387 states have internal predecessors, (62171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:31,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42388 states to 42388 states and 62171 transitions. [2024-11-11 21:44:31,868 INFO L78 Accepts]: Start accepts. Automaton has 42388 states and 62171 transitions. Word has length 147 [2024-11-11 21:44:31,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:31,869 INFO L471 AbstractCegarLoop]: Abstraction has 42388 states and 62171 transitions. [2024-11-11 21:44:31,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:31,869 INFO L276 IsEmpty]: Start isEmpty. Operand 42388 states and 62171 transitions. [2024-11-11 21:44:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 21:44:32,087 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:32,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:44:32,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:44:32,087 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:44:32,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:32,088 INFO L85 PathProgramCache]: Analyzing trace with hash 597943516, now seen corresponding path program 1 times [2024-11-11 21:44:32,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:32,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016278665] [2024-11-11 21:44:32,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:32,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:32,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:32,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:32,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016278665] [2024-11-11 21:44:32,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016278665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:32,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:32,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:44:32,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027842338] [2024-11-11 21:44:32,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:32,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:44:32,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:32,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:44:32,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:44:32,439 INFO L87 Difference]: Start difference. First operand 42388 states and 62171 transitions. Second operand has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:33,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:33,669 INFO L93 Difference]: Finished difference Result 260924 states and 382592 transitions. [2024-11-11 21:44:33,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:44:33,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2024-11-11 21:44:33,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:34,260 INFO L225 Difference]: With dead ends: 260924 [2024-11-11 21:44:34,260 INFO L226 Difference]: Without dead ends: 226874 [2024-11-11 21:44:34,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:44:34,371 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 2137 mSDsluCounter, 1861 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2137 SdHoareTripleChecker+Valid, 2468 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:34,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2137 Valid, 2468 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:44:34,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226874 states. [2024-11-11 21:44:36,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226874 to 78934. [2024-11-11 21:44:36,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78934 states, 78933 states have (on average 1.4596809952744734) internal successors, (115217), 78933 states have internal predecessors, (115217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78934 states to 78934 states and 115217 transitions. [2024-11-11 21:44:36,573 INFO L78 Accepts]: Start accepts. Automaton has 78934 states and 115217 transitions. Word has length 147 [2024-11-11 21:44:36,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:36,573 INFO L471 AbstractCegarLoop]: Abstraction has 78934 states and 115217 transitions. [2024-11-11 21:44:36,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:36,573 INFO L276 IsEmpty]: Start isEmpty. Operand 78934 states and 115217 transitions. [2024-11-11 21:44:36,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 21:44:36,673 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:36,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:44:36,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:44:36,674 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:44:36,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:36,676 INFO L85 PathProgramCache]: Analyzing trace with hash -473675422, now seen corresponding path program 1 times [2024-11-11 21:44:36,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:36,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469557621] [2024-11-11 21:44:36,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:36,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:37,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:37,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469557621] [2024-11-11 21:44:37,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469557621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:37,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:37,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:44:37,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405433692] [2024-11-11 21:44:37,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:37,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:44:37,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:37,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:44:37,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:44:37,309 INFO L87 Difference]: Start difference. First operand 78934 states and 115217 transitions. Second operand has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:38,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:38,593 INFO L93 Difference]: Finished difference Result 296572 states and 434416 transitions. [2024-11-11 21:44:38,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:44:38,593 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2024-11-11 21:44:38,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:39,119 INFO L225 Difference]: With dead ends: 296572 [2024-11-11 21:44:39,119 INFO L226 Difference]: Without dead ends: 262522 [2024-11-11 21:44:39,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:44:39,190 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 2572 mSDsluCounter, 1649 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2572 SdHoareTripleChecker+Valid, 2140 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:39,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2572 Valid, 2140 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:44:39,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262522 states. [2024-11-11 21:44:41,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262522 to 132344. [2024-11-11 21:44:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132344 states, 132343 states have (on average 1.4543950190036496) internal successors, (192479), 132343 states have internal predecessors, (192479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132344 states to 132344 states and 192479 transitions. [2024-11-11 21:44:42,297 INFO L78 Accepts]: Start accepts. Automaton has 132344 states and 192479 transitions. Word has length 147 [2024-11-11 21:44:42,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:42,298 INFO L471 AbstractCegarLoop]: Abstraction has 132344 states and 192479 transitions. [2024-11-11 21:44:42,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:42,298 INFO L276 IsEmpty]: Start isEmpty. Operand 132344 states and 192479 transitions. [2024-11-11 21:44:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 21:44:42,410 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:42,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:44:42,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:44:42,410 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:44:42,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:42,411 INFO L85 PathProgramCache]: Analyzing trace with hash -446928346, now seen corresponding path program 1 times [2024-11-11 21:44:42,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:42,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737535163] [2024-11-11 21:44:42,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:42,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:42,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:42,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:42,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737535163] [2024-11-11 21:44:42,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737535163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:42,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:42,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:44:42,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123513353] [2024-11-11 21:44:42,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:42,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:44:42,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:42,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:44:42,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:44:42,670 INFO L87 Difference]: Start difference. First operand 132344 states and 192479 transitions. Second operand has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:44,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:44,492 INFO L93 Difference]: Finished difference Result 331756 states and 485536 transitions. [2024-11-11 21:44:44,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:44:44,493 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2024-11-11 21:44:44,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:44,995 INFO L225 Difference]: With dead ends: 331756 [2024-11-11 21:44:44,995 INFO L226 Difference]: Without dead ends: 297706 [2024-11-11 21:44:45,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:44:45,106 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 2393 mSDsluCounter, 1873 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2393 SdHoareTripleChecker+Valid, 2332 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:45,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2393 Valid, 2332 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:44:45,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297706 states. [2024-11-11 21:44:48,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297706 to 167568. [2024-11-11 21:44:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167568 states, 167567 states have (on average 1.4535499233142564) internal successors, (243567), 167567 states have internal predecessors, (243567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167568 states to 167568 states and 243567 transitions. [2024-11-11 21:44:48,821 INFO L78 Accepts]: Start accepts. Automaton has 167568 states and 243567 transitions. Word has length 147 [2024-11-11 21:44:48,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:48,821 INFO L471 AbstractCegarLoop]: Abstraction has 167568 states and 243567 transitions. [2024-11-11 21:44:48,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 167568 states and 243567 transitions. [2024-11-11 21:44:48,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 21:44:48,961 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:48,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:44:48,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:44:48,962 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:44:48,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:48,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1972266254, now seen corresponding path program 1 times [2024-11-11 21:44:48,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:48,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603727115] [2024-11-11 21:44:48,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:48,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:49,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:49,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603727115] [2024-11-11 21:44:49,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603727115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:49,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:49,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:44:49,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732013032] [2024-11-11 21:44:49,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:49,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:44:49,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:49,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:44:49,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:44:49,893 INFO L87 Difference]: Start difference. First operand 167568 states and 243567 transitions. Second operand has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:51,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:51,545 INFO L93 Difference]: Finished difference Result 366284 states and 535680 transitions. [2024-11-11 21:44:51,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:44:51,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2024-11-11 21:44:51,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:52,124 INFO L225 Difference]: With dead ends: 366284 [2024-11-11 21:44:52,124 INFO L226 Difference]: Without dead ends: 332234 [2024-11-11 21:44:52,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:44:52,255 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 2128 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2128 SdHoareTripleChecker+Valid, 2637 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:52,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2128 Valid, 2637 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:44:52,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332234 states. [2024-11-11 21:44:56,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332234 to 203332. [2024-11-11 21:44:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203332 states, 203331 states have (on average 1.453565860591843) internal successors, (295555), 203331 states have internal predecessors, (295555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:56,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203332 states to 203332 states and 295555 transitions. [2024-11-11 21:44:56,758 INFO L78 Accepts]: Start accepts. Automaton has 203332 states and 295555 transitions. Word has length 147 [2024-11-11 21:44:56,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:56,758 INFO L471 AbstractCegarLoop]: Abstraction has 203332 states and 295555 transitions. [2024-11-11 21:44:56,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 203332 states and 295555 transitions. [2024-11-11 21:44:57,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 21:44:57,720 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:57,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:44:57,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:44:57,721 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:44:57,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:57,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1932345232, now seen corresponding path program 1 times [2024-11-11 21:44:57,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:57,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222511371] [2024-11-11 21:44:57,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:57,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:58,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:58,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222511371] [2024-11-11 21:44:58,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222511371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:58,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:58,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:44:58,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499785118] [2024-11-11 21:44:58,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:58,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:44:58,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:58,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:44:58,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:44:58,236 INFO L87 Difference]: Start difference. First operand 203332 states and 295555 transitions. Second operand has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:59,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:59,649 INFO L93 Difference]: Finished difference Result 402236 states and 587976 transitions. [2024-11-11 21:44:59,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:44:59,650 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2024-11-11 21:44:59,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:45:01,240 INFO L225 Difference]: With dead ends: 402236 [2024-11-11 21:45:01,240 INFO L226 Difference]: Without dead ends: 368186 [2024-11-11 21:45:01,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:45:01,311 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 2246 mSDsluCounter, 2325 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2246 SdHoareTripleChecker+Valid, 2825 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:45:01,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2246 Valid, 2825 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:45:01,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368186 states. [2024-11-11 21:45:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368186 to 239478. [2024-11-11 21:45:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239478 states, 239477 states have (on average 1.4538389908007867) internal successors, (348161), 239477 states have internal predecessors, (348161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:45:06,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239478 states to 239478 states and 348161 transitions. [2024-11-11 21:45:06,286 INFO L78 Accepts]: Start accepts. Automaton has 239478 states and 348161 transitions. Word has length 147 [2024-11-11 21:45:06,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:45:06,286 INFO L471 AbstractCegarLoop]: Abstraction has 239478 states and 348161 transitions. [2024-11-11 21:45:06,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:45:06,287 INFO L276 IsEmpty]: Start isEmpty. Operand 239478 states and 348161 transitions. [2024-11-11 21:45:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 21:45:06,520 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:45:06,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:45:06,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:45:06,520 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:45:06,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:45:06,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1832603772, now seen corresponding path program 1 times [2024-11-11 21:45:06,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:45:06,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084576202] [2024-11-11 21:45:06,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:45:06,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:45:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:45:06,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:45:06,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:45:06,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084576202] [2024-11-11 21:45:06,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084576202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:45:06,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:45:06,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:45:06,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15580205] [2024-11-11 21:45:06,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:45:06,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:45:06,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:45:06,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:45:06,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:45:06,821 INFO L87 Difference]: Start difference. First operand 239478 states and 348161 transitions. Second operand has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:45:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:45:08,923 INFO L93 Difference]: Finished difference Result 416546 states and 609258 transitions. [2024-11-11 21:45:08,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:45:08,923 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2024-11-11 21:45:08,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:45:09,531 INFO L225 Difference]: With dead ends: 416546 [2024-11-11 21:45:09,531 INFO L226 Difference]: Without dead ends: 393504 [2024-11-11 21:45:09,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:45:09,641 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 2244 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2244 SdHoareTripleChecker+Valid, 2719 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:45:09,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2244 Valid, 2719 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:45:09,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393504 states.